Matches in value-assignements (V): {{numOfValueMatches}}
Matches in edge-description: {{numOfDescriptionMatches}}
-V- |
{{line.desc}}
|
Zoom Factor (%)
Run scripts/report-generator.py to display CFAs.
Zoom Factor (%)
Run scripts/report-generator.py to display ARG.
1 | int num_of_inputs_at_724 = 2; int INPUTS_at_724[2]; int input_at_724_counter = 0;int num_of_inputs_at_742 = 2; int INPUTS_at_742[2]; int input_at_742_counter = 0;int num_of_inputs_at_714 = 2; int INPUTS_at_714[2]; int input_at_714_counter = 0;int num_of_inputs_at_734 = 2; int INPUTS_at_734[2]; int input_at_734_counter = 0;int initialize_reads() { for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_724[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_742[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_714[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_734[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);extern void __VERIFIER_error() __attribute__ ((__noreturn__)); |
2 | |
3 | extern int __VERIFIER_nondet_int(void); |
4 | //extern int printf (__const char *__restrict __format, ...); |
5 | /* Generated by CIL v. 1.3.7 */ |
6 | /* print_CIL_Input is true */ |
7 | |
8 | struct JoinPoint { |
9 | void **(*fp)(struct JoinPoint * ) ; |
10 | void **args ; |
11 | int argsCount ; |
12 | char const **argsType ; |
13 | void *(*arg)(int , struct JoinPoint * ) ; |
14 | char const *(*argType)(int , struct JoinPoint * ) ; |
15 | void **retValue ; |
16 | char const *retType ; |
17 | char const *funcName ; |
18 | char const *targetName ; |
19 | char const *fileName ; |
20 | char const *kind ; |
21 | void *excep_return ; |
22 | }; |
23 | struct __UTAC__CFLOW_FUNC { |
24 | int (*func)(int , int ) ; |
25 | int val ; |
26 | struct __UTAC__CFLOW_FUNC *next ; |
27 | }; |
28 | struct __UTAC__EXCEPTION { |
29 | void *jumpbuf ; |
30 | unsigned long long prtValue ; |
31 | int pops ; |
32 | struct __UTAC__CFLOW_FUNC *cflowfuncs ; |
33 | }; |
34 | typedef unsigned int size_t; |
35 | struct __ACC__ERR { |
36 | void *v ; |
37 | struct __ACC__ERR *next ; |
38 | }; |
39 | #pragma merger(0,"Test.i","") |
40 | int cleanupTimeShifts = 4; |
41 | void timeShift(void) ; |
42 | void cleanup(void) |
43 | { int i ; |
44 | int __cil_tmp2 ; |
45 | |
46 | { |
47 | { |
48 | timeShift(); |
49 | i = 0; |
50 | } |
51 | { |
52 | while (1) { |
53 | while_0_continue: /* CIL Label */ ; |
54 | { |
55 | __cil_tmp2 = cleanupTimeShifts - 1; |
56 | if (i < __cil_tmp2) { |
57 | |
58 | } else { |
59 | goto while_0_break; |
60 | } |
61 | } |
62 | { |
63 | timeShift(); |
64 | i = i + 1; |
65 | } |
66 | } |
67 | while_0_break: /* CIL Label */ ; |
68 | } |
69 | return; |
70 | } |
71 | } |
72 | void printPump(void) ; |
73 | void waterRise(void) ; |
74 | void changeMethaneLevel(void) ; |
75 | void Specification2(void) |
76 | { |
77 | |
78 | { |
79 | { |
80 | timeShift(); |
81 | printPump(); |
82 | timeShift(); |
83 | printPump(); |
84 | timeShift(); |
85 | printPump(); |
86 | waterRise(); |
87 | printPump(); |
88 | timeShift(); |
89 | printPump(); |
90 | changeMethaneLevel(); |
91 | printPump(); |
92 | timeShift(); |
93 | printPump(); |
94 | cleanup(); |
95 | } |
96 | return; |
97 | } |
98 | } |
99 | void setup(void) |
100 | { |
101 | |
102 | { |
103 | return; |
104 | } |
105 | } |
106 | void __utac_acc__Specification2_spec__1(void) ; |
107 | void test(void) ; |
108 | void runTest(void) |
109 | { |
110 | |
111 | { |
112 | { |
113 | __utac_acc__Specification2_spec__1(); |
114 | test(); |
115 | } |
116 | return; |
117 | } |
118 | } |
119 | void select_helpers(void) ; |
120 | void select_features(void) ; |
121 | int valid_product(void) ; |
122 | int main(void) |
123 | {initialize_reads(); int retValue_acc ; |
124 | int tmp ; |
125 | |
126 | { |
127 | { |
128 | select_helpers(); |
129 | select_features(); |
130 | tmp = valid_product(); |
131 | } |
132 | if (tmp != 0) { |
133 | { |
134 | setup(); |
135 | runTest(); |
136 | } |
137 | } else { |
138 | |
139 | } |
140 | retValue_acc = 0; |
141 | return (retValue_acc); |
142 | return (retValue_acc); |
143 | } |
144 | } |
145 | #pragma merger(0,"Environment.i","") |
146 | void lowerWaterLevel(void) ; |
147 | int isMethaneLevelCritical(void) ; |
148 | int getWaterLevel(void) ; |
149 | void printEnvironment(void) ; |
150 | int isHighWaterSensorDry(void) ; |
151 | int waterLevel = 1; |
152 | int methaneLevelCritical = 0; |
153 | void lowerWaterLevel(void) |
154 | { |
155 | |
156 | { |
157 | if (waterLevel > 0) { |
158 | waterLevel = waterLevel - 1; |
159 | } else { |
160 | |
161 | } |
162 | return; |
163 | } |
164 | } |
165 | void waterRise(void) |
166 | { |
167 | |
168 | { |
169 | if (waterLevel < 2) { |
170 | waterLevel = waterLevel + 1; |
171 | } else { |
172 | |
173 | } |
174 | return; |
175 | } |
176 | } |
177 | void changeMethaneLevel(void) |
178 | { |
179 | |
180 | { |
181 | if (methaneLevelCritical != 0) { |
182 | methaneLevelCritical = 0; |
183 | } else { |
184 | methaneLevelCritical = 1; |
185 | } |
186 | return; |
187 | } |
188 | } |
189 | int isMethaneLevelCritical(void) |
190 | { int retValue_acc ; |
191 | |
192 | { |
193 | retValue_acc = methaneLevelCritical; |
194 | return (retValue_acc); |
195 | return (retValue_acc); |
196 | } |
197 | } |
198 | void printEnvironment(void) |
199 | { |
200 | |
201 | { |
202 | { |
203 | // printf("Env(Water:%i", waterLevel); |
204 | // printf(",Meth:"); |
205 | } |
206 | if (methaneLevelCritical != 0) { |
207 | { |
208 | // printf("CRIT"); |
209 | } |
210 | } else { |
211 | { |
212 | // printf("OK"); |
213 | } |
214 | } |
215 | { |
216 | // printf(")"); |
217 | } |
218 | return; |
219 | } |
220 | } |
221 | int getWaterLevel(void) |
222 | { int retValue_acc ; |
223 | |
224 | { |
225 | retValue_acc = waterLevel; |
226 | return (retValue_acc); |
227 | return (retValue_acc); |
228 | } |
229 | } |
230 | int isHighWaterSensorDry(void) |
231 | { int retValue_acc ; |
232 | |
233 | { |
234 | if (waterLevel < 2) { |
235 | retValue_acc = 1; |
236 | return (retValue_acc); |
237 | } else { |
238 | retValue_acc = 0; |
239 | return (retValue_acc); |
240 | } |
241 | return (retValue_acc); |
242 | } |
243 | } |
244 | #pragma merger(0,"wsllib_check.i","") |
245 | void __automaton_fail(void) |
246 | { |
247 | |
248 | { |
249 | __VERIFIER_assume(!((0 != INPUTS_at_714[1] && 0 == INPUTS_at_714[0] && 0 == INPUTS_at_724[1] && 0 == INPUTS_at_734[1] && 0 == INPUTS_at_734[0])));__VERIFIER_assume(!((0 != INPUTS_at_734[1])));__VERIFIER_assume(!((0 == INPUTS_at_724[0])));__VERIFIER_assume(!((0 == INPUTS_at_742[1])));__VERIFIER_assume(!((0 != INPUTS_at_714[0] && 0 == INPUTS_at_724[0] && 0 == INPUTS_at_742[1] && 0 == INPUTS_at_734[1])));__VERIFIER_error(); |
250 | return; |
251 | } |
252 | } |
253 | #pragma merger(0,"Specification2_spec.i","") |
254 | int isPumpRunning(void) ; |
255 | int methAndRunningLastTime ; |
256 | void __utac_acc__Specification2_spec__1(void) |
257 | { |
258 | |
259 | { |
260 | methAndRunningLastTime = 0; |
261 | return; |
262 | } |
263 | } |
264 | inline static void __utac_acc__Specification2_spec__2(void) |
265 | { int tmp ; |
266 | int tmp___0 ; |
267 | |
268 | { |
269 | { |
270 | tmp = isMethaneLevelCritical(); |
271 | } |
272 | if (tmp != 0) { |
273 | { |
274 | tmp___0 = isPumpRunning(); |
275 | } |
276 | if (tmp___0 != 0) { |
277 | if (methAndRunningLastTime != 0) { |
278 | { |
279 | __automaton_fail(); |
280 | } |
281 | } else { |
282 | methAndRunningLastTime = 1; |
283 | } |
284 | } else { |
285 | methAndRunningLastTime = 0; |
286 | } |
287 | } else { |
288 | methAndRunningLastTime = 0; |
289 | } |
290 | return; |
291 | } |
292 | } |
293 | #pragma merger(0,"featureselect.i","") |
294 | int select_one(void) ; |
295 | int select_one(void) |
296 | { int retValue_acc ; |
297 | int choice = __VERIFIER_nondet_int(); |
298 | |
299 | { |
300 | retValue_acc = choice; |
301 | return (retValue_acc); |
302 | return (retValue_acc); |
303 | } |
304 | } |
305 | void select_features(void) |
306 | { |
307 | |
308 | { |
309 | return; |
310 | } |
311 | } |
312 | void select_helpers(void) |
313 | { |
314 | |
315 | { |
316 | return; |
317 | } |
318 | } |
319 | int valid_product(void) |
320 | { int retValue_acc ; |
321 | |
322 | { |
323 | retValue_acc = 1; |
324 | return (retValue_acc); |
325 | return (retValue_acc); |
326 | } |
327 | } |
328 | #pragma merger(0,"libacc.i","") |
329 | extern __attribute__((__nothrow__, __noreturn__)) void __assert_fail(char const *__assertion , |
330 | char const *__file , |
331 | unsigned int __line , |
332 | char const *__function ) ; |
333 | extern __attribute__((__nothrow__)) void *malloc(size_t __size ) __attribute__((__malloc__)) ; |
334 | extern __attribute__((__nothrow__)) void free(void *__ptr ) ; |
335 | void __utac__exception__cf_handler_set(void *exception , int (*cflow_func)(int , |
336 | int ) , |
337 | int val ) |
338 | { struct __UTAC__EXCEPTION *excep ; |
339 | struct __UTAC__CFLOW_FUNC *cf ; |
340 | void *tmp ; |
341 | unsigned long __cil_tmp7 ; |
342 | unsigned long __cil_tmp8 ; |
343 | unsigned long __cil_tmp9 ; |
344 | unsigned long __cil_tmp10 ; |
345 | unsigned long __cil_tmp11 ; |
346 | unsigned long __cil_tmp12 ; |
347 | unsigned long __cil_tmp13 ; |
348 | unsigned long __cil_tmp14 ; |
349 | int (**mem_15)(int , int ) ; |
350 | int *mem_16 ; |
351 | struct __UTAC__CFLOW_FUNC **mem_17 ; |
352 | struct __UTAC__CFLOW_FUNC **mem_18 ; |
353 | struct __UTAC__CFLOW_FUNC **mem_19 ; |
354 | |
355 | { |
356 | { |
357 | excep = (struct __UTAC__EXCEPTION *)exception; |
358 | tmp = malloc(24UL); |
359 | cf = (struct __UTAC__CFLOW_FUNC *)tmp; |
360 | mem_15 = (int (**)(int , int ))cf; |
361 | *mem_15 = cflow_func; |
362 | __cil_tmp7 = (unsigned long )cf; |
363 | __cil_tmp8 = __cil_tmp7 + 8; |
364 | mem_16 = (int *)__cil_tmp8; |
365 | *mem_16 = val; |
366 | __cil_tmp9 = (unsigned long )cf; |
367 | __cil_tmp10 = __cil_tmp9 + 16; |
368 | __cil_tmp11 = (unsigned long )excep; |
369 | __cil_tmp12 = __cil_tmp11 + 24; |
370 | mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp10; |
371 | mem_18 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp12; |
372 | *mem_17 = *mem_18; |
373 | __cil_tmp13 = (unsigned long )excep; |
374 | __cil_tmp14 = __cil_tmp13 + 24; |
375 | mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14; |
376 | *mem_19 = cf; |
377 | } |
378 | return; |
379 | } |
380 | } |
381 | void __utac__exception__cf_handler_free(void *exception ) |
382 | { struct __UTAC__EXCEPTION *excep ; |
383 | struct __UTAC__CFLOW_FUNC *cf ; |
384 | struct __UTAC__CFLOW_FUNC *tmp ; |
385 | unsigned long __cil_tmp5 ; |
386 | unsigned long __cil_tmp6 ; |
387 | struct __UTAC__CFLOW_FUNC *__cil_tmp7 ; |
388 | unsigned long __cil_tmp8 ; |
389 | unsigned long __cil_tmp9 ; |
390 | unsigned long __cil_tmp10 ; |
391 | unsigned long __cil_tmp11 ; |
392 | void *__cil_tmp12 ; |
393 | unsigned long __cil_tmp13 ; |
394 | unsigned long __cil_tmp14 ; |
395 | struct __UTAC__CFLOW_FUNC **mem_15 ; |
396 | struct __UTAC__CFLOW_FUNC **mem_16 ; |
397 | struct __UTAC__CFLOW_FUNC **mem_17 ; |
398 | |
399 | { |
400 | excep = (struct __UTAC__EXCEPTION *)exception; |
401 | __cil_tmp5 = (unsigned long )excep; |
402 | __cil_tmp6 = __cil_tmp5 + 24; |
403 | mem_15 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6; |
404 | cf = *mem_15; |
405 | { |
406 | while (1) { |
407 | while_1_continue: /* CIL Label */ ; |
408 | { |
409 | __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0; |
410 | __cil_tmp8 = (unsigned long )__cil_tmp7; |
411 | __cil_tmp9 = (unsigned long )cf; |
412 | if (__cil_tmp9 != __cil_tmp8) { |
413 | |
414 | } else { |
415 | goto while_1_break; |
416 | } |
417 | } |
418 | { |
419 | tmp = cf; |
420 | __cil_tmp10 = (unsigned long )cf; |
421 | __cil_tmp11 = __cil_tmp10 + 16; |
422 | mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp11; |
423 | cf = *mem_16; |
424 | __cil_tmp12 = (void *)tmp; |
425 | free(__cil_tmp12); |
426 | } |
427 | } |
428 | while_1_break: /* CIL Label */ ; |
429 | } |
430 | __cil_tmp13 = (unsigned long )excep; |
431 | __cil_tmp14 = __cil_tmp13 + 24; |
432 | mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14; |
433 | *mem_17 = (struct __UTAC__CFLOW_FUNC *)0; |
434 | return; |
435 | } |
436 | } |
437 | void __utac__exception__cf_handler_reset(void *exception ) |
438 | { struct __UTAC__EXCEPTION *excep ; |
439 | struct __UTAC__CFLOW_FUNC *cf ; |
440 | unsigned long __cil_tmp5 ; |
441 | unsigned long __cil_tmp6 ; |
442 | struct __UTAC__CFLOW_FUNC *__cil_tmp7 ; |
443 | unsigned long __cil_tmp8 ; |
444 | unsigned long __cil_tmp9 ; |
445 | int (*__cil_tmp10)(int , int ) ; |
446 | unsigned long __cil_tmp11 ; |
447 | unsigned long __cil_tmp12 ; |
448 | int __cil_tmp13 ; |
449 | unsigned long __cil_tmp14 ; |
450 | unsigned long __cil_tmp15 ; |
451 | struct __UTAC__CFLOW_FUNC **mem_16 ; |
452 | int (**mem_17)(int , int ) ; |
453 | int *mem_18 ; |
454 | struct __UTAC__CFLOW_FUNC **mem_19 ; |
455 | |
456 | { |
457 | excep = (struct __UTAC__EXCEPTION *)exception; |
458 | __cil_tmp5 = (unsigned long )excep; |
459 | __cil_tmp6 = __cil_tmp5 + 24; |
460 | mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6; |
461 | cf = *mem_16; |
462 | { |
463 | while (1) { |
464 | while_2_continue: /* CIL Label */ ; |
465 | { |
466 | __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0; |
467 | __cil_tmp8 = (unsigned long )__cil_tmp7; |
468 | __cil_tmp9 = (unsigned long )cf; |
469 | if (__cil_tmp9 != __cil_tmp8) { |
470 | |
471 | } else { |
472 | goto while_2_break; |
473 | } |
474 | } |
475 | { |
476 | mem_17 = (int (**)(int , int ))cf; |
477 | __cil_tmp10 = *mem_17; |
478 | __cil_tmp11 = (unsigned long )cf; |
479 | __cil_tmp12 = __cil_tmp11 + 8; |
480 | mem_18 = (int *)__cil_tmp12; |
481 | __cil_tmp13 = *mem_18; |
482 | (*__cil_tmp10)(4, __cil_tmp13); |
483 | __cil_tmp14 = (unsigned long )cf; |
484 | __cil_tmp15 = __cil_tmp14 + 16; |
485 | mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp15; |
486 | cf = *mem_19; |
487 | } |
488 | } |
489 | while_2_break: /* CIL Label */ ; |
490 | } |
491 | { |
492 | __utac__exception__cf_handler_free(exception); |
493 | } |
494 | return; |
495 | } |
496 | } |
497 | void *__utac__error_stack_mgt(void *env , int mode , int count ) ; |
498 | static struct __ACC__ERR *head = (struct __ACC__ERR *)0; |
499 | void *__utac__error_stack_mgt(void *env , int mode , int count ) |
500 | { void *retValue_acc ; |
501 | struct __ACC__ERR *new ; |
502 | void *tmp ; |
503 | struct __ACC__ERR *temp ; |
504 | struct __ACC__ERR *next ; |
505 | void *excep ; |
506 | unsigned long __cil_tmp10 ; |
507 | unsigned long __cil_tmp11 ; |
508 | unsigned long __cil_tmp12 ; |
509 | unsigned long __cil_tmp13 ; |
510 | void *__cil_tmp14 ; |
511 | unsigned long __cil_tmp15 ; |
512 | unsigned long __cil_tmp16 ; |
513 | void *__cil_tmp17 ; |
514 | void **mem_18 ; |
515 | struct __ACC__ERR **mem_19 ; |
516 | struct __ACC__ERR **mem_20 ; |
517 | void **mem_21 ; |
518 | struct __ACC__ERR **mem_22 ; |
519 | void **mem_23 ; |
520 | void **mem_24 ; |
521 | |
522 | { |
523 | if (count == 0) { |
524 | return (retValue_acc); |
525 | } else { |
526 | |
527 | } |
528 | if (mode == 0) { |
529 | { |
530 | tmp = malloc(16UL); |
531 | new = (struct __ACC__ERR *)tmp; |
532 | mem_18 = (void **)new; |
533 | *mem_18 = env; |
534 | __cil_tmp10 = (unsigned long )new; |
535 | __cil_tmp11 = __cil_tmp10 + 8; |
536 | mem_19 = (struct __ACC__ERR **)__cil_tmp11; |
537 | *mem_19 = head; |
538 | head = new; |
539 | retValue_acc = (void *)new; |
540 | } |
541 | return (retValue_acc); |
542 | } else { |
543 | |
544 | } |
545 | if (mode == 1) { |
546 | temp = head; |
547 | { |
548 | while (1) { |
549 | while_3_continue: /* CIL Label */ ; |
550 | if (count > 1) { |
551 | |
552 | } else { |
553 | goto while_3_break; |
554 | } |
555 | { |
556 | __cil_tmp12 = (unsigned long )temp; |
557 | __cil_tmp13 = __cil_tmp12 + 8; |
558 | mem_20 = (struct __ACC__ERR **)__cil_tmp13; |
559 | next = *mem_20; |
560 | mem_21 = (void **)temp; |
561 | excep = *mem_21; |
562 | __cil_tmp14 = (void *)temp; |
563 | free(__cil_tmp14); |
564 | __utac__exception__cf_handler_reset(excep); |
565 | temp = next; |
566 | count = count - 1; |
567 | } |
568 | } |
569 | while_3_break: /* CIL Label */ ; |
570 | } |
571 | { |
572 | __cil_tmp15 = (unsigned long )temp; |
573 | __cil_tmp16 = __cil_tmp15 + 8; |
574 | mem_22 = (struct __ACC__ERR **)__cil_tmp16; |
575 | head = *mem_22; |
576 | mem_23 = (void **)temp; |
577 | excep = *mem_23; |
578 | __cil_tmp17 = (void *)temp; |
579 | free(__cil_tmp17); |
580 | __utac__exception__cf_handler_reset(excep); |
581 | retValue_acc = excep; |
582 | } |
583 | return (retValue_acc); |
584 | } else { |
585 | |
586 | } |
587 | if (mode == 2) { |
588 | if (head != 0) { |
589 | mem_24 = (void **)head; |
590 | retValue_acc = *mem_24; |
591 | return (retValue_acc); |
592 | } else { |
593 | retValue_acc = (void *)0; |
594 | return (retValue_acc); |
595 | } |
596 | } else { |
597 | |
598 | } |
599 | return (retValue_acc); |
600 | } |
601 | } |
602 | void *__utac__get_this_arg(int i , struct JoinPoint *this ) |
603 | { void *retValue_acc ; |
604 | unsigned long __cil_tmp4 ; |
605 | unsigned long __cil_tmp5 ; |
606 | int __cil_tmp6 ; |
607 | int __cil_tmp7 ; |
608 | unsigned long __cil_tmp8 ; |
609 | unsigned long __cil_tmp9 ; |
610 | void **__cil_tmp10 ; |
611 | void **__cil_tmp11 ; |
612 | int *mem_12 ; |
613 | void ***mem_13 ; |
614 | |
615 | { |
616 | if (i > 0) { |
617 | { |
618 | __cil_tmp4 = (unsigned long )this; |
619 | __cil_tmp5 = __cil_tmp4 + 16; |
620 | mem_12 = (int *)__cil_tmp5; |
621 | __cil_tmp6 = *mem_12; |
622 | if (i <= __cil_tmp6) { |
623 | |
624 | } else { |
625 | { |
626 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
627 | 123U, "__utac__get_this_arg"); |
628 | } |
629 | } |
630 | } |
631 | } else { |
632 | { |
633 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
634 | 123U, "__utac__get_this_arg"); |
635 | } |
636 | } |
637 | __cil_tmp7 = i - 1; |
638 | __cil_tmp8 = (unsigned long )this; |
639 | __cil_tmp9 = __cil_tmp8 + 8; |
640 | mem_13 = (void ***)__cil_tmp9; |
641 | __cil_tmp10 = *mem_13; |
642 | __cil_tmp11 = __cil_tmp10 + __cil_tmp7; |
643 | retValue_acc = *__cil_tmp11; |
644 | return (retValue_acc); |
645 | return (retValue_acc); |
646 | } |
647 | } |
648 | char const *__utac__get_this_argtype(int i , struct JoinPoint *this ) |
649 | { char const *retValue_acc ; |
650 | unsigned long __cil_tmp4 ; |
651 | unsigned long __cil_tmp5 ; |
652 | int __cil_tmp6 ; |
653 | int __cil_tmp7 ; |
654 | unsigned long __cil_tmp8 ; |
655 | unsigned long __cil_tmp9 ; |
656 | char const **__cil_tmp10 ; |
657 | char const **__cil_tmp11 ; |
658 | int *mem_12 ; |
659 | char const ***mem_13 ; |
660 | |
661 | { |
662 | if (i > 0) { |
663 | { |
664 | __cil_tmp4 = (unsigned long )this; |
665 | __cil_tmp5 = __cil_tmp4 + 16; |
666 | mem_12 = (int *)__cil_tmp5; |
667 | __cil_tmp6 = *mem_12; |
668 | if (i <= __cil_tmp6) { |
669 | |
670 | } else { |
671 | { |
672 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
673 | 131U, "__utac__get_this_argtype"); |
674 | } |
675 | } |
676 | } |
677 | } else { |
678 | { |
679 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
680 | 131U, "__utac__get_this_argtype"); |
681 | } |
682 | } |
683 | __cil_tmp7 = i - 1; |
684 | __cil_tmp8 = (unsigned long )this; |
685 | __cil_tmp9 = __cil_tmp8 + 24; |
686 | mem_13 = (char const ***)__cil_tmp9; |
687 | __cil_tmp10 = *mem_13; |
688 | __cil_tmp11 = __cil_tmp10 + __cil_tmp7; |
689 | retValue_acc = *__cil_tmp11; |
690 | return (retValue_acc); |
691 | return (retValue_acc); |
692 | } |
693 | } |
694 | #pragma merger(0,"scenario.i","") |
695 | void startSystem(void) ; |
696 | void test(void) |
697 | { int splverifierCounter ; |
698 | int tmp ; |
699 | int tmp___0 ; |
700 | int tmp___1 ; |
701 | int tmp___2 ; |
702 | |
703 | { |
704 | splverifierCounter = 0; |
705 | { |
706 | while (1) { |
707 | while_4_continue: /* CIL Label */ ; |
708 | if (splverifierCounter < 4) { |
709 | |
710 | } else { |
711 | goto while_4_break; |
712 | } |
713 | { |
714 | tmp = (input_at_714_counter < num_of_inputs_at_714) ? INPUTS_at_714[input_at_714_counter++] : __VERIFIER_nondet_int() ; |
715 | } |
716 | if (tmp != 0) { |
717 | { |
718 | waterRise(); |
719 | } |
720 | } else { |
721 | |
722 | } |
723 | { |
724 | tmp___0 = (input_at_724_counter < num_of_inputs_at_724) ? INPUTS_at_724[input_at_724_counter++] : __VERIFIER_nondet_int() ; |
725 | } |
726 | if (tmp___0 != 0) { |
727 | { |
728 | changeMethaneLevel(); |
729 | } |
730 | } else { |
731 | |
732 | } |
733 | { |
734 | tmp___2 = (input_at_734_counter < num_of_inputs_at_734) ? INPUTS_at_734[input_at_734_counter++] : __VERIFIER_nondet_int() ; |
735 | } |
736 | if (tmp___2 != 0) { |
737 | { |
738 | startSystem(); |
739 | } |
740 | } else { |
741 | { |
742 | tmp___1 = (input_at_742_counter < num_of_inputs_at_742) ? INPUTS_at_742[input_at_742_counter++] : __VERIFIER_nondet_int() ; |
743 | } |
744 | if (tmp___1 != 0) { |
745 | |
746 | } else { |
747 | |
748 | } |
749 | } |
750 | { |
751 | timeShift(); |
752 | } |
753 | } |
754 | while_4_break: /* CIL Label */ ; |
755 | } |
756 | { |
757 | cleanup(); |
758 | } |
759 | return; |
760 | } |
761 | } |
762 | #pragma merger(0,"MinePump.i","") |
763 | void activatePump(void) ; |
764 | void deactivatePump(void) ; |
765 | int pumpRunning = 0; |
766 | int systemActive = 1; |
767 | void processEnvironment(void) ; |
768 | void timeShift(void) |
769 | { |
770 | |
771 | { |
772 | if (pumpRunning != 0) { |
773 | { |
774 | lowerWaterLevel(); |
775 | } |
776 | } else { |
777 | |
778 | } |
779 | if (systemActive != 0) { |
780 | { |
781 | processEnvironment(); |
782 | } |
783 | } else { |
784 | |
785 | } |
786 | { |
787 | __utac_acc__Specification2_spec__2(); |
788 | } |
789 | return; |
790 | } |
791 | } |
792 | void processEnvironment__wrappee__base(void) |
793 | { |
794 | |
795 | { |
796 | return; |
797 | } |
798 | } |
799 | int isHighWaterLevel(void) ; |
800 | void processEnvironment(void) |
801 | { int tmp ; |
802 | |
803 | { |
804 | if (! pumpRunning) { |
805 | { |
806 | tmp = isHighWaterLevel(); |
807 | } |
808 | if (tmp != 0) { |
809 | { |
810 | activatePump(); |
811 | } |
812 | } else { |
813 | { |
814 | processEnvironment__wrappee__base(); |
815 | } |
816 | } |
817 | } else { |
818 | { |
819 | processEnvironment__wrappee__base(); |
820 | } |
821 | } |
822 | return; |
823 | } |
824 | } |
825 | void activatePump(void) |
826 | { |
827 | |
828 | { |
829 | pumpRunning = 1; |
830 | return; |
831 | } |
832 | } |
833 | void deactivatePump(void) |
834 | { |
835 | |
836 | { |
837 | pumpRunning = 0; |
838 | return; |
839 | } |
840 | } |
841 | int isMethaneAlarm(void) |
842 | { int retValue_acc ; |
843 | |
844 | { |
845 | { |
846 | retValue_acc = isMethaneLevelCritical(); |
847 | } |
848 | return (retValue_acc); |
849 | return (retValue_acc); |
850 | } |
851 | } |
852 | int isPumpRunning(void) |
853 | { int retValue_acc ; |
854 | |
855 | { |
856 | retValue_acc = pumpRunning; |
857 | return (retValue_acc); |
858 | return (retValue_acc); |
859 | } |
860 | } |
861 | void printPump(void) |
862 | { |
863 | |
864 | { |
865 | { |
866 | // printf("Pump(System:"); |
867 | } |
868 | if (systemActive != 0) { |
869 | { |
870 | // printf("On"); |
871 | } |
872 | } else { |
873 | { |
874 | // printf("Off"); |
875 | } |
876 | } |
877 | { |
878 | // printf(",Pump:"); |
879 | } |
880 | if (pumpRunning != 0) { |
881 | { |
882 | // printf("On"); |
883 | } |
884 | } else { |
885 | { |
886 | // printf("Off"); |
887 | } |
888 | } |
889 | { |
890 | // printf(") "); |
891 | printEnvironment(); |
892 | // printf("\n"); |
893 | } |
894 | return; |
895 | } |
896 | } |
897 | int isHighWaterLevel(void) |
898 | { int retValue_acc ; |
899 | int tmp ; |
900 | int tmp___0 ; |
901 | |
902 | { |
903 | { |
904 | tmp = isHighWaterSensorDry(); |
905 | } |
906 | if (tmp != 0) { |
907 | tmp___0 = 0; |
908 | } else { |
909 | tmp___0 = 1; |
910 | } |
911 | retValue_acc = tmp___0; |
912 | return (retValue_acc); |
913 | return (retValue_acc); |
914 | } |
915 | } |
916 | void startSystem(void) |
917 | { |
918 | |
919 | { |
920 | systemActive = 1; |
921 | return; |
922 | } |
923 | } |
2017-05-11 14:41:49:897 INFO ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:41:49:986 INFO CPAchecker.run CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started
2017-05-11 14:41:51:258 INFO CFACreationUtils.addEdgeToCFA line 142: Dead code detected: return (retValue_acc);
2017-05-11 14:41:51:264 INFO CFACreationUtils.addEdgeToCFA line 195: Dead code detected: return (retValue_acc);
2017-05-11 14:41:51:267 INFO CFACreationUtils.addEdgeToCFA line 227: Dead code detected: return (retValue_acc);
2017-05-11 14:41:51:270 INFO CFACreationUtils.addEdgeToCFA line 241: Dead code detected: return (retValue_acc);
2017-05-11 14:41:51:301 INFO CFACreationUtils.addEdgeToCFA line 302: Dead code detected: return (retValue_acc);
2017-05-11 14:41:51:304 INFO CFACreationUtils.addEdgeToCFA line 325: Dead code detected: return (retValue_acc);
2017-05-11 14:41:51:354 INFO CFACreationUtils.addEdgeToCFA line 645: Dead code detected: return (retValue_acc);
2017-05-11 14:41:51:359 INFO CFACreationUtils.addEdgeToCFA line 691: Dead code detected: return (retValue_acc);
2017-05-11 14:41:51:378 INFO CFACreationUtils.addEdgeToCFA line 849: Dead code detected: return (retValue_acc);
2017-05-11 14:41:51:380 INFO CFACreationUtils.addEdgeToCFA line 858: Dead code detected: return (retValue_acc);
2017-05-11 14:41:51:386 INFO CFACreationUtils.addEdgeToCFA line 913: Dead code detected: return (retValue_acc);
2017-05-11 14:41:51:497 WARNING CFunctionPointerResolver.replaceFunctionPointerCall line 482: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.
2017-05-11 14:41:52:468 INFO CPAchecker.runAlgorithm Starting analysis ...
2017-05-11 14:41:52:492 INFO Parallel analysis 1:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:41:52:519 INFO Parallel analysis 2:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 14:41:52:706 WARNING Parallel analysis 1:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:41:53:232 INFO Parallel analysis 1:PredicateCPA:PredicateCPA.<init> Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).
2017-05-11 14:41:53:320 WARNING Parallel analysis 1:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:41:53:424 WARNING Parallel analysis 1:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:41:53:678 WARNING Parallel analysis 1:InductionStepCase:PredicateCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:41:53:681 INFO Parallel analysis 1:InductionStepCase:PredicateCPA:PredicateCPA.<init> Using predicate analysis with MathSAT5 version 5.3.14 (0b98b661254c) (Nov 17 2016 10:59:45, gmp 5.1.3, gcc 4.8.5, 64-bit).
2017-05-11 14:41:53:691 WARNING Parallel analysis 1:InductionStepCase:AssumptionStorageCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:41:53:702 WARNING Parallel analysis 1:InductionStepCase:ValueAnalysisCPA:JavaSMT:Mathsat5SolverContext.<init> MathSAT5 is available for research and evaluation purposes only. It can not be used in a commercial environment, particularly as part of a commercial product, without written permission. MathSAT5 is provided as is, without any warranty. Please write to mathsat@fbk.eu for additional questions regarding licensing MathSAT5 or obtaining more up-to-date versions.
2017-05-11 14:41:53:927 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:41:55:334 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 1
2017-05-11 14:41:55:337 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:41:55:346 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:41:55:693 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:41:55:746 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:41:56:121 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:41:57:081 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 2
2017-05-11 14:41:57:082 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:41:57:082 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:41:58:876 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 3
2017-05-11 14:41:58:877 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:41:58:877 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:41:59:955 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 5
2017-05-11 14:41:59:964 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:41:59:964 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:42:00:820 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 9
2017-05-11 14:42:00:821 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:42:00:821 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:42:01:772 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 11
2017-05-11 14:42:01:772 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:42:01:773 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:42:03:431 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions Adjusting maximum formula depth to 2
2017-05-11 14:42:03:432 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:42:03:432 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:42:04:453 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 15
2017-05-11 14:42:04:464 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:42:04:465 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:42:06:637 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 17
2017-05-11 14:42:06:637 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:42:06:637 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:42:07:556 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 21
2017-05-11 14:42:07:557 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:42:07:557 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:42:07:958 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:42:08:822 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 23
2017-05-11 14:42:08:822 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:42:08:823 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:42:10:424 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 24
2017-05-11 14:42:10:425 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:42:10:425 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:42:11:554 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 26
2017-05-11 14:42:11:555 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:42:11:555 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:42:12:506 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 30
2017-05-11 14:42:12:507 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:42:12:507 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:42:17:178 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 2
2017-05-11 14:42:17:179 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:42:17:185 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:42:17:186 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 14:42:17:199 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 14:42:22:217 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 14:42:26:619 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 3
2017-05-11 14:42:26:620 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 14:42:26:801 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 14:42:27:354 INFO Parallel analysis 1:BMCAlgorithm.analyzeCounterexample Error found, creating error path
2017-05-11 14:42:28:151 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:42:28:500 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:42:28:500 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 14:42:28:929 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 14:42:28:938 WARNING Parallel analysis 1:ExceptionHandlingAlgorithm.handleExceptionWithErrorPath Infeasible counterexample found, but could not remove it from the ARG. Therefore, we cannot prove safety.
2017-05-11 14:42:28:940 INFO Parallel analysis 1:ExceptionHandlingAlgorithm.handleExceptionWithErrorPath Another infeasible counterexample found which could not be removed from the ARG.
2017-05-11 14:42:28:945 INFO ParallelAlgorithm.handleFutureResults /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished without usable result.
2017-05-11 14:42:34:840 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 32
2017-05-11 14:42:34:840 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:42:34:840 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:42:54:829 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 36
2017-05-11 14:42:54:830 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:42:54:830 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:43:17:419 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 38
2017-05-11 14:43:17:420 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:43:17:420 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:45:47:149 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 39
2017-05-11 14:45:47:150 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:45:47:150 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:48:14:549 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 41
2017-05-11 14:48:14:549 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:48:14:550 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:50:39:123 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 45
2017-05-11 14:50:39:124 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:50:39:124 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:53:02:160 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 53
2017-05-11 14:53:02:161 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@54736c0f
2017-05-11 14:53:02:161 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 14:53:14:471 WARNING AbstractFuture.get Warning: Analysis interrupted
2017-05-11 14:53:14:471 WARNING ForceTerminationOnShutdown$1.shutdownRequested Shutdown requested (The CPU-time limit of 900s has elapsed.), waiting for termination.
2017-05-11 14:53:14:471 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Analysis was terminated
Parallel Algorithm statistics
-----------------------------
Number of algorithms used: 2
Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
===================================================================================================================================
PredicateCPA statistics
-----------------------
Number of abstractions: 2 (0% of all post computations)
Times abstraction was reused: 0
Because of function entry/exit: 0 (0%)
Because of loop head: 0 (0%)
Because of join nodes: 0 (0%)
Because of threshold: 0 (0%)
Because of target state: 2 (100%)
Times precision was empty: 2 (100%)
Times precision was {false}: 0 (0%)
Times result was cached: 0 (0%)
Times cartesian abs was used: 0 (0%)
Times boolean abs was used: 0 (0%)
Times result was 'false': 0 (0%)
Number of strengthen sat checks: 0
Number of coverage checks: 110
BDD entailment checks: 0
Number of SMT sat checks: 0
trivial: 0
cached: 0
Max ABE block size: 277
Number of predicates discovered: 0
Time for post operator: 1.258s
Time for path formula creation: 1.255s
Time for strengthen operator: 0.001s
Time for prec operator: 0.021s
Time for abstraction: 0.000s (Max: 0.000s, Count: 2)
Solving time: 0.000s (Max: 0.000s)
Model enumeration time: 0.000s
Time for BDD construction: 0.000s (Max: 0.000s)
Time for merge operator: 0.017s
Time for coverage check: 0.000s
Total time for SMT solver (w/o itp): 0.000s
Total number of created targets for pointer analysis: 128
Number of created targets for uf: *signed_int is 33
PrecisionBootstrap statistics
-----------------------------
Init. function predicates: 0
Init. global predicates: 0
Init. location predicates: 0
Invariant Generation statistics
-------------------------------
Bounds CPA statistics
---------------------
Bound k: 3
Maximum loop iteration reached: 4
ValueAnalysisCPA statistics
---------------------------
Number of variables: 10021 (count: 650, min: 0, max: 21, avg: 15.42)
Number of global variables: 7361 (count: 650, min: 0, max: 15, avg: 11.32)
ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations: 710
Total time for liveness abstraction: 0.000s
Total time for abstraction computation: 0.031s
Total time for path thresholds: 0.000s
Number of tracked memory locations: 47
ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions: 206
Number of deterministic Assumptions: 72
Level of Determinism: 35%
ConstraintsStrengthenOperator statistics
----------------------------------------
Total time for strengthening by ConstraintsCPA: 0.000s
Replaced symbolic expressions: 0
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.002s
Automaton transfers with branching: 0
Automaton transfer successors: 710 (count: 712, min: 0, max: 1, avg: 1.00) [0 x 2, 1 x 710]
CPA algorithm statistics
------------------------
Number of iterations: 658
Max size of waitlist: 9
Average size of waitlist: 2
Number of computed successors: 710
Max successors for one state: 2
Number of times merged: 55
Number of times stopped: 55
Number of times breaked: 0
Total time for CPA algorithm: 1.940s (Max: 1.757s)
Time for choose from waitlist: 0.000s
Time for precision adjustment: 0.092s
Time for transfer relation: 1.811s
Time for merge operator: 0.018s
Time for stop operator: 0.006s
Time for adding to reached set: 0.006s
BMC algorithm statistics
------------------------
Time for BMC formula creation: 1.945s
Time for final sat check: 0.581s
Time for error path creation: 0.727s
Time for bounding assertions check: 0.232s
Time for induction formula creation: 16.848s
Time for induction check: 13.597s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 2 (200%)
Time for counterexample checks: 0.787s
Time for running CBMC: 0.704s
Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/invariantGeneration-no-out.properties
===============================================================================================================================
AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states: 1
Total time for successor computation: 0.974s
Time for transition matches: 0.355s
Time for transition assertions: 0.000s
Time for transition actions: 0.001s
Automaton transfers with branching: 0
Automaton transfer successors: 273640 (count: 274034, min: 0, max: 1, avg: 1.00) [0 x 394, 1 x 273640]
CPA algorithm statistics
------------------------
Number of iterations: 258916
Max size of waitlist: 309
Average size of waitlist: 140
Number of computed successors: 273640
Max successors for one state: 2
Number of times merged: 56152
Number of times stopped: 62722
Number of times breaked: 0
Total time for CPA algorithm: 679.521s (Max: 149.704s)
Time for choose from waitlist: 0.210s
Time for precision adjustment: 2.475s
Time for transfer relation: 27.408s
Time for merge operator: 603.494s
Time for stop operator: 43.955s
Time for adding to reached set: 0.644s
Other statistics
================
Code Coverage
-----------------------------
Function coverage: 0.027
Visited lines: 0
Total lines: 417
Line coverage: 0.000
Visited conditions: 0
Total conditions: 112
Condition coverage: 0.000
CPAchecker general statistics
-----------------------------
Number of program locations: 686
Number of CFA edges: 792
Number of relevant variables: 141
Number of functions: 37
Number of loops: 9
Size of reached set: 1
Number of reached locations: 1 (0%)
Avg states per location: 1
Max states per location: 1 (at node N78)
Number of reached functions: 1 (3%)
Number of partitions: 1
Avg size of partitions: 1
Max size of partitions: 1
Number of target states: 0
Size of final wait list 1
Time for analysis setup: 2.453s
Time for loading CPAs: 0.608s
Time for loading parser: 0.492s
Time for CFA construction: 1.279s
Time for parsing file(s): 0.340s
Time for AST to CFA: 0.426s
Time for CFA sanity check: 0.096s
Time for post-processing: 0.359s
Time for var class.: 0.223s
Time for CFA export: 0.550s
Time for Analysis: 682.000s
CPU time for analysis: 893.540s
Total time for CPAchecker: 684.466s
Total CPU time for CPAchecker: 899.910s
Time for statistics: 1.126s
Time for Garbage Collector: 45.977s (in 492 runs)
Garbage Collector(s) used: PS MarkSweep, PS Scavenge
Used heap memory: 709MB ( 677 MiB) max; 388MB ( 370 MiB) avg; 740MB ( 706 MiB) peak
Used non-heap memory: 55MB ( 52 MiB) max; 52MB ( 50 MiB) avg; 58MB ( 55 MiB) peak
Used in PS Old Gen pool: 312MB ( 298 MiB) max; 186MB ( 177 MiB) avg; 312MB ( 298 MiB) peak
Allocated heap memory: 1205MB ( 1150 MiB) max; 948MB ( 904 MiB) avg
Allocated non-heap memory: 56MB ( 54 MiB) max; 56MB ( 53 MiB) avg
Total process virtual memory: 8369MB ( 7981 MiB) max; 8350MB ( 7963 MiB) avg
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec2_product34_false-unreach-call_false-termination.cil/minepump_spec2_product34_false-unreach-call_false-termination.cil.over.instr.c
analysis.summaryEdges = true
analysis.useParallelAnalyses = true
cfa.allowBranchSwapping = false
cfa.simplifyCfa = false
limits.time.cpu = 900
log.level = INFO
output.path = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec2_product34_false-unreach-call_false-termination.cil/cpa_output
overflow.config = sv-comp16--k-induction-overflow.properties
parallelAlgorithm.configFiles = components/kInduction/svcomp16-kInduction.properties, components/invariantGeneration-no-out.properties::supply-reached-refinable
specification = /work/anon/anon/cfc/analyzers/cpachecker/config/specification/sv-comp-reachability.spc