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_449 = 3; int INPUTS_at_449[3]; int input_at_449_counter = 0;int num_of_inputs_at_439 = 3; int INPUTS_at_439[3]; int input_at_439_counter = 0;int num_of_inputs_at_457 = 3; int INPUTS_at_457[3]; int input_at_457_counter = 0;int num_of_inputs_at_429 = 3; int INPUTS_at_429[3]; int input_at_429_counter = 0;int initialize_reads() { for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_449[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_439[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_457[instrumentation_index] = __VERIFIER_nondet_int(); for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_429[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,"scenario.i","") |
406 | void waterRise(void) ; |
407 | void changeMethaneLevel(void) ; |
408 | void startSystem(void) ; |
409 | void timeShift(void) ; |
410 | void cleanup(void) ; |
411 | void test(void) |
412 | { int splverifierCounter ; |
413 | int tmp ; |
414 | int tmp___0 ; |
415 | int tmp___1 ; |
416 | int tmp___2 ; |
417 | |
418 | { |
419 | splverifierCounter = 0; |
420 | { |
421 | while (1) { |
422 | while_3_continue: /* CIL Label */ ; |
423 | if (splverifierCounter < 4) { |
424 | |
425 | } else { |
426 | goto while_3_break; |
427 | } |
428 | { |
429 | tmp = (input_at_429_counter < num_of_inputs_at_429) ? INPUTS_at_429[input_at_429_counter++] : __VERIFIER_nondet_int() ; |
430 | } |
431 | if (tmp != 0) { |
432 | { |
433 | waterRise(); |
434 | } |
435 | } else { |
436 | |
437 | } |
438 | { |
439 | tmp___0 = (input_at_439_counter < num_of_inputs_at_439) ? INPUTS_at_439[input_at_439_counter++] : __VERIFIER_nondet_int() ; |
440 | } |
441 | if (tmp___0 != 0) { |
442 | { |
443 | changeMethaneLevel(); |
444 | } |
445 | } else { |
446 | |
447 | } |
448 | { |
449 | tmp___2 = (input_at_449_counter < num_of_inputs_at_449) ? INPUTS_at_449[input_at_449_counter++] : __VERIFIER_nondet_int() ; |
450 | } |
451 | if (tmp___2 != 0) { |
452 | { |
453 | startSystem(); |
454 | } |
455 | } else { |
456 | { |
457 | tmp___1 = (input_at_457_counter < num_of_inputs_at_457) ? INPUTS_at_457[input_at_457_counter++] : __VERIFIER_nondet_int() ; |
458 | } |
459 | if (tmp___1 != 0) { |
460 | |
461 | } else { |
462 | |
463 | } |
464 | } |
465 | { |
466 | timeShift(); |
467 | } |
468 | } |
469 | while_3_break: /* CIL Label */ ; |
470 | } |
471 | { |
472 | cleanup(); |
473 | } |
474 | return; |
475 | } |
476 | } |
477 | #pragma merger(0,"MinePump.i","") |
478 | void lowerWaterLevel(void) ; |
479 | int isMethaneLevelCritical(void) ; |
480 | void printEnvironment(void) ; |
481 | int isHighWaterSensorDry(void) ; |
482 | void activatePump(void) ; |
483 | void deactivatePump(void) ; |
484 | int isPumpRunning(void) ; |
485 | void printPump(void) ; |
486 | int pumpRunning = 0; |
487 | int systemActive = 1; |
488 | void __utac_acc__Specification2_spec__2(void) ; |
489 | void processEnvironment(void) ; |
490 | void timeShift(void) |
491 | { |
492 | |
493 | { |
494 | if (pumpRunning != 0) { |
495 | { |
496 | lowerWaterLevel(); |
497 | } |
498 | } else { |
499 | |
500 | } |
501 | if (systemActive != 0) { |
502 | { |
503 | processEnvironment(); |
504 | } |
505 | } else { |
506 | |
507 | } |
508 | { |
509 | __utac_acc__Specification2_spec__2(); |
510 | } |
511 | return; |
512 | } |
513 | } |
514 | void processEnvironment__wrappee__base(void) |
515 | { |
516 | |
517 | { |
518 | return; |
519 | } |
520 | } |
521 | int isHighWaterLevel(void) ; |
522 | void processEnvironment(void) |
523 | { int tmp ; |
524 | |
525 | { |
526 | if (! pumpRunning) { |
527 | { |
528 | tmp = isHighWaterLevel(); |
529 | } |
530 | if (tmp != 0) { |
531 | { |
532 | activatePump(); |
533 | } |
534 | } else { |
535 | { |
536 | processEnvironment__wrappee__base(); |
537 | } |
538 | } |
539 | } else { |
540 | { |
541 | processEnvironment__wrappee__base(); |
542 | } |
543 | } |
544 | return; |
545 | } |
546 | } |
547 | void activatePump__wrappee__highWaterSensor(void) |
548 | { |
549 | |
550 | { |
551 | pumpRunning = 1; |
552 | return; |
553 | } |
554 | } |
555 | int isMethaneAlarm(void) ; |
556 | void activatePump(void) |
557 | { int tmp ; |
558 | |
559 | { |
560 | { |
561 | tmp = isMethaneAlarm(); |
562 | } |
563 | if (tmp != 0) { |
564 | |
565 | } else { |
566 | { |
567 | activatePump__wrappee__highWaterSensor(); |
568 | } |
569 | } |
570 | return; |
571 | } |
572 | } |
573 | void deactivatePump(void) |
574 | { |
575 | |
576 | { |
577 | pumpRunning = 0; |
578 | return; |
579 | } |
580 | } |
581 | int isMethaneAlarm(void) |
582 | { int retValue_acc ; |
583 | |
584 | { |
585 | { |
586 | retValue_acc = isMethaneLevelCritical(); |
587 | } |
588 | return (retValue_acc); |
589 | return (retValue_acc); |
590 | } |
591 | } |
592 | int isPumpRunning(void) |
593 | { int retValue_acc ; |
594 | |
595 | { |
596 | retValue_acc = pumpRunning; |
597 | return (retValue_acc); |
598 | return (retValue_acc); |
599 | } |
600 | } |
601 | void printPump(void) |
602 | { |
603 | |
604 | { |
605 | { |
606 | // printf("Pump(System:"); |
607 | } |
608 | if (systemActive != 0) { |
609 | { |
610 | // printf("On"); |
611 | } |
612 | } else { |
613 | { |
614 | // printf("Off"); |
615 | } |
616 | } |
617 | { |
618 | // printf(",Pump:"); |
619 | } |
620 | if (pumpRunning != 0) { |
621 | { |
622 | // printf("On"); |
623 | } |
624 | } else { |
625 | { |
626 | // printf("Off"); |
627 | } |
628 | } |
629 | { |
630 | // printf(") "); |
631 | printEnvironment(); |
632 | // printf("\n"); |
633 | } |
634 | return; |
635 | } |
636 | } |
637 | int isHighWaterLevel(void) |
638 | { int retValue_acc ; |
639 | int tmp ; |
640 | int tmp___0 ; |
641 | |
642 | { |
643 | { |
644 | tmp = isHighWaterSensorDry(); |
645 | } |
646 | if (tmp != 0) { |
647 | tmp___0 = 0; |
648 | } else { |
649 | tmp___0 = 1; |
650 | } |
651 | retValue_acc = tmp___0; |
652 | return (retValue_acc); |
653 | return (retValue_acc); |
654 | } |
655 | } |
656 | void startSystem(void) |
657 | { |
658 | |
659 | { |
660 | systemActive = 1; |
661 | return; |
662 | } |
663 | } |
664 | #pragma merger(0,"Specification2_spec.i","") |
665 | void __automaton_fail(void) ; |
666 | int methAndRunningLastTime ; |
667 | inline static void __utac_acc__Specification2_spec__1(void) |
668 | { |
669 | |
670 | { |
671 | methAndRunningLastTime = 0; |
672 | return; |
673 | } |
674 | } |
675 | void __utac_acc__Specification2_spec__2(void) |
676 | { int tmp ; |
677 | int tmp___0 ; |
678 | |
679 | { |
680 | { |
681 | tmp = isMethaneLevelCritical(); |
682 | } |
683 | if (tmp != 0) { |
684 | { |
685 | tmp___0 = isPumpRunning(); |
686 | } |
687 | if (tmp___0 != 0) { |
688 | if (methAndRunningLastTime != 0) { |
689 | { |
690 | __automaton_fail(); |
691 | } |
692 | } else { |
693 | methAndRunningLastTime = 1; |
694 | } |
695 | } else { |
696 | methAndRunningLastTime = 0; |
697 | } |
698 | } else { |
699 | methAndRunningLastTime = 0; |
700 | } |
701 | return; |
702 | } |
703 | } |
704 | #pragma merger(0,"featureselect.i","") |
705 | int select_one(void) ; |
706 | void select_features(void) ; |
707 | void select_helpers(void) ; |
708 | int valid_product(void) ; |
709 | int select_one(void) |
710 | { int retValue_acc ; |
711 | int choice = __VERIFIER_nondet_int(); |
712 | |
713 | { |
714 | retValue_acc = choice; |
715 | return (retValue_acc); |
716 | return (retValue_acc); |
717 | } |
718 | } |
719 | void select_features(void) |
720 | { |
721 | |
722 | { |
723 | return; |
724 | } |
725 | } |
726 | void select_helpers(void) |
727 | { |
728 | |
729 | { |
730 | return; |
731 | } |
732 | } |
733 | int valid_product(void) |
734 | { int retValue_acc ; |
735 | |
736 | { |
737 | retValue_acc = 1; |
738 | return (retValue_acc); |
739 | return (retValue_acc); |
740 | } |
741 | } |
742 | #pragma merger(0,"Test.i","") |
743 | int cleanupTimeShifts = 4; |
744 | void cleanup(void) |
745 | { int i ; |
746 | int __cil_tmp2 ; |
747 | |
748 | { |
749 | { |
750 | timeShift(); |
751 | i = 0; |
752 | } |
753 | { |
754 | while (1) { |
755 | while_4_continue: /* CIL Label */ ; |
756 | { |
757 | __cil_tmp2 = cleanupTimeShifts - 1; |
758 | if (i < __cil_tmp2) { |
759 | |
760 | } else { |
761 | goto while_4_break; |
762 | } |
763 | } |
764 | { |
765 | timeShift(); |
766 | i = i + 1; |
767 | } |
768 | } |
769 | while_4_break: /* CIL Label */ ; |
770 | } |
771 | return; |
772 | } |
773 | } |
774 | void Specification2(void) |
775 | { |
776 | |
777 | { |
778 | { |
779 | timeShift(); |
780 | printPump(); |
781 | timeShift(); |
782 | printPump(); |
783 | timeShift(); |
784 | printPump(); |
785 | waterRise(); |
786 | printPump(); |
787 | timeShift(); |
788 | printPump(); |
789 | changeMethaneLevel(); |
790 | printPump(); |
791 | timeShift(); |
792 | printPump(); |
793 | cleanup(); |
794 | } |
795 | return; |
796 | } |
797 | } |
798 | void setup(void) |
799 | { |
800 | |
801 | { |
802 | return; |
803 | } |
804 | } |
805 | void runTest(void) |
806 | { |
807 | |
808 | { |
809 | { |
810 | __utac_acc__Specification2_spec__1(); |
811 | test(); |
812 | } |
813 | return; |
814 | } |
815 | } |
816 | int main(void) |
817 | {initialize_reads(); int retValue_acc ; |
818 | int tmp ; |
819 | |
820 | { |
821 | { |
822 | select_helpers(); |
823 | select_features(); |
824 | tmp = valid_product(); |
825 | } |
826 | if (tmp != 0) { |
827 | { |
828 | setup(); |
829 | runTest(); |
830 | } |
831 | } else { |
832 | |
833 | } |
834 | retValue_acc = 0; |
835 | return (retValue_acc); |
836 | return (retValue_acc); |
837 | } |
838 | } |
839 | #pragma merger(0,"wsllib_check.i","") |
840 | void __automaton_fail(void) |
841 | { |
842 | |
843 | { |
844 | __VERIFIER_assume(!((0 != INPUTS_at_429[2] && 0 == INPUTS_at_429[1] && 0 == INPUTS_at_429[0] && 0 == INPUTS_at_439[2] && 0 == INPUTS_at_439[0] && 0 == INPUTS_at_449[1] && 0 == INPUTS_at_449[2] && 0 == INPUTS_at_449[0])));__VERIFIER_assume(!((0 != INPUTS_at_439[2] && 0 == INPUTS_at_457[1] && 0 == INPUTS_at_449[1] && 0 == INPUTS_at_439[1] && 0 == INPUTS_at_457[0] && 0 == INPUTS_at_449[0] && 0 == INPUTS_at_439[0] && 0 == INPUTS_at_429[2])));__VERIFIER_assume(!((0 != INPUTS_at_439[2] && 0 == INPUTS_at_457[1] && 0 == INPUTS_at_449[1] && 0 == INPUTS_at_439[1] && 0 == INPUTS_at_457[0] && 0 != INPUTS_at_429[2] && 0 == INPUTS_at_449[0] && 0 == INPUTS_at_439[0])));__VERIFIER_error(); |
845 | return; |
846 | } |
847 | } |
848 | #pragma merger(0,"Environment.i","") |
849 | int getWaterLevel(void) ; |
850 | int waterLevel = 1; |
851 | int methaneLevelCritical = 0; |
852 | void lowerWaterLevel(void) |
853 | { |
854 | |
855 | { |
856 | if (waterLevel > 0) { |
857 | waterLevel = waterLevel - 1; |
858 | } else { |
859 | |
860 | } |
861 | return; |
862 | } |
863 | } |
864 | void waterRise(void) |
865 | { |
866 | |
867 | { |
868 | if (waterLevel < 2) { |
869 | waterLevel = waterLevel + 1; |
870 | } else { |
871 | |
872 | } |
873 | return; |
874 | } |
875 | } |
876 | void changeMethaneLevel(void) |
877 | { |
878 | |
879 | { |
880 | if (methaneLevelCritical != 0) { |
881 | methaneLevelCritical = 0; |
882 | } else { |
883 | methaneLevelCritical = 1; |
884 | } |
885 | return; |
886 | } |
887 | } |
888 | int isMethaneLevelCritical(void) |
889 | { int retValue_acc ; |
890 | |
891 | { |
892 | retValue_acc = methaneLevelCritical; |
893 | return (retValue_acc); |
894 | return (retValue_acc); |
895 | } |
896 | } |
897 | void printEnvironment(void) |
898 | { |
899 | |
900 | { |
901 | { |
902 | // printf("Env(Water:%i", waterLevel); |
903 | // printf(",Meth:"); |
904 | } |
905 | if (methaneLevelCritical != 0) { |
906 | { |
907 | // printf("CRIT"); |
908 | } |
909 | } else { |
910 | { |
911 | // printf("OK"); |
912 | } |
913 | } |
914 | { |
915 | // printf(")"); |
916 | } |
917 | return; |
918 | } |
919 | } |
920 | int getWaterLevel(void) |
921 | { int retValue_acc ; |
922 | |
923 | { |
924 | retValue_acc = waterLevel; |
925 | return (retValue_acc); |
926 | return (retValue_acc); |
927 | } |
928 | } |
929 | int isHighWaterSensorDry(void) |
930 | { int retValue_acc ; |
931 | |
932 | { |
933 | if (waterLevel < 2) { |
934 | retValue_acc = 1; |
935 | return (retValue_acc); |
936 | } else { |
937 | retValue_acc = 0; |
938 | return (retValue_acc); |
939 | } |
940 | return (retValue_acc); |
941 | } |
942 | } |
2017-05-11 13:22:04:784 INFO ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 13:22:04:946 INFO CPAchecker.run CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started
2017-05-11 13:22:06:925 INFO CFACreationUtils.addEdgeToCFA line 356: Dead code detected: return (retValue_acc);
2017-05-11 13:22:06:931 INFO CFACreationUtils.addEdgeToCFA line 402: Dead code detected: return (retValue_acc);
2017-05-11 13:22:06:996 INFO CFACreationUtils.addEdgeToCFA line 589: Dead code detected: return (retValue_acc);
2017-05-11 13:22:06:998 INFO CFACreationUtils.addEdgeToCFA line 598: Dead code detected: return (retValue_acc);
2017-05-11 13:22:07:002 INFO CFACreationUtils.addEdgeToCFA line 653: Dead code detected: return (retValue_acc);
2017-05-11 13:22:07:014 INFO CFACreationUtils.addEdgeToCFA line 716: Dead code detected: return (retValue_acc);
2017-05-11 13:22:07:020 INFO CFACreationUtils.addEdgeToCFA line 739: Dead code detected: return (retValue_acc);
2017-05-11 13:22:07:038 INFO CFACreationUtils.addEdgeToCFA line 836: Dead code detected: return (retValue_acc);
2017-05-11 13:22:07:100 INFO CFACreationUtils.addEdgeToCFA line 894: Dead code detected: return (retValue_acc);
2017-05-11 13:22:07:105 INFO CFACreationUtils.addEdgeToCFA line 926: Dead code detected: return (retValue_acc);
2017-05-11 13:22:07:107 INFO CFACreationUtils.addEdgeToCFA line 940: Dead code detected: return (retValue_acc);
2017-05-11 13:22:07:344 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 13:22:09:024 INFO CPAchecker.runAlgorithm Starting analysis ...
2017-05-11 13:22:09:073 INFO Parallel analysis 1:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 13:22:09:134 INFO Parallel analysis 2:ResourceLimitChecker.fromConfiguration Using the following resource limits: CPU-time limit of 900s
2017-05-11 13:22:09:593 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 13:22:10:412 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 13:22:10:630 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 13:22:10:837 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 13:22:11:368 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 13:22:11:374 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 13:22:11:393 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 13:22:11:414 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 13:22:12:068 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:22:16:304 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:22:16:339 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:22:16:812 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:22:19:077 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 1
2017-05-11 13:22:19:077 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:19:078 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:25:767 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 2
2017-05-11 13:22:25:807 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:25:808 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:28:176 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 4
2017-05-11 13:22:28:177 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:28:192 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:31:394 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 5
2017-05-11 13:22:31:400 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:31:406 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:33:217 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions Adjusting maximum formula depth to 3
2017-05-11 13:22:33:217 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:33:222 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:36:021 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 7
2017-05-11 13:22:36:026 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:36:050 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:37:980 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 8
2017-05-11 13:22:37:981 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:37:981 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:39:196 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 10
2017-05-11 13:22:39:196 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:39:197 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:39:652 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:22:39:868 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 14
2017-05-11 13:22:39:877 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:39:877 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:40:629 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 16
2017-05-11 13:22:40:630 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:40:630 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:42:909 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 17
2017-05-11 13:22:42:917 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:42:918 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:44:394 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 19
2017-05-11 13:22:44:396 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:44:396 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:45:663 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 23
2017-05-11 13:22:45:664 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:45:664 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:48:029 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 25
2017-05-11 13:22:48:030 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:48:030 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:49:951 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 29
2017-05-11 13:22:49:974 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:49:974 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:51:535 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 37
2017-05-11 13:22:51:536 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:22:51:536 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:22:58:942 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 2
2017-05-11 13:22:58:944 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:22:58:954 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:22:58:955 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:22:58:978 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:23:05:922 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:23:12:832 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 3
2017-05-11 13:23:12:833 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:23:12:842 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:23:12:843 INFO Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions Starting assertions check...
2017-05-11 13:23:12:972 INFO Parallel analysis 1:KInductionProver.check Running algorithm to create induction hypothesis
2017-05-11 13:23:20:175 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 41
2017-05-11 13:23:20:175 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:23:20:176 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:23:23:848 INFO Parallel analysis 1:KInductionProver.check Starting induction check...
2017-05-11 13:23:40:822 INFO Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions Adjusting interestingVariableLimit to 49
2017-05-11 13:23:40:823 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3d3a7581
2017-05-11 13:23:40:823 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Updating reached set provided to other analyses
2017-05-11 13:24:22:680 INFO Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision Adjusting maxLoopIterations to 4
2017-05-11 13:24:22:680 INFO Parallel analysis 1:AbstractBMCAlgorithm.run Creating formula for program
2017-05-11 13:24:22:945 INFO Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck Starting satisfiability check...
2017-05-11 13:24:25:495 INFO Parallel analysis 1:BMCAlgorithm.analyzeCounterexample Error found, creating error path
2017-05-11 13:24:26:969 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:24:27:521 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:24:27:522 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:24:28:071 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found but identified as infeasible.
2017-05-11 13:24:28:072 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found, starting counterexample check with CBMC.
2017-05-11 13:24:28:869 INFO Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample Error path found and confirmed by counterexample check with CBMC.
2017-05-11 13:24:28:876 INFO ParallelAlgorithm.handleFutureResults /lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.
2017-05-11 13:24:28:886 INFO Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis Analysis was terminated
2017-05-11 13:24:28:887 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: 3 (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: 3 (100%)
Times precision was empty: 3 (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: 260
BDD entailment checks: 0
Number of SMT sat checks: 0
trivial: 0
cached: 0
Max ABE block size: 408
Number of predicates discovered: 0
Time for post operator: 3.366s
Time for path formula creation: 3.363s
Time for strengthen operator: 0.015s
Time for prec operator: 0.005s
Time for abstraction: 0.000s (Max: 0.000s, Count: 3)
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.032s
Time for coverage check: 0.000s
Total time for SMT solver (w/o itp): 0.000s
Total number of created targets for pointer analysis: 288
Number of created targets for uf: *signed_int is 73
PrecisionBootstrap statistics
-----------------------------
Init. function predicates: 0
Init. global predicates: 0
Init. location predicates: 0
Invariant Generation statistics
-------------------------------
Bounds CPA statistics
---------------------
Bound k: 4
Maximum loop iteration reached: 5
ValueAnalysisCPA statistics
---------------------------
Number of variables: 15333 (count: 973, min: 0, max: 23, avg: 15.76)
Number of global variables: 10946 (count: 973, min: 0, max: 17, avg: 11.25)
ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations: 1105
Total time for liveness abstraction: 0.000s
Total time for abstraction computation: 0.045s
Total time for path thresholds: 0.000s
Number of tracked memory locations: 53
ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions: 370
Number of deterministic Assumptions: 86
Level of Determinism: 23%
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.002s
Automaton transfers with branching: 0
Automaton transfer successors: 1105 (count: 1108, min: 0, max: 1, avg: 1.00) [0 x 3, 1 x 1105]
CPA algorithm statistics
------------------------
Number of iterations: 979
Max size of waitlist: 7
Average size of waitlist: 2
Number of computed successors: 1105
Max successors for one state: 2
Number of times merged: 130
Number of times stopped: 130
Number of times breaked: 0
Total time for CPA algorithm: 4.479s (Max: 4.204s)
Time for choose from waitlist: 0.003s
Time for precision adjustment: 0.102s
Time for transfer relation: 4.275s
Time for merge operator: 0.040s
Time for stop operator: 0.007s
Time for adding to reached set: 0.005s
BMC algorithm statistics
------------------------
Time for BMC formula creation: 4.493s
Time for final sat check: 2.550s
Time for error path creation: 1.174s
Time for bounding assertions check: 0.293s
Time for induction formula creation: 40.639s
Time for induction check: 84.988s
Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks: 1
Number of infeasible paths: 2 (200%)
Time for counterexample checks: 1.902s
Time for running CBMC: 1.748s
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.723s
Time for transition matches: 0.305s
Time for transition assertions: 0.000s
Time for transition actions: 0.000s
Automaton transfers with branching: 0
Automaton transfer successors: 95450 (count: 95581, min: 0, max: 1, avg: 1.00) [0 x 131, 1 x 95450]
CPA algorithm statistics
------------------------
Number of iterations: 89024
Max size of waitlist: 239
Average size of waitlist: 70
Number of computed successors: 95450
Max successors for one state: 2
Number of times merged: 18377
Number of times stopped: 20107
Number of times breaked: 0
Total time for CPA algorithm: 135.286s (Max: 48.035s)
Time for choose from waitlist: 0.262s
Time for precision adjustment: 1.492s
Time for transfer relation: 26.243s
Time for merge operator: 99.381s
Time for stop operator: 6.115s
Time for adding to reached set: 0.662s
Other statistics
================
Code Coverage
-----------------------------
Function coverage: 0.658
Visited lines: 123
Total lines: 422
Line coverage: 0.291
Visited conditions: 105
Total conditions: 140
Condition coverage: 0.750
CPAchecker general statistics
-----------------------------
Number of program locations: 710
Number of CFA edges: 835
Number of relevant variables: 146
Number of functions: 38
Number of loops: 9
Size of reached set: 973
Number of reached locations: 347 (49%)
Avg states per location: 2
Max states per location: 8 (at node N672)
Number of reached functions: 25 (66%)
Number of partitions: 973
Avg size of partitions: 1
Max size of partitions: 1
Number of target states: 3
Time for analysis setup: 4.030s
Time for loading CPAs: 1.052s
Time for loading parser: 0.753s
Time for CFA construction: 2.126s
Time for parsing file(s): 0.538s
Time for AST to CFA: 0.659s
Time for CFA sanity check: 0.204s
Time for post-processing: 0.658s
Time for var class.: 0.355s
Time for CFA export: 0.979s
Time for Analysis: 139.860s
CPU time for analysis: 276.120s
Time for analyzing result: 0.001s
Total time for CPAchecker: 143.916s
Total CPU time for CPAchecker: 283.140s
Time for statistics: 2.873s
Time for Garbage Collector: 11.524s (in 97 runs)
Garbage Collector(s) used: PS MarkSweep, PS Scavenge
Used heap memory: 527MB ( 502 MiB) max; 249MB ( 237 MiB) avg; 550MB ( 524 MiB) peak
Used non-heap memory: 54MB ( 51 MiB) max; 50MB ( 47 MiB) avg; 59MB ( 57 MiB) peak
Used in PS Old Gen pool: 120MB ( 114 MiB) max; 62MB ( 59 MiB) avg; 120MB ( 114 MiB) peak
Allocated heap memory: 1205MB ( 1150 MiB) max; 977MB ( 932 MiB) avg
Allocated non-heap memory: 57MB ( 54 MiB) max; 53MB ( 50 MiB) avg
Total process virtual memory: 6802MB ( 6487 MiB) max; 6481MB ( 6181 MiB) avg
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec2_product42_false-unreach-call_false-termination.cil/minepump_spec2_product42_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_spec2_product42_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