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