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