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