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