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_227 = 7; int INPUTS_at_227[7]; int input_at_227_counter = 0;int num_of_inputs_at_247 = 7; int INPUTS_at_247[7]; int input_at_247_counter = 0;int num_of_inputs_at_237 = 7; int INPUTS_at_237[7]; int input_at_237_counter = 0;int num_of_inputs_at_255 = 3; int INPUTS_at_255[3]; int input_at_255_counter = 0;int initialize_reads() { for (int instrumentation_index=0; instrumentation_index<7; instrumentation_index++) INPUTS_at_227[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<7; instrumentation_index++) INPUTS_at_247[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<7; instrumentation_index++) INPUTS_at_237[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_255[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,"Specification4_spec.i","") |
40 | void __automaton_fail(void) ; |
41 | int isPumpRunning(void) ; |
42 | int getWaterLevel(void) ; |
43 | inline static void __utac_acc__Specification4_spec__1(void) |
44 | { int tmp ; |
45 | int tmp___0 ; |
46 | |
47 | { |
48 | { |
49 | tmp = getWaterLevel(); |
50 | } |
51 | if (tmp == 0) { |
52 | { |
53 | tmp___0 = isPumpRunning(); |
54 | } |
55 | if (tmp___0 != 0) { |
56 | { |
57 | __automaton_fail(); |
58 | } |
59 | } else { |
60 | |
61 | } |
62 | } else { |
63 | |
64 | } |
65 | return; |
66 | } |
67 | } |
68 | #pragma merger(0,"Test.i","") |
69 | int cleanupTimeShifts = 4; |
70 | void timeShift(void) ; |
71 | void cleanup(void) |
72 | { int i ; |
73 | int __cil_tmp2 ; |
74 | |
75 | { |
76 | { |
77 | timeShift(); |
78 | i = 0; |
79 | } |
80 | { |
81 | while (1) { |
82 | while_0_continue: /* CIL Label */ ; |
83 | { |
84 | __cil_tmp2 = cleanupTimeShifts - 1; |
85 | if (i < __cil_tmp2) { |
86 | |
87 | } else { |
88 | goto while_0_break; |
89 | } |
90 | } |
91 | { |
92 | timeShift(); |
93 | i = i + 1; |
94 | } |
95 | } |
96 | while_0_break: /* CIL Label */ ; |
97 | } |
98 | return; |
99 | } |
100 | } |
101 | void printPump(void) ; |
102 | void waterRise(void) ; |
103 | void changeMethaneLevel(void) ; |
104 | void Specification2(void) |
105 | { |
106 | |
107 | { |
108 | { |
109 | timeShift(); |
110 | printPump(); |
111 | timeShift(); |
112 | printPump(); |
113 | timeShift(); |
114 | printPump(); |
115 | waterRise(); |
116 | printPump(); |
117 | timeShift(); |
118 | printPump(); |
119 | changeMethaneLevel(); |
120 | printPump(); |
121 | timeShift(); |
122 | printPump(); |
123 | cleanup(); |
124 | } |
125 | return; |
126 | } |
127 | } |
128 | void setup(void) |
129 | { |
130 | |
131 | { |
132 | return; |
133 | } |
134 | } |
135 | void test(void) ; |
136 | void runTest(void) |
137 | { |
138 | |
139 | { |
140 | { |
141 | test(); |
142 | } |
143 | return; |
144 | } |
145 | } |
146 | void select_helpers(void) ; |
147 | void select_features(void) ; |
148 | int valid_product(void) ; |
149 | int main(void) |
150 | {initialize_reads(); int retValue_acc ; |
151 | int tmp ; |
152 | |
153 | { |
154 | { |
155 | select_helpers(); |
156 | select_features(); |
157 | tmp = valid_product(); |
158 | } |
159 | if (tmp != 0) { |
160 | { |
161 | setup(); |
162 | runTest(); |
163 | } |
164 | } else { |
165 | |
166 | } |
167 | retValue_acc = 0; |
168 | return (retValue_acc); |
169 | return (retValue_acc); |
170 | } |
171 | } |
172 | #pragma merger(0,"featureselect.i","") |
173 | int select_one(void) ; |
174 | int select_one(void) |
175 | { int retValue_acc ; |
176 | int choice = __VERIFIER_nondet_int(); |
177 | |
178 | { |
179 | retValue_acc = choice; |
180 | return (retValue_acc); |
181 | return (retValue_acc); |
182 | } |
183 | } |
184 | void select_features(void) |
185 | { |
186 | |
187 | { |
188 | return; |
189 | } |
190 | } |
191 | void select_helpers(void) |
192 | { |
193 | |
194 | { |
195 | return; |
196 | } |
197 | } |
198 | int valid_product(void) |
199 | { int retValue_acc ; |
200 | |
201 | { |
202 | retValue_acc = 1; |
203 | return (retValue_acc); |
204 | return (retValue_acc); |
205 | } |
206 | } |
207 | #pragma merger(0,"scenario.i","") |
208 | void startSystem(void) ; |
209 | void test(void) |
210 | { int splverifierCounter ; |
211 | int tmp ; |
212 | int tmp___0 ; |
213 | int tmp___1 ; |
214 | int tmp___2 ; |
215 | |
216 | { |
217 | splverifierCounter = 0; |
218 | { |
219 | while (1) { |
220 | while_1_continue: /* CIL Label */ ; |
221 | if (splverifierCounter < 4) { |
222 | |
223 | } else { |
224 | goto while_1_break; |
225 | } |
226 | { |
227 | tmp = (input_at_227_counter < num_of_inputs_at_227) ? INPUTS_at_227[input_at_227_counter++] : __VERIFIER_nondet_int() ; |
228 | } |
229 | if (tmp != 0) { |
230 | { |
231 | waterRise(); |
232 | } |
233 | } else { |
234 | |
235 | } |
236 | { |
237 | tmp___0 = (input_at_237_counter < num_of_inputs_at_237) ? INPUTS_at_237[input_at_237_counter++] : __VERIFIER_nondet_int() ; |
238 | } |
239 | if (tmp___0 != 0) { |
240 | { |
241 | changeMethaneLevel(); |
242 | } |
243 | } else { |
244 | |
245 | } |
246 | { |
247 | tmp___2 = (input_at_247_counter < num_of_inputs_at_247) ? INPUTS_at_247[input_at_247_counter++] : __VERIFIER_nondet_int() ; |
248 | } |
249 | if (tmp___2 != 0) { |
250 | { |
251 | startSystem(); |
252 | } |
253 | } else { |
254 | { |
255 | tmp___1 = (input_at_255_counter < num_of_inputs_at_255) ? INPUTS_at_255[input_at_255_counter++] : __VERIFIER_nondet_int() ; |
256 | } |
257 | if (tmp___1 != 0) { |
258 | |
259 | } else { |
260 | |
261 | } |
262 | } |
263 | { |
264 | timeShift(); |
265 | } |
266 | } |
267 | while_1_break: /* CIL Label */ ; |
268 | } |
269 | { |
270 | cleanup(); |
271 | } |
272 | return; |
273 | } |
274 | } |
275 | #pragma merger(0,"MinePump.i","") |
276 | void lowerWaterLevel(void) ; |
277 | int isMethaneLevelCritical(void) ; |
278 | void printEnvironment(void) ; |
279 | int isHighWaterSensorDry(void) ; |
280 | void activatePump(void) ; |
281 | void deactivatePump(void) ; |
282 | int pumpRunning = 0; |
283 | int systemActive = 1; |
284 | void processEnvironment(void) ; |
285 | void timeShift(void) |
286 | { |
287 | |
288 | { |
289 | if (pumpRunning != 0) { |
290 | { |
291 | lowerWaterLevel(); |
292 | } |
293 | } else { |
294 | |
295 | } |
296 | if (systemActive != 0) { |
297 | { |
298 | processEnvironment(); |
299 | } |
300 | } else { |
301 | |
302 | } |
303 | { |
304 | __utac_acc__Specification4_spec__1(); |
305 | } |
306 | return; |
307 | } |
308 | } |
309 | void processEnvironment__wrappee__base(void) |
310 | { |
311 | |
312 | { |
313 | return; |
314 | } |
315 | } |
316 | int isHighWaterLevel(void) ; |
317 | void processEnvironment(void) |
318 | { int tmp ; |
319 | |
320 | { |
321 | if (! pumpRunning) { |
322 | { |
323 | tmp = isHighWaterLevel(); |
324 | } |
325 | if (tmp != 0) { |
326 | { |
327 | activatePump(); |
328 | } |
329 | } else { |
330 | { |
331 | processEnvironment__wrappee__base(); |
332 | } |
333 | } |
334 | } else { |
335 | { |
336 | processEnvironment__wrappee__base(); |
337 | } |
338 | } |
339 | return; |
340 | } |
341 | } |
342 | void activatePump(void) |
343 | { |
344 | |
345 | { |
346 | pumpRunning = 1; |
347 | return; |
348 | } |
349 | } |
350 | void deactivatePump(void) |
351 | { |
352 | |
353 | { |
354 | pumpRunning = 0; |
355 | return; |
356 | } |
357 | } |
358 | int isMethaneAlarm(void) |
359 | { int retValue_acc ; |
360 | |
361 | { |
362 | { |
363 | retValue_acc = isMethaneLevelCritical(); |
364 | } |
365 | return (retValue_acc); |
366 | return (retValue_acc); |
367 | } |
368 | } |
369 | int isPumpRunning(void) |
370 | { int retValue_acc ; |
371 | |
372 | { |
373 | retValue_acc = pumpRunning; |
374 | return (retValue_acc); |
375 | return (retValue_acc); |
376 | } |
377 | } |
378 | void printPump(void) |
379 | { |
380 | |
381 | { |
382 | { |
383 | // printf("Pump(System:"); |
384 | } |
385 | if (systemActive != 0) { |
386 | { |
387 | // printf("On"); |
388 | } |
389 | } else { |
390 | { |
391 | // printf("Off"); |
392 | } |
393 | } |
394 | { |
395 | // printf(",Pump:"); |
396 | } |
397 | if (pumpRunning != 0) { |
398 | { |
399 | // printf("On"); |
400 | } |
401 | } else { |
402 | { |
403 | // printf("Off"); |
404 | } |
405 | } |
406 | { |
407 | // printf(") "); |
408 | printEnvironment(); |
409 | // printf("\n"); |
410 | } |
411 | return; |
412 | } |
413 | } |
414 | int isHighWaterLevel(void) |
415 | { int retValue_acc ; |
416 | int tmp ; |
417 | int tmp___0 ; |
418 | |
419 | { |
420 | { |
421 | tmp = isHighWaterSensorDry(); |
422 | } |
423 | if (tmp != 0) { |
424 | tmp___0 = 0; |
425 | } else { |
426 | tmp___0 = 1; |
427 | } |
428 | retValue_acc = tmp___0; |
429 | return (retValue_acc); |
430 | return (retValue_acc); |
431 | } |
432 | } |
433 | void startSystem(void) |
434 | { |
435 | |
436 | { |
437 | systemActive = 1; |
438 | return; |
439 | } |
440 | } |
441 | #pragma merger(0,"Environment.i","") |
442 | int waterLevel = 1; |
443 | int methaneLevelCritical = 0; |
444 | void lowerWaterLevel(void) |
445 | { |
446 | |
447 | { |
448 | if (waterLevel > 0) { |
449 | waterLevel = waterLevel - 1; |
450 | } else { |
451 | |
452 | } |
453 | return; |
454 | } |
455 | } |
456 | void waterRise(void) |
457 | { |
458 | |
459 | { |
460 | if (waterLevel < 2) { |
461 | waterLevel = waterLevel + 1; |
462 | } else { |
463 | |
464 | } |
465 | return; |
466 | } |
467 | } |
468 | void changeMethaneLevel(void) |
469 | { |
470 | |
471 | { |
472 | if (methaneLevelCritical != 0) { |
473 | methaneLevelCritical = 0; |
474 | } else { |
475 | methaneLevelCritical = 1; |
476 | } |
477 | return; |
478 | } |
479 | } |
480 | int isMethaneLevelCritical(void) |
481 | { int retValue_acc ; |
482 | |
483 | { |
484 | retValue_acc = methaneLevelCritical; |
485 | return (retValue_acc); |
486 | return (retValue_acc); |
487 | } |
488 | } |
489 | void printEnvironment(void) |
490 | { |
491 | |
492 | { |
493 | { |
494 | // printf("Env(Water:%i", waterLevel); |
495 | // printf(",Meth:"); |
496 | } |
497 | if (methaneLevelCritical != 0) { |
498 | { |
499 | // printf("CRIT"); |
500 | } |
501 | } else { |
502 | { |
503 | // printf("OK"); |
504 | } |
505 | } |
506 | { |
507 | // printf(")"); |
508 | } |
509 | return; |
510 | } |
511 | } |
512 | int getWaterLevel(void) |
513 | { int retValue_acc ; |
514 | |
515 | { |
516 | retValue_acc = waterLevel; |
517 | return (retValue_acc); |
518 | return (retValue_acc); |
519 | } |
520 | } |
521 | int isHighWaterSensorDry(void) |
522 | { int retValue_acc ; |
523 | |
524 | { |
525 | if (waterLevel < 2) { |
526 | retValue_acc = 1; |
527 | return (retValue_acc); |
528 | } else { |
529 | retValue_acc = 0; |
530 | return (retValue_acc); |
531 | } |
532 | return (retValue_acc); |
533 | } |
534 | } |
535 | #pragma merger(0,"wsllib_check.i","") |
536 | void __automaton_fail(void) |
537 | { |
538 | |
539 | { |
540 | __VERIFIER_assume(!((0 != INPUTS_at_227[2] && 0 == INPUTS_at_227[4] && 0 == INPUTS_at_237[4] && 0 == INPUTS_at_255[1] && 0 == INPUTS_at_247[1] && 0 == INPUTS_at_227[1] && 0 != INPUTS_at_247[4] && 0 != INPUTS_at_255[2] && 0 != INPUTS_at_247[2] && 0 != INPUTS_at_237[1] && 0 == INPUTS_at_227[0])));__VERIFIER_assume(!((0 == INPUTS_at_237[1])));__VERIFIER_assume(!((0 == INPUTS_at_247[2])));__VERIFIER_assume(!((0 == INPUTS_at_227[3])));__VERIFIER_assume(!((0 != INPUTS_at_247[6])));__VERIFIER_error(); |
541 | return; |
542 | } |
543 | } |
544 | #pragma merger(0,"libacc.i","") |
545 | extern __attribute__((__nothrow__, __noreturn__)) void __assert_fail(char const *__assertion , |
546 | char const *__file , |
547 | unsigned int __line , |
548 | char const *__function ) ; |
549 | extern __attribute__((__nothrow__)) void *malloc(size_t __size ) __attribute__((__malloc__)) ; |
550 | extern __attribute__((__nothrow__)) void free(void *__ptr ) ; |
551 | void __utac__exception__cf_handler_set(void *exception , int (*cflow_func)(int , |
552 | int ) , |
553 | int val ) |
554 | { struct __UTAC__EXCEPTION *excep ; |
555 | struct __UTAC__CFLOW_FUNC *cf ; |
556 | void *tmp ; |
557 | unsigned long __cil_tmp7 ; |
558 | unsigned long __cil_tmp8 ; |
559 | unsigned long __cil_tmp9 ; |
560 | unsigned long __cil_tmp10 ; |
561 | unsigned long __cil_tmp11 ; |
562 | unsigned long __cil_tmp12 ; |
563 | unsigned long __cil_tmp13 ; |
564 | unsigned long __cil_tmp14 ; |
565 | int (**mem_15)(int , int ) ; |
566 | int *mem_16 ; |
567 | struct __UTAC__CFLOW_FUNC **mem_17 ; |
568 | struct __UTAC__CFLOW_FUNC **mem_18 ; |
569 | struct __UTAC__CFLOW_FUNC **mem_19 ; |
570 | |
571 | { |
572 | { |
573 | excep = (struct __UTAC__EXCEPTION *)exception; |
574 | tmp = malloc(24UL); |
575 | cf = (struct __UTAC__CFLOW_FUNC *)tmp; |
576 | mem_15 = (int (**)(int , int ))cf; |
577 | *mem_15 = cflow_func; |
578 | __cil_tmp7 = (unsigned long )cf; |
579 | __cil_tmp8 = __cil_tmp7 + 8; |
580 | mem_16 = (int *)__cil_tmp8; |
581 | *mem_16 = val; |
582 | __cil_tmp9 = (unsigned long )cf; |
583 | __cil_tmp10 = __cil_tmp9 + 16; |
584 | __cil_tmp11 = (unsigned long )excep; |
585 | __cil_tmp12 = __cil_tmp11 + 24; |
586 | mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp10; |
587 | mem_18 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp12; |
588 | *mem_17 = *mem_18; |
589 | __cil_tmp13 = (unsigned long )excep; |
590 | __cil_tmp14 = __cil_tmp13 + 24; |
591 | mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14; |
592 | *mem_19 = cf; |
593 | } |
594 | return; |
595 | } |
596 | } |
597 | void __utac__exception__cf_handler_free(void *exception ) |
598 | { struct __UTAC__EXCEPTION *excep ; |
599 | struct __UTAC__CFLOW_FUNC *cf ; |
600 | struct __UTAC__CFLOW_FUNC *tmp ; |
601 | unsigned long __cil_tmp5 ; |
602 | unsigned long __cil_tmp6 ; |
603 | struct __UTAC__CFLOW_FUNC *__cil_tmp7 ; |
604 | unsigned long __cil_tmp8 ; |
605 | unsigned long __cil_tmp9 ; |
606 | unsigned long __cil_tmp10 ; |
607 | unsigned long __cil_tmp11 ; |
608 | void *__cil_tmp12 ; |
609 | unsigned long __cil_tmp13 ; |
610 | unsigned long __cil_tmp14 ; |
611 | struct __UTAC__CFLOW_FUNC **mem_15 ; |
612 | struct __UTAC__CFLOW_FUNC **mem_16 ; |
613 | struct __UTAC__CFLOW_FUNC **mem_17 ; |
614 | |
615 | { |
616 | excep = (struct __UTAC__EXCEPTION *)exception; |
617 | __cil_tmp5 = (unsigned long )excep; |
618 | __cil_tmp6 = __cil_tmp5 + 24; |
619 | mem_15 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6; |
620 | cf = *mem_15; |
621 | { |
622 | while (1) { |
623 | while_2_continue: /* CIL Label */ ; |
624 | { |
625 | __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0; |
626 | __cil_tmp8 = (unsigned long )__cil_tmp7; |
627 | __cil_tmp9 = (unsigned long )cf; |
628 | if (__cil_tmp9 != __cil_tmp8) { |
629 | |
630 | } else { |
631 | goto while_2_break; |
632 | } |
633 | } |
634 | { |
635 | tmp = cf; |
636 | __cil_tmp10 = (unsigned long )cf; |
637 | __cil_tmp11 = __cil_tmp10 + 16; |
638 | mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp11; |
639 | cf = *mem_16; |
640 | __cil_tmp12 = (void *)tmp; |
641 | free(__cil_tmp12); |
642 | } |
643 | } |
644 | while_2_break: /* CIL Label */ ; |
645 | } |
646 | __cil_tmp13 = (unsigned long )excep; |
647 | __cil_tmp14 = __cil_tmp13 + 24; |
648 | mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14; |
649 | *mem_17 = (struct __UTAC__CFLOW_FUNC *)0; |
650 | return; |
651 | } |
652 | } |
653 | void __utac__exception__cf_handler_reset(void *exception ) |
654 | { struct __UTAC__EXCEPTION *excep ; |
655 | struct __UTAC__CFLOW_FUNC *cf ; |
656 | unsigned long __cil_tmp5 ; |
657 | unsigned long __cil_tmp6 ; |
658 | struct __UTAC__CFLOW_FUNC *__cil_tmp7 ; |
659 | unsigned long __cil_tmp8 ; |
660 | unsigned long __cil_tmp9 ; |
661 | int (*__cil_tmp10)(int , int ) ; |
662 | unsigned long __cil_tmp11 ; |
663 | unsigned long __cil_tmp12 ; |
664 | int __cil_tmp13 ; |
665 | unsigned long __cil_tmp14 ; |
666 | unsigned long __cil_tmp15 ; |
667 | struct __UTAC__CFLOW_FUNC **mem_16 ; |
668 | int (**mem_17)(int , int ) ; |
669 | int *mem_18 ; |
670 | struct __UTAC__CFLOW_FUNC **mem_19 ; |
671 | |
672 | { |
673 | excep = (struct __UTAC__EXCEPTION *)exception; |
674 | __cil_tmp5 = (unsigned long )excep; |
675 | __cil_tmp6 = __cil_tmp5 + 24; |
676 | mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6; |
677 | cf = *mem_16; |
678 | { |
679 | while (1) { |
680 | while_3_continue: /* CIL Label */ ; |
681 | { |
682 | __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0; |
683 | __cil_tmp8 = (unsigned long )__cil_tmp7; |
684 | __cil_tmp9 = (unsigned long )cf; |
685 | if (__cil_tmp9 != __cil_tmp8) { |
686 | |
687 | } else { |
688 | goto while_3_break; |
689 | } |
690 | } |
691 | { |
692 | mem_17 = (int (**)(int , int ))cf; |
693 | __cil_tmp10 = *mem_17; |
694 | __cil_tmp11 = (unsigned long )cf; |
695 | __cil_tmp12 = __cil_tmp11 + 8; |
696 | mem_18 = (int *)__cil_tmp12; |
697 | __cil_tmp13 = *mem_18; |
698 | (*__cil_tmp10)(4, __cil_tmp13); |
699 | __cil_tmp14 = (unsigned long )cf; |
700 | __cil_tmp15 = __cil_tmp14 + 16; |
701 | mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp15; |
702 | cf = *mem_19; |
703 | } |
704 | } |
705 | while_3_break: /* CIL Label */ ; |
706 | } |
707 | { |
708 | __utac__exception__cf_handler_free(exception); |
709 | } |
710 | return; |
711 | } |
712 | } |
713 | void *__utac__error_stack_mgt(void *env , int mode , int count ) ; |
714 | static struct __ACC__ERR *head = (struct __ACC__ERR *)0; |
715 | void *__utac__error_stack_mgt(void *env , int mode , int count ) |
716 | { void *retValue_acc ; |
717 | struct __ACC__ERR *new ; |
718 | void *tmp ; |
719 | struct __ACC__ERR *temp ; |
720 | struct __ACC__ERR *next ; |
721 | void *excep ; |
722 | unsigned long __cil_tmp10 ; |
723 | unsigned long __cil_tmp11 ; |
724 | unsigned long __cil_tmp12 ; |
725 | unsigned long __cil_tmp13 ; |
726 | void *__cil_tmp14 ; |
727 | unsigned long __cil_tmp15 ; |
728 | unsigned long __cil_tmp16 ; |
729 | void *__cil_tmp17 ; |
730 | void **mem_18 ; |
731 | struct __ACC__ERR **mem_19 ; |
732 | struct __ACC__ERR **mem_20 ; |
733 | void **mem_21 ; |
734 | struct __ACC__ERR **mem_22 ; |
735 | void **mem_23 ; |
736 | void **mem_24 ; |
737 | |
738 | { |
739 | if (count == 0) { |
740 | return (retValue_acc); |
741 | } else { |
742 | |
743 | } |
744 | if (mode == 0) { |
745 | { |
746 | tmp = malloc(16UL); |
747 | new = (struct __ACC__ERR *)tmp; |
748 | mem_18 = (void **)new; |
749 | *mem_18 = env; |
750 | __cil_tmp10 = (unsigned long )new; |
751 | __cil_tmp11 = __cil_tmp10 + 8; |
752 | mem_19 = (struct __ACC__ERR **)__cil_tmp11; |
753 | *mem_19 = head; |
754 | head = new; |
755 | retValue_acc = (void *)new; |
756 | } |
757 | return (retValue_acc); |
758 | } else { |
759 | |
760 | } |
761 | if (mode == 1) { |
762 | temp = head; |
763 | { |
764 | while (1) { |
765 | while_4_continue: /* CIL Label */ ; |
766 | if (count > 1) { |
767 | |
768 | } else { |
769 | goto while_4_break; |
770 | } |
771 | { |
772 | __cil_tmp12 = (unsigned long )temp; |
773 | __cil_tmp13 = __cil_tmp12 + 8; |
774 | mem_20 = (struct __ACC__ERR **)__cil_tmp13; |
775 | next = *mem_20; |
776 | mem_21 = (void **)temp; |
777 | excep = *mem_21; |
778 | __cil_tmp14 = (void *)temp; |
779 | free(__cil_tmp14); |
780 | __utac__exception__cf_handler_reset(excep); |
781 | temp = next; |
782 | count = count - 1; |
783 | } |
784 | } |
785 | while_4_break: /* CIL Label */ ; |
786 | } |
787 | { |
788 | __cil_tmp15 = (unsigned long )temp; |
789 | __cil_tmp16 = __cil_tmp15 + 8; |
790 | mem_22 = (struct __ACC__ERR **)__cil_tmp16; |
791 | head = *mem_22; |
792 | mem_23 = (void **)temp; |
793 | excep = *mem_23; |
794 | __cil_tmp17 = (void *)temp; |
795 | free(__cil_tmp17); |
796 | __utac__exception__cf_handler_reset(excep); |
797 | retValue_acc = excep; |
798 | } |
799 | return (retValue_acc); |
800 | } else { |
801 | |
802 | } |
803 | if (mode == 2) { |
804 | if (head != 0) { |
805 | mem_24 = (void **)head; |
806 | retValue_acc = *mem_24; |
807 | return (retValue_acc); |
808 | } else { |
809 | retValue_acc = (void *)0; |
810 | return (retValue_acc); |
811 | } |
812 | } else { |
813 | |
814 | } |
815 | return (retValue_acc); |
816 | } |
817 | } |
818 | void *__utac__get_this_arg(int i , struct JoinPoint *this ) |
819 | { void *retValue_acc ; |
820 | unsigned long __cil_tmp4 ; |
821 | unsigned long __cil_tmp5 ; |
822 | int __cil_tmp6 ; |
823 | int __cil_tmp7 ; |
824 | unsigned long __cil_tmp8 ; |
825 | unsigned long __cil_tmp9 ; |
826 | void **__cil_tmp10 ; |
827 | void **__cil_tmp11 ; |
828 | int *mem_12 ; |
829 | void ***mem_13 ; |
830 | |
831 | { |
832 | if (i > 0) { |
833 | { |
834 | __cil_tmp4 = (unsigned long )this; |
835 | __cil_tmp5 = __cil_tmp4 + 16; |
836 | mem_12 = (int *)__cil_tmp5; |
837 | __cil_tmp6 = *mem_12; |
838 | if (i <= __cil_tmp6) { |
839 | |
840 | } else { |
841 | { |
842 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
843 | 123U, "__utac__get_this_arg"); |
844 | } |
845 | } |
846 | } |
847 | } else { |
848 | { |
849 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
850 | 123U, "__utac__get_this_arg"); |
851 | } |
852 | } |
853 | __cil_tmp7 = i - 1; |
854 | __cil_tmp8 = (unsigned long )this; |
855 | __cil_tmp9 = __cil_tmp8 + 8; |
856 | mem_13 = (void ***)__cil_tmp9; |
857 | __cil_tmp10 = *mem_13; |
858 | __cil_tmp11 = __cil_tmp10 + __cil_tmp7; |
859 | retValue_acc = *__cil_tmp11; |
860 | return (retValue_acc); |
861 | return (retValue_acc); |
862 | } |
863 | } |
864 | char const *__utac__get_this_argtype(int i , struct JoinPoint *this ) |
865 | { char const *retValue_acc ; |
866 | unsigned long __cil_tmp4 ; |
867 | unsigned long __cil_tmp5 ; |
868 | int __cil_tmp6 ; |
869 | int __cil_tmp7 ; |
870 | unsigned long __cil_tmp8 ; |
871 | unsigned long __cil_tmp9 ; |
872 | char const **__cil_tmp10 ; |
873 | char const **__cil_tmp11 ; |
874 | int *mem_12 ; |
875 | char const ***mem_13 ; |
876 | |
877 | { |
878 | if (i > 0) { |
879 | { |
880 | __cil_tmp4 = (unsigned long )this; |
881 | __cil_tmp5 = __cil_tmp4 + 16; |
882 | mem_12 = (int *)__cil_tmp5; |
883 | __cil_tmp6 = *mem_12; |
884 | if (i <= __cil_tmp6) { |
885 | |
886 | } else { |
887 | { |
888 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
889 | 131U, "__utac__get_this_argtype"); |
890 | } |
891 | } |
892 | } |
893 | } else { |
894 | { |
895 | __assert_fail("i > 0 && i <= this->argsCount", "libacc.c", |
896 | 131U, "__utac__get_this_argtype"); |
897 | } |
898 | } |
899 | __cil_tmp7 = i - 1; |
900 | __cil_tmp8 = (unsigned long )this; |
901 | __cil_tmp9 = __cil_tmp8 + 24; |
902 | mem_13 = (char const ***)__cil_tmp9; |
903 | __cil_tmp10 = *mem_13; |
904 | __cil_tmp11 = __cil_tmp10 + __cil_tmp7; |
905 | retValue_acc = *__cil_tmp11; |
906 | return (retValue_acc); |
907 | return (retValue_acc); |
908 | } |
909 | } |
2017-05-11 19:52:32:970 INFO ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 19:52:33:099 INFO CPAchecker.run CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started
2017-05-11 19:52:34:917 INFO CFACreationUtils.addEdgeToCFA line 169: Dead code detected: return (retValue_acc);
2017-05-11 19:52:34:919 INFO CFACreationUtils.addEdgeToCFA line 181: Dead code detected: return (retValue_acc);
2017-05-11 19:52:34:922 INFO CFACreationUtils.addEdgeToCFA line 204: Dead code detected: return (retValue_acc);
2017-05-11 19:52:35:034 INFO CFACreationUtils.addEdgeToCFA line 366: Dead code detected: return (retValue_acc);
2017-05-11 19:52:35:035 INFO CFACreationUtils.addEdgeToCFA line 375: Dead code detected: return (retValue_acc);
2017-05-11 19:52:35:042 INFO CFACreationUtils.addEdgeToCFA line 430: Dead code detected: return (retValue_acc);
2017-05-11 19:52:35:050 INFO CFACreationUtils.addEdgeToCFA line 486: Dead code detected: return (retValue_acc);
2017-05-11 19:52:35:061 INFO CFACreationUtils.addEdgeToCFA line 518: Dead code detected: return (retValue_acc);
2017-05-11 19:52:35:078 INFO CFACreationUtils.addEdgeToCFA line 532: Dead code detected: return (retValue_acc);
2017-05-11 19:52:35:196 INFO CFACreationUtils.addEdgeToCFA line 861: Dead code detected: return (retValue_acc);
2017-05-11 19:52:35:209 INFO CFACreationUtils.addEdgeToCFA line 907: Dead code detected: return (retValue_acc);
2017-05-11 19:52:35:455 WARNING CFunctionPointerResolver.replaceFunctionPointerCall line 698: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.
2017-05-11 19:52:37:062 INFO CPAchecker.runAlgorithm Starting analysis ...
2017-05-11 19:52:37:088 INFO Parallel analysis 1:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 19:52:37:118 INFO Parallel analysis 2:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 19:52:37:417 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 19:52:38:194 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 19:52:38:399 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 19:52:38:577 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 19:52:39:071 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 19:52:39:074 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 19:52:39:095 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 19:52:39:107 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 19:52:39:533 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 19:52:42:876 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 19:52:42:881 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 19:52:44:099 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 1
2017-05-11 19:52:44:099 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5c3c5c9e
2017-05-11 19:52:44:100 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 19:52:44:817 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 19:52:48:550 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 2
2017-05-11 19:52:48:584 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5c3c5c9e
2017-05-11 19:52:48:584 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 19:52:51:660 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 4
2017-05-11 19:52:51:660 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5c3c5c9e
2017-05-11 19:52:51:661 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 19:52:53:957 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 8
2017-05-11 19:52:53:958 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5c3c5c9e
2017-05-11 19:52:53:958 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 19:52:55:718 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 16
2017-05-11 19:52:55:732 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5c3c5c9e
2017-05-11 19:52:55:733 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 19:52:57:805 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 20
2017-05-11 19:52:57:806 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5c3c5c9e
2017-05-11 19:52:57:806 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 19:53:01:781 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions Adjusting maximum formula depth to 2
2017-05-11 19:53:01:781 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5c3c5c9e
2017-05-11 19:53:01:781 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 19:53:04:727 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 28
2017-05-11 19:53:04:733 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5c3c5c9e
2017-05-11 19:53:04:739 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 19:53:06:483 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 19:53:07:283 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 32
2017-05-11 19:53:07:283 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5c3c5c9e
2017-05-11 19:53:07:284 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 19:53:08:752 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 40
2017-05-11 19:53:08:752 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5c3c5c9e
2017-05-11 19:53:08:753 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 19:53:12:297 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 2
2017-05-11 19:53:12:297 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 19:53:12:307 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 19:53:12:309 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 19:53:12:357 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 19:53:15:209 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 19:53:18:483 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 3
2017-05-11 19:53:18:484 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 19:53:18:496 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 19:53:18:497 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 19:53:18:568 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 19:53:26:201 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 19:53:32:646 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 4
2017-05-11 19:53:32:647 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 19:53:32:655 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 19:53:32:656 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 19:53:32:739 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 19:53:36:205 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 19:53:45:207 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 5
2017-05-11 19:53:45:207 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 19:53:45:215 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 19:53:45:216 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 19:53:45:329 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 19:53:49:444 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 19:54:02:051 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 6
2017-05-11 19:54:02:052 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 19:54:02:066 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 19:54:02:067 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 19:54:02:180 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 19:54:06:484 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 19:54:09:695 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 44
2017-05-11 19:54:09:697 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@5c3c5c9e
2017-05-11 19:54:09:697 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 19:54:37:172 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 7
2017-05-11 19:54:37:173 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 19:54:37:181 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 19:54:37:182 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 19:54:37:345 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 19:54:54:224 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 19:55:52:286 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 8
2017-05-11 19:55:52:286 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 19:55:52:832 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 19:56:01:599 INFO Parallel analysis 1:BMCAlgorithm.analyzeCounterexample Error found, creating error path
2017-05-11 19:56:04:769 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 19:56:05:277 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 19:56:05:278 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 19:56:05:690 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 19:56:05:691 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 19:56:06:175 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 19:56:06:176 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 19:56:06:876 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 19:56:06:877 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 19:56:07:499 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 19:56:07:499 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 19:56:08:139 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 19:56:08:140 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 19:56:08:927 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 19:56:08:927 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 19:56:10:878 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 19:56:10:883 INFO ParallelAlgorithm.handleFutureResults /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.
2017-05-11 19:56:10:908 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Analysis was terminated
2017-05-11 19:56:10:910 INFO CPAchecker.runAlgorithm Stopping analysis ...
Parallel Algorithm statistics
-----------------------------
Number of algorithms used: 2
Successful analysis: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
Statistics for: /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties
===================================================================================================================================
PredicateCPA statistics
-----------------------
Number of abstractions: 8 (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: 8 (100%)
Times precision was empty: 8 (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: 388
BDD entailment checks: 0
Number of SMT sat checks: 0
trivial: 0
cached: 0
Max ABE block size: 648
Number of predicates discovered: 0
Time for post operator: 2.676s
Time for path formula creation: 2.659s
Time for strengthen operator: 0.002s
Time for prec operator: 0.004s
Time for abstraction: 0.000s (Max: 0.000s, Count: 8)
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.058s
Time for coverage check: 0.000s
Total time for SMT solver (w/o itp): 0.000s
Total number of created targets for pointer analysis: 1152
Number of created targets for uf: *signed_int is 145
PrecisionBootstrap statistics
-----------------------------
Init. function predicates: 0
Init. global predicates: 0
Init. location predicates: 0
Invariant Generation statistics
-------------------------------
Bounds CPA statistics
---------------------
Bound k: 8
Maximum loop iteration reached: 9
ValueAnalysisCPA statistics
---------------------------
Number of variables: 25118 (count: 1604, min: 0, max: 22, avg: 15.66)
Number of global variables: 17372 (count: 1604, min: 0, max: 16, avg: 10.83)
ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations: 1804
Total time for liveness abstraction: 0.000s
Total time for abstraction computation: 0.058s
Total time for path thresholds: 0.000s
Number of tracked memory locations: 51
ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions: 632
Number of deterministic Assumptions: 148
Level of Determinism: 23%
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.014s
Automaton transfers with branching: 0
Automaton transfer successors: 1804 (count: 1812, min: 0, max: 1, avg: 1.00) [0 x 8, 1 x 1804]
CPA algorithm statistics
------------------------
Number of iterations: 1618
Max size of waitlist: 8
Average size of waitlist: 2
Number of computed successors: 1804
Max successors for one state: 2
Number of times merged: 194
Number of times stopped: 194
Number of times breaked: 0
Total time for CPA algorithm: 3.910s (Max: 3.318s)
Time for choose from waitlist: 0.003s
Time for precision adjustment: 0.153s
Time for transfer relation: 3.552s
Time for merge operator: 0.085s
Time for stop operator: 0.019s
Time for adding to reached set: 0.010s
BMC algorithm statistics
------------------------
Time for BMC formula creation: 3.917s
Time for final sat check: 8.767s
Time for error path creation: 2.529s
Time for bounding assertions check: 0.922s
Time for induction formula creation: 60.813s
Time for induction check: 125.680s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 7 (700%)
Time for counterexample checks: 6.110s
Time for running CBMC: 5.775s
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.446s
Automaton transfers with branching: 0
Automaton transfer successors: 74997 (count: 75279, min: 0, max: 1, avg: 1.00) [0 x 282, 1 x 74997]
CPA algorithm statistics
------------------------
Number of iterations: 69077
Max size of waitlist: 489
Average size of waitlist: 161
Number of computed successors: 74997
Max successors for one state: 2
Number of times merged: 18006
Number of times stopped: 19632
Number of times breaked: 0
Total time for CPA algorithm: 209.370s (Max: 121.152s)
Time for choose from waitlist: 0.111s
Time for precision adjustment: 2.130s
Time for transfer relation: 21.745s
Time for merge operator: 173.901s
Time for stop operator: 9.695s
Time for adding to reached set: 0.493s
Other statistics
================
Code Coverage
-----------------------------
Function coverage: 0.611
Visited lines: 107
Total lines: 409
Line coverage: 0.262
Visited conditions: 79
Total conditions: 114
Condition coverage: 0.693
CPAchecker general statistics
-----------------------------
Number of program locations: 672
Number of CFA edges: 778
Number of relevant variables: 139
Number of functions: 36
Number of loops: 9
Size of reached set: 1604
Number of reached locations: 304 (45%)
Avg states per location: 5
Max states per location: 15 (at node N210)
Number of reached functions: 22 (61%)
Number of partitions: 1604
Avg size of partitions: 1
Max size of partitions: 1
Number of target states: 8
Time for analysis setup: 3.923s
Time for loading CPAs: 1.103s
Time for loading parser: 0.753s
Time for CFA construction: 1.970s
Time for parsing file(s): 0.484s
Time for AST to CFA: 0.681s
Time for CFA sanity check: 0.176s
Time for post-processing: 0.543s
Time for var class.: 0.289s
Time for CFA export: 0.995s
Time for Analysis: 213.845s
CPU time for analysis: 420.460s
Time for analyzing result: 0.001s
Total time for CPAchecker: 217.788s
Total CPU time for CPAchecker: 427.280s
Time for statistics: 5.877s
Time for Garbage Collector: 16.159s (in 149 runs)
Garbage Collector(s) used: PS MarkSweep, PS Scavenge
Used heap memory: 561MB ( 535 MiB) max; 279MB ( 266 MiB) avg; 589MB ( 561 MiB) peak
Used non-heap memory: 54MB ( 51 MiB) max; 50MB ( 48 MiB) avg; 60MB ( 57 MiB) peak
Used in PS Old Gen pool: 159MB ( 151 MiB) max; 87MB ( 83 MiB) avg; 160MB ( 152 MiB) peak
Allocated heap memory: 1205MB ( 1150 MiB) max; 973MB ( 928 MiB) avg
Allocated non-heap memory: 56MB ( 54 MiB) max; 53MB ( 51 MiB) avg
Total process virtual memory: 7071MB ( 6743 MiB) max; 6658MB ( 6349 MiB) avg
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec4_product34_false-unreach-call_false-termination.cil/minepump_spec4_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_spec4_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