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