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