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