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