Report for /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec3_product47_false-unreach-call_false-termination.cil/minepump_spec3_product47_false-unreach-call_false-termination.cil.over.instr.c (Counterexample 1)

Generated on 2017-05-11 14:00:38 by CPAchecker 1.6.1-svn

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_593 = 3; int INPUTS_at_593[3]; int input_at_593_counter = 0;int num_of_inputs_at_583 = 3; int INPUTS_at_583[3]; int input_at_583_counter = 0;int num_of_inputs_at_599 = 2; int INPUTS_at_599[2]; int input_at_599_counter = 0;int num_of_inputs_at_573 = 3; int INPUTS_at_573[3]; int input_at_573_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_593[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_583[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<2; instrumentation_index++) INPUTS_at_599[instrumentation_index] = __VERIFIER_nondet_int();  for (int instrumentation_index=0; instrumentation_index<3; instrumentation_index++) INPUTS_at_573[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,"wsllib_check.i","")  
40
void __automaton_fail(void)   
41
{   
42
  
43
  {  
44
  __VERIFIER_assume(!((0 == INPUTS_at_583[0])));__VERIFIER_assume(!((0 == INPUTS_at_583[1] && 0 != INPUTS_at_583[0])));__VERIFIER_assume(!((0 == INPUTS_at_599[1])));__VERIFIER_assume(!((0 == INPUTS_at_573[1])));__VERIFIER_assume(!((0 != INPUTS_at_573[0])));__VERIFIER_error();  
45
  return;  
46
}  
47
}  
48
#pragma merger(0,"Test.i","")  
49
int cleanupTimeShifts  =    4;  
50
void timeShift(void) ;  
51
void cleanup(void)   
52
{ int i ;  
53
  int __cil_tmp2 ;  
54
  
55
  {  
56
  {  
57
  timeShift();  
58
  i = 0;  
59
  }  
60
  {  
61
  while (1) {  
62
    while_0_continue: /* CIL Label */ ;  
63
    {  
64
    __cil_tmp2 = cleanupTimeShifts - 1;  
65
    if (i < __cil_tmp2) {  
66
  
67
    } else {  
68
      goto while_0_break;  
69
    }  
70
    }  
71
    {  
72
    timeShift();  
73
    i = i + 1;  
74
    }  
75
  }  
76
  while_0_break: /* CIL Label */ ;  
77
  }  
78
  return;  
79
}  
80
}  
81
void printPump(void) ;  
82
void waterRise(void) ;  
83
void changeMethaneLevel(void) ;  
84
void Specification2(void)   
85
{   
86
  
87
  {  
88
  {  
89
  timeShift();  
90
  printPump();  
91
  timeShift();  
92
  printPump();  
93
  timeShift();  
94
  printPump();  
95
  waterRise();  
96
  printPump();  
97
  timeShift();  
98
  printPump();  
99
  changeMethaneLevel();  
100
  printPump();  
101
  timeShift();  
102
  printPump();  
103
  cleanup();  
104
  }  
105
  return;  
106
}  
107
}  
108
void setup(void)   
109
{   
110
  
111
  {  
112
  return;  
113
}  
114
}  
115
void test(void) ;  
116
void runTest(void)   
117
{   
118
  
119
  {  
120
  {  
121
  test();  
122
  }  
123
  return;  
124
}  
125
}  
126
void select_helpers(void) ;  
127
void select_features(void) ;  
128
int valid_product(void) ;  
129
int main(void)   
130
{initialize_reads(); int retValue_acc ;  
131
  int tmp ;  
132
  
133
  {  
134
  {  
135
  select_helpers();  
136
  select_features();  
137
  tmp = valid_product();  
138
  }  
139
  if (tmp != 0) {  
140
    {  
141
    setup();  
142
    runTest();  
143
    }  
144
  } else {  
145
  
146
  }  
147
  retValue_acc = 0;  
148
  return (retValue_acc);  
149
  return (retValue_acc);  
150
}  
151
}  
152
#pragma merger(0,"featureselect.i","")  
153
int select_one(void) ;  
154
int select_one(void)   
155
{ int retValue_acc ;  
156
  int choice = __VERIFIER_nondet_int();  
157
  
158
  {  
159
  retValue_acc = choice;  
160
  return (retValue_acc);  
161
  return (retValue_acc);  
162
}  
163
}  
164
void select_features(void)   
165
{   
166
  
167
  {  
168
  return;  
169
}  
170
}  
171
void select_helpers(void)   
172
{   
173
  
174
  {  
175
  return;  
176
}  
177
}  
178
int valid_product(void)   
179
{ int retValue_acc ;  
180
  
181
  {  
182
  retValue_acc = 1;  
183
  return (retValue_acc);  
184
  return (retValue_acc);  
185
}  
186
}  
187
#pragma merger(0,"libacc.i","")  
188
extern  __attribute__((__nothrow__, __noreturn__)) void __assert_fail(char const   *__assertion ,  
189
                                                                      char const   *__file ,  
190
                                                                      unsigned int __line ,  
191
                                                                      char const   *__function ) ;  
192
extern  __attribute__((__nothrow__)) void *malloc(size_t __size )  __attribute__((__malloc__)) ;  
193
extern  __attribute__((__nothrow__)) void free(void *__ptr ) ;  
194
void __utac__exception__cf_handler_set(void *exception , int (*cflow_func)(int  ,  
195
                                                                           int  ) ,  
196
                                       int val )   
197
{ struct __UTAC__EXCEPTION *excep ;  
198
  struct __UTAC__CFLOW_FUNC *cf ;  
199
  void *tmp ;  
200
  unsigned long __cil_tmp7 ;  
201
  unsigned long __cil_tmp8 ;  
202
  unsigned long __cil_tmp9 ;  
203
  unsigned long __cil_tmp10 ;  
204
  unsigned long __cil_tmp11 ;  
205
  unsigned long __cil_tmp12 ;  
206
  unsigned long __cil_tmp13 ;  
207
  unsigned long __cil_tmp14 ;  
208
  int (**mem_15)(int  , int  ) ;  
209
  int *mem_16 ;  
210
  struct __UTAC__CFLOW_FUNC **mem_17 ;  
211
  struct __UTAC__CFLOW_FUNC **mem_18 ;  
212
  struct __UTAC__CFLOW_FUNC **mem_19 ;  
213
  
214
  {  
215
  {  
216
  excep = (struct __UTAC__EXCEPTION *)exception;  
217
  tmp = malloc(24UL);  
218
  cf = (struct __UTAC__CFLOW_FUNC *)tmp;  
219
  mem_15 = (int (**)(int  , int  ))cf;  
220
  *mem_15 = cflow_func;  
221
  __cil_tmp7 = (unsigned long )cf;  
222
  __cil_tmp8 = __cil_tmp7 + 8;  
223
  mem_16 = (int *)__cil_tmp8;  
224
  *mem_16 = val;  
225
  __cil_tmp9 = (unsigned long )cf;  
226
  __cil_tmp10 = __cil_tmp9 + 16;  
227
  __cil_tmp11 = (unsigned long )excep;  
228
  __cil_tmp12 = __cil_tmp11 + 24;  
229
  mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp10;  
230
  mem_18 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp12;  
231
  *mem_17 = *mem_18;  
232
  __cil_tmp13 = (unsigned long )excep;  
233
  __cil_tmp14 = __cil_tmp13 + 24;  
234
  mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14;  
235
  *mem_19 = cf;  
236
  }  
237
  return;  
238
}  
239
}  
240
void __utac__exception__cf_handler_free(void *exception )   
241
{ struct __UTAC__EXCEPTION *excep ;  
242
  struct __UTAC__CFLOW_FUNC *cf ;  
243
  struct __UTAC__CFLOW_FUNC *tmp ;  
244
  unsigned long __cil_tmp5 ;  
245
  unsigned long __cil_tmp6 ;  
246
  struct __UTAC__CFLOW_FUNC *__cil_tmp7 ;  
247
  unsigned long __cil_tmp8 ;  
248
  unsigned long __cil_tmp9 ;  
249
  unsigned long __cil_tmp10 ;  
250
  unsigned long __cil_tmp11 ;  
251
  void *__cil_tmp12 ;  
252
  unsigned long __cil_tmp13 ;  
253
  unsigned long __cil_tmp14 ;  
254
  struct __UTAC__CFLOW_FUNC **mem_15 ;  
255
  struct __UTAC__CFLOW_FUNC **mem_16 ;  
256
  struct __UTAC__CFLOW_FUNC **mem_17 ;  
257
  
258
  {  
259
  excep = (struct __UTAC__EXCEPTION *)exception;  
260
  __cil_tmp5 = (unsigned long )excep;  
261
  __cil_tmp6 = __cil_tmp5 + 24;  
262
  mem_15 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6;  
263
  cf = *mem_15;  
264
  {  
265
  while (1) {  
266
    while_1_continue: /* CIL Label */ ;  
267
    {  
268
    __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0;  
269
    __cil_tmp8 = (unsigned long )__cil_tmp7;  
270
    __cil_tmp9 = (unsigned long )cf;  
271
    if (__cil_tmp9 != __cil_tmp8) {  
272
  
273
    } else {  
274
      goto while_1_break;  
275
    }  
276
    }  
277
    {  
278
    tmp = cf;  
279
    __cil_tmp10 = (unsigned long )cf;  
280
    __cil_tmp11 = __cil_tmp10 + 16;  
281
    mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp11;  
282
    cf = *mem_16;  
283
    __cil_tmp12 = (void *)tmp;  
284
    free(__cil_tmp12);  
285
    }  
286
  }  
287
  while_1_break: /* CIL Label */ ;  
288
  }  
289
  __cil_tmp13 = (unsigned long )excep;  
290
  __cil_tmp14 = __cil_tmp13 + 24;  
291
  mem_17 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp14;  
292
  *mem_17 = (struct __UTAC__CFLOW_FUNC *)0;  
293
  return;  
294
}  
295
}  
296
void __utac__exception__cf_handler_reset(void *exception )   
297
{ struct __UTAC__EXCEPTION *excep ;  
298
  struct __UTAC__CFLOW_FUNC *cf ;  
299
  unsigned long __cil_tmp5 ;  
300
  unsigned long __cil_tmp6 ;  
301
  struct __UTAC__CFLOW_FUNC *__cil_tmp7 ;  
302
  unsigned long __cil_tmp8 ;  
303
  unsigned long __cil_tmp9 ;  
304
  int (*__cil_tmp10)(int  , int  ) ;  
305
  unsigned long __cil_tmp11 ;  
306
  unsigned long __cil_tmp12 ;  
307
  int __cil_tmp13 ;  
308
  unsigned long __cil_tmp14 ;  
309
  unsigned long __cil_tmp15 ;  
310
  struct __UTAC__CFLOW_FUNC **mem_16 ;  
311
  int (**mem_17)(int  , int  ) ;  
312
  int *mem_18 ;  
313
  struct __UTAC__CFLOW_FUNC **mem_19 ;  
314
  
315
  {  
316
  excep = (struct __UTAC__EXCEPTION *)exception;  
317
  __cil_tmp5 = (unsigned long )excep;  
318
  __cil_tmp6 = __cil_tmp5 + 24;  
319
  mem_16 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp6;  
320
  cf = *mem_16;  
321
  {  
322
  while (1) {  
323
    while_2_continue: /* CIL Label */ ;  
324
    {  
325
    __cil_tmp7 = (struct __UTAC__CFLOW_FUNC *)0;  
326
    __cil_tmp8 = (unsigned long )__cil_tmp7;  
327
    __cil_tmp9 = (unsigned long )cf;  
328
    if (__cil_tmp9 != __cil_tmp8) {  
329
  
330
    } else {  
331
      goto while_2_break;  
332
    }  
333
    }  
334
    {  
335
    mem_17 = (int (**)(int  , int  ))cf;  
336
    __cil_tmp10 = *mem_17;  
337
    __cil_tmp11 = (unsigned long )cf;  
338
    __cil_tmp12 = __cil_tmp11 + 8;  
339
    mem_18 = (int *)__cil_tmp12;  
340
    __cil_tmp13 = *mem_18;  
341
    (*__cil_tmp10)(4, __cil_tmp13);  
342
    __cil_tmp14 = (unsigned long )cf;  
343
    __cil_tmp15 = __cil_tmp14 + 16;  
344
    mem_19 = (struct __UTAC__CFLOW_FUNC **)__cil_tmp15;  
345
    cf = *mem_19;  
346
    }  
347
  }  
348
  while_2_break: /* CIL Label */ ;  
349
  }  
350
  {  
351
  __utac__exception__cf_handler_free(exception);  
352
  }  
353
  return;  
354
}  
355
}  
356
void *__utac__error_stack_mgt(void *env , int mode , int count ) ;  
357
static struct __ACC__ERR *head  =    (struct __ACC__ERR *)0;  
358
void *__utac__error_stack_mgt(void *env , int mode , int count )   
359
{ void *retValue_acc ;  
360
  struct __ACC__ERR *new ;  
361
  void *tmp ;  
362
  struct __ACC__ERR *temp ;  
363
  struct __ACC__ERR *next ;  
364
  void *excep ;  
365
  unsigned long __cil_tmp10 ;  
366
  unsigned long __cil_tmp11 ;  
367
  unsigned long __cil_tmp12 ;  
368
  unsigned long __cil_tmp13 ;  
369
  void *__cil_tmp14 ;  
370
  unsigned long __cil_tmp15 ;  
371
  unsigned long __cil_tmp16 ;  
372
  void *__cil_tmp17 ;  
373
  void **mem_18 ;  
374
  struct __ACC__ERR **mem_19 ;  
375
  struct __ACC__ERR **mem_20 ;  
376
  void **mem_21 ;  
377
  struct __ACC__ERR **mem_22 ;  
378
  void **mem_23 ;  
379
  void **mem_24 ;  
380
  
381
  {  
382
  if (count == 0) {  
383
    return (retValue_acc);  
384
  } else {  
385
  
386
  }  
387
  if (mode == 0) {  
388
    {  
389
    tmp = malloc(16UL);  
390
    new = (struct __ACC__ERR *)tmp;  
391
    mem_18 = (void **)new;  
392
    *mem_18 = env;  
393
    __cil_tmp10 = (unsigned long )new;  
394
    __cil_tmp11 = __cil_tmp10 + 8;  
395
    mem_19 = (struct __ACC__ERR **)__cil_tmp11;  
396
    *mem_19 = head;  
397
    head = new;  
398
    retValue_acc = (void *)new;  
399
    }  
400
    return (retValue_acc);  
401
  } else {  
402
  
403
  }  
404
  if (mode == 1) {  
405
    temp = head;  
406
    {  
407
    while (1) {  
408
      while_3_continue: /* CIL Label */ ;  
409
      if (count > 1) {  
410
  
411
      } else {  
412
        goto while_3_break;  
413
      }  
414
      {  
415
      __cil_tmp12 = (unsigned long )temp;  
416
      __cil_tmp13 = __cil_tmp12 + 8;  
417
      mem_20 = (struct __ACC__ERR **)__cil_tmp13;  
418
      next = *mem_20;  
419
      mem_21 = (void **)temp;  
420
      excep = *mem_21;  
421
      __cil_tmp14 = (void *)temp;  
422
      free(__cil_tmp14);  
423
      __utac__exception__cf_handler_reset(excep);  
424
      temp = next;  
425
      count = count - 1;  
426
      }  
427
    }  
428
    while_3_break: /* CIL Label */ ;  
429
    }  
430
    {  
431
    __cil_tmp15 = (unsigned long )temp;  
432
    __cil_tmp16 = __cil_tmp15 + 8;  
433
    mem_22 = (struct __ACC__ERR **)__cil_tmp16;  
434
    head = *mem_22;  
435
    mem_23 = (void **)temp;  
436
    excep = *mem_23;  
437
    __cil_tmp17 = (void *)temp;  
438
    free(__cil_tmp17);  
439
    __utac__exception__cf_handler_reset(excep);  
440
    retValue_acc = excep;  
441
    }  
442
    return (retValue_acc);  
443
  } else {  
444
  
445
  }  
446
  if (mode == 2) {  
447
    if (head != 0) {  
448
      mem_24 = (void **)head;  
449
      retValue_acc = *mem_24;  
450
      return (retValue_acc);  
451
    } else {  
452
      retValue_acc = (void *)0;  
453
      return (retValue_acc);  
454
    }  
455
  } else {  
456
  
457
  }  
458
  return (retValue_acc);  
459
}  
460
}  
461
void *__utac__get_this_arg(int i , struct JoinPoint *this )   
462
{ void *retValue_acc ;  
463
  unsigned long __cil_tmp4 ;  
464
  unsigned long __cil_tmp5 ;  
465
  int __cil_tmp6 ;  
466
  int __cil_tmp7 ;  
467
  unsigned long __cil_tmp8 ;  
468
  unsigned long __cil_tmp9 ;  
469
  void **__cil_tmp10 ;  
470
  void **__cil_tmp11 ;  
471
  int *mem_12 ;  
472
  void ***mem_13 ;  
473
  
474
  {  
475
  if (i > 0) {  
476
    {  
477
    __cil_tmp4 = (unsigned long )this;  
478
    __cil_tmp5 = __cil_tmp4 + 16;  
479
    mem_12 = (int *)__cil_tmp5;  
480
    __cil_tmp6 = *mem_12;  
481
    if (i <= __cil_tmp6) {  
482
  
483
    } else {  
484
      {  
485
      __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
486
                    123U, "__utac__get_this_arg");  
487
      }  
488
    }  
489
    }  
490
  } else {  
491
    {  
492
    __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
493
                  123U, "__utac__get_this_arg");  
494
    }  
495
  }  
496
  __cil_tmp7 = i - 1;  
497
  __cil_tmp8 = (unsigned long )this;  
498
  __cil_tmp9 = __cil_tmp8 + 8;  
499
  mem_13 = (void ***)__cil_tmp9;  
500
  __cil_tmp10 = *mem_13;  
501
  __cil_tmp11 = __cil_tmp10 + __cil_tmp7;  
502
  retValue_acc = *__cil_tmp11;  
503
  return (retValue_acc);  
504
  return (retValue_acc);  
505
}  
506
}  
507
char const   *__utac__get_this_argtype(int i , struct JoinPoint *this )   
508
{ char const   *retValue_acc ;  
509
  unsigned long __cil_tmp4 ;  
510
  unsigned long __cil_tmp5 ;  
511
  int __cil_tmp6 ;  
512
  int __cil_tmp7 ;  
513
  unsigned long __cil_tmp8 ;  
514
  unsigned long __cil_tmp9 ;  
515
  char const   **__cil_tmp10 ;  
516
  char const   **__cil_tmp11 ;  
517
  int *mem_12 ;  
518
  char const   ***mem_13 ;  
519
  
520
  {  
521
  if (i > 0) {  
522
    {  
523
    __cil_tmp4 = (unsigned long )this;  
524
    __cil_tmp5 = __cil_tmp4 + 16;  
525
    mem_12 = (int *)__cil_tmp5;  
526
    __cil_tmp6 = *mem_12;  
527
    if (i <= __cil_tmp6) {  
528
  
529
    } else {  
530
      {  
531
      __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
532
                    131U, "__utac__get_this_argtype");  
533
      }  
534
    }  
535
    }  
536
  } else {  
537
    {  
538
    __assert_fail("i > 0 && i <= this->argsCount", "libacc.c",  
539
                  131U, "__utac__get_this_argtype");  
540
    }  
541
  }  
542
  __cil_tmp7 = i - 1;  
543
  __cil_tmp8 = (unsigned long )this;  
544
  __cil_tmp9 = __cil_tmp8 + 24;  
545
  mem_13 = (char const   ***)__cil_tmp9;  
546
  __cil_tmp10 = *mem_13;  
547
  __cil_tmp11 = __cil_tmp10 + __cil_tmp7;  
548
  retValue_acc = *__cil_tmp11;  
549
  return (retValue_acc);  
550
  return (retValue_acc);  
551
}  
552
}  
553
#pragma merger(0,"scenario.i","")  
554
void stopSystem(void) ;  
555
void test(void)   
556
{ int splverifierCounter ;  
557
  int tmp ;  
558
  int tmp___0 ;  
559
  int tmp___1 ;  
560
  int tmp___2 ;  
561
  
562
  {  
563
  splverifierCounter = 0;  
564
  {  
565
  while (1) {  
566
    while_4_continue: /* CIL Label */ ;  
567
    if (splverifierCounter < 4) {  
568
  
569
    } else {  
570
      goto while_4_break;  
571
    }  
572
    {  
573
    tmp = (input_at_573_counter < num_of_inputs_at_573) ? INPUTS_at_573[input_at_573_counter++] : __VERIFIER_nondet_int() ;  
574
    }  
575
    if (tmp != 0) {  
576
      {  
577
      waterRise();  
578
      }  
579
    } else {  
580
  
581
    }  
582
    {  
583
    tmp___0 = (input_at_583_counter < num_of_inputs_at_583) ? INPUTS_at_583[input_at_583_counter++] : __VERIFIER_nondet_int() ;  
584
    }  
585
    if (tmp___0 != 0) {  
586
      {  
587
      changeMethaneLevel();  
588
      }  
589
    } else {  
590
  
591
    }  
592
    {  
593
    tmp___2 = (input_at_593_counter < num_of_inputs_at_593) ? INPUTS_at_593[input_at_593_counter++] : __VERIFIER_nondet_int() ;  
594
    }  
595
    if (tmp___2 != 0) {  
596
  
597
    } else {  
598
      {  
599
      tmp___1 = (input_at_599_counter < num_of_inputs_at_599) ? INPUTS_at_599[input_at_599_counter++] : __VERIFIER_nondet_int() ;  
600
      }  
601
      if (tmp___1 != 0) {  
602
        {  
603
        stopSystem();  
604
        }  
605
      } else {  
606
  
607
      }  
608
    }  
609
    {  
610
    timeShift();  
611
    }  
612
  }  
613
  while_4_break: /* CIL Label */ ;  
614
  }  
615
  {  
616
  cleanup();  
617
  }  
618
  return;  
619
}  
620
}  
621
#pragma merger(0,"MinePump.i","")  
622
void lowerWaterLevel(void) ;  
623
int isMethaneLevelCritical(void) ;  
624
void printEnvironment(void) ;  
625
int isHighWaterSensorDry(void) ;  
626
void activatePump(void) ;  
627
void deactivatePump(void) ;  
628
int isPumpRunning(void) ;  
629
int pumpRunning  =    0;  
630
int systemActive  =    1;  
631
void __utac_acc__Specification3_spec__1(void) ;  
632
void processEnvironment(void) ;  
633
void timeShift(void)   
634
{   
635
  
636
  {  
637
  if (pumpRunning != 0) {  
638
    {  
639
    lowerWaterLevel();  
640
    }  
641
  } else {  
642
  
643
  }  
644
  if (systemActive != 0) {  
645
    {  
646
    processEnvironment();  
647
    }  
648
  } else {  
649
  
650
  }  
651
  {  
652
  __utac_acc__Specification3_spec__1();  
653
  }  
654
  return;  
655
}  
656
}  
657
void processEnvironment__wrappee__base(void)   
658
{   
659
  
660
  {  
661
  return;  
662
}  
663
}  
664
int isHighWaterLevel(void) ;  
665
void processEnvironment__wrappee__methaneQuery(void)   
666
{ int tmp ;  
667
  
668
  {  
669
  if (! pumpRunning) {  
670
    {  
671
    tmp = isHighWaterLevel();  
672
    }  
673
    if (tmp != 0) {  
674
      {  
675
      activatePump();  
676
      }  
677
    } else {  
678
      {  
679
      processEnvironment__wrappee__base();  
680
      }  
681
    }  
682
  } else {  
683
    {  
684
    processEnvironment__wrappee__base();  
685
    }  
686
  }  
687
  return;  
688
}  
689
}  
690
int isMethaneAlarm(void) ;  
691
void processEnvironment(void)   
692
{ int tmp ;  
693
  
694
  {  
695
  if (pumpRunning != 0) {  
696
    {  
697
    tmp = isMethaneAlarm();  
698
    }  
699
    if (tmp != 0) {  
700
      {  
701
      deactivatePump();  
702
      }  
703
    } else {  
704
      {  
705
      processEnvironment__wrappee__methaneQuery();  
706
      }  
707
    }  
708
  } else {  
709
    {  
710
    processEnvironment__wrappee__methaneQuery();  
711
    }  
712
  }  
713
  return;  
714
}  
715
}  
716
void activatePump__wrappee__highWaterSensor(void)   
717
{   
718
  
719
  {  
720
  pumpRunning = 1;  
721
  return;  
722
}  
723
}  
724
void activatePump(void)   
725
{ int tmp ;  
726
  
727
  {  
728
  {  
729
  tmp = isMethaneAlarm();  
730
  }  
731
  if (tmp != 0) {  
732
  
733
  } else {  
734
    {  
735
    activatePump__wrappee__highWaterSensor();  
736
    }  
737
  }  
738
  return;  
739
}  
740
}  
741
void deactivatePump(void)   
742
{   
743
  
744
  {  
745
  pumpRunning = 0;  
746
  return;  
747
}  
748
}  
749
int isMethaneAlarm(void)   
750
{ int retValue_acc ;  
751
  
752
  {  
753
  {  
754
  retValue_acc = isMethaneLevelCritical();  
755
  }  
756
  return (retValue_acc);  
757
  return (retValue_acc);  
758
}  
759
}  
760
int isPumpRunning(void)   
761
{ int retValue_acc ;  
762
  
763
  {  
764
  retValue_acc = pumpRunning;  
765
  return (retValue_acc);  
766
  return (retValue_acc);  
767
}  
768
}  
769
void printPump(void)   
770
{   
771
  
772
  {  
773
  {  
774
//  printf("Pump(System:");  
775
  }  
776
  if (systemActive != 0) {  
777
    {  
778
//    printf("On");  
779
    }  
780
  } else {  
781
    {  
782
//    printf("Off");  
783
    }  
784
  }  
785
  {  
786
//  printf(",Pump:");  
787
  }  
788
  if (pumpRunning != 0) {  
789
    {  
790
//    printf("On");  
791
    }  
792
  } else {  
793
    {  
794
//    printf("Off");  
795
    }  
796
  }  
797
  {  
798
//  printf(") ");  
799
  printEnvironment();  
800
//  printf("\n");  
801
  }  
802
  return;  
803
}  
804
}  
805
int isHighWaterLevel(void)   
806
{ int retValue_acc ;  
807
  int tmp ;  
808
  int tmp___0 ;  
809
  
810
  {  
811
  {  
812
  tmp = isHighWaterSensorDry();  
813
  }  
814
  if (tmp != 0) {  
815
    tmp___0 = 0;  
816
  } else {  
817
    tmp___0 = 1;  
818
  }  
819
  retValue_acc = tmp___0;  
820
  return (retValue_acc);  
821
  return (retValue_acc);  
822
}  
823
}  
824
void stopSystem(void)   
825
{   
826
  
827
  {  
828
  if (pumpRunning != 0) {  
829
    {  
830
    deactivatePump();  
831
    }  
832
  } else {  
833
  
834
  }  
835
  systemActive = 0;  
836
  return;  
837
}  
838
}  
839
#pragma merger(0,"Environment.i","")  
840
int getWaterLevel(void) ;  
841
int waterLevel  =    1;  
842
int methaneLevelCritical  =    0;  
843
void lowerWaterLevel(void)   
844
{   
845
  
846
  {  
847
  if (waterLevel > 0) {  
848
    waterLevel = waterLevel - 1;  
849
  } else {  
850
  
851
  }  
852
  return;  
853
}  
854
}  
855
void waterRise(void)   
856
{   
857
  
858
  {  
859
  if (waterLevel < 2) {  
860
    waterLevel = waterLevel + 1;  
861
  } else {  
862
  
863
  }  
864
  return;  
865
}  
866
}  
867
void changeMethaneLevel(void)   
868
{   
869
  
870
  {  
871
  if (methaneLevelCritical != 0) {  
872
    methaneLevelCritical = 0;  
873
  } else {  
874
    methaneLevelCritical = 1;  
875
  }  
876
  return;  
877
}  
878
}  
879
int isMethaneLevelCritical(void)   
880
{ int retValue_acc ;  
881
  
882
  {  
883
  retValue_acc = methaneLevelCritical;  
884
  return (retValue_acc);  
885
  return (retValue_acc);  
886
}  
887
}  
888
void printEnvironment(void)   
889
{   
890
  
891
  {  
892
  {  
893
//  printf("Env(Water:%i", waterLevel);  
894
//  printf(",Meth:");  
895
  }  
896
  if (methaneLevelCritical != 0) {  
897
    {  
898
//    printf("CRIT");  
899
    }  
900
  } else {  
901
    {  
902
//    printf("OK");  
903
    }  
904
  }  
905
  {  
906
//  printf(")");  
907
  }  
908
  return;  
909
}  
910
}  
911
int getWaterLevel(void)   
912
{ int retValue_acc ;  
913
  
914
  {  
915
  retValue_acc = waterLevel;  
916
  return (retValue_acc);  
917
  return (retValue_acc);  
918
}  
919
}  
920
int isHighWaterSensorDry(void)   
921
{ int retValue_acc ;  
922
  
923
  {  
924
  if (waterLevel < 2) {  
925
    retValue_acc = 1;  
926
    return (retValue_acc);  
927
  } else {  
928
    retValue_acc = 0;  
929
    return (retValue_acc);  
930
  }  
931
  return (retValue_acc);  
932
}  
933
}  
934
#pragma merger(0,"Specification3_spec.i","")  
935
void __utac_acc__Specification3_spec__1(void)   
936
{ int tmp ;  
937
  int tmp___0 ;  
938
  int tmp___1 ;  
939
  
940
  {  
941
  {  
942
  tmp = isMethaneLevelCritical();  
943
  }  
944
  if (tmp != 0) {  
945
  
946
  } else {  
947
    {  
948
    tmp___0 = getWaterLevel();  
949
    }  
950
    if (tmp___0 == 2) {  
951
      {  
952
      tmp___1 = isPumpRunning();  
953
      }  
954
      if (tmp___1 != 0) {  
955
  
956
      } else {  
957
        {  
958
        __automaton_fail();  
959
        }  
960
      }  
961
    } else {  
962
  
963
    }  
964
  }  
965
  return;  
966
}  
967
}  
2017-05-11 13:59:20:875	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 13:59:20:961	INFO	CPAchecker.run	CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started

2017-05-11 13:59:22:187	INFO	CFACreationUtils.addEdgeToCFA	line 149: Dead code detected: return (retValue_acc);

2017-05-11 13:59:22:190	INFO	CFACreationUtils.addEdgeToCFA	line 161: Dead code detected: return (retValue_acc);

2017-05-11 13:59:22:192	INFO	CFACreationUtils.addEdgeToCFA	line 184: Dead code detected: return (retValue_acc);

2017-05-11 13:59:22:245	INFO	CFACreationUtils.addEdgeToCFA	line 504: Dead code detected: return (retValue_acc);

2017-05-11 13:59:22:249	INFO	CFACreationUtils.addEdgeToCFA	line 550: Dead code detected: return (retValue_acc);

2017-05-11 13:59:22:267	INFO	CFACreationUtils.addEdgeToCFA	line 757: Dead code detected: return (retValue_acc);

2017-05-11 13:59:22:269	INFO	CFACreationUtils.addEdgeToCFA	line 766: Dead code detected: return (retValue_acc);

2017-05-11 13:59:22:271	INFO	CFACreationUtils.addEdgeToCFA	line 821: Dead code detected: return (retValue_acc);

2017-05-11 13:59:22:275	INFO	CFACreationUtils.addEdgeToCFA	line 885: Dead code detected: return (retValue_acc);

2017-05-11 13:59:22:277	INFO	CFACreationUtils.addEdgeToCFA	line 917: Dead code detected: return (retValue_acc);

2017-05-11 13:59:22:278	INFO	CFACreationUtils.addEdgeToCFA	line 931: Dead code detected: return (retValue_acc);

2017-05-11 13:59:22:371	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 341: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 13:59:23:623	INFO	CPAchecker.runAlgorithm	Starting analysis ...

2017-05-11 13:59:23:651	INFO	Parallel analysis 1:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 13:59:23:680	INFO	Parallel analysis 2:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 13:59:23:876	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:59:24:475	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:59:24:575	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:59:24:660	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:59:24:956	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:59:24:959	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:59:24:968	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:59:24:975	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:59:25:258	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 13:59:27:136	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 13:59:27:173	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 13:59:27:550	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 13:59:28:197	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 13:59:28:198	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b81cc7d

2017-05-11 13:59:28:198	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:59:31:191	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 13:59:31:220	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b81cc7d

2017-05-11 13:59:31:221	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:59:32:980	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 13:59:32:981	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b81cc7d

2017-05-11 13:59:33:012	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:59:34:415	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 13:59:34:427	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b81cc7d

2017-05-11 13:59:34:427	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:59:35:170	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 13:59:35:171	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b81cc7d

2017-05-11 13:59:35:171	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:59:36:700	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 20

2017-05-11 13:59:36:700	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b81cc7d

2017-05-11 13:59:36:700	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:59:38:770	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 13:59:38:826	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 2

2017-05-11 13:59:38:826	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b81cc7d

2017-05-11 13:59:38:826	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:59:40:016	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 28

2017-05-11 13:59:40:017	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b81cc7d

2017-05-11 13:59:40:017	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:59:43:199	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 13:59:43:199	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b81cc7d

2017-05-11 13:59:43:199	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:59:47:693	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 13:59:47:694	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 13:59:47:702	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 13:59:47:704	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 13:59:47:721	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 13:59:48:377	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 34

2017-05-11 13:59:48:378	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b81cc7d

2017-05-11 13:59:48:378	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:59:52:899	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 13:59:54:658	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 35

2017-05-11 13:59:54:658	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b81cc7d

2017-05-11 13:59:54:659	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 13:59:59:747	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 37

2017-05-11 13:59:59:747	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b81cc7d

2017-05-11 13:59:59:747	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:00:04:875	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 38

2017-05-11 14:00:04:875	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b81cc7d

2017-05-11 14:00:04:876	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:00:09:960	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 40

2017-05-11 14:00:09:961	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b81cc7d

2017-05-11 14:00:09:961	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 14:00:15:873	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 14:00:15:873	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 14:00:15:883	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 14:00:15:884	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 14:00:15:906	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 14:00:22:474	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 14:00:32:861	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 14:00:32:861	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 14:00:33:065	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 14:00:34:617	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 14:00:35:545	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 14:00:35:895	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 14:00:35:895	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 14:00:36:189	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 14:00:36:190	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 14:00:36:575	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 14:00:36:575	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 14:00:37:162	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 14:00:37:166	INFO	ParallelAlgorithm.handleFutureResults	/lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.

2017-05-11 14:00:37:171	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 14:00:37:172	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:            4 (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:         4 (100%)
  Times precision was empty:       4 (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:         182
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

Max ABE block size:                       439
Number of predicates discovered:          0

Time for post operator:                  1.098s
  Time for path formula creation:        1.097s
Time for strengthen operator:            0.008s
Time for prec operator:                  0.010s
  Time for abstraction:                  0.001s (Max:     0.001s, Count: 4)
    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.021s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 242
   Number of created targets for uf: *signed_int is 67



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:                                  18261 (count: 1220, min: 0, max: 20, avg: 14.97)
Number of global variables:                           12091 (count: 1220, min: 0, max: 14, avg: 9.91)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    1313
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.049s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                46

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  314
Number of deterministic Assumptions:                     84
Level of Determinism:                              27%

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.010s
Automaton transfers with branching:                0
Automaton transfer successors:                         1313 (count: 1317, min: 0, max: 1, avg: 1.00) [0 x 4, 1 x 1313]

CPA algorithm statistics
------------------------
Number of iterations:            1226
Max size of waitlist:            9
Average size of waitlist:        3
Number of computed successors:   1313
Max successors for one state:    2
Number of times merged:          91
Number of times stopped:         91
Number of times breaked:         0

Total time for CPA algorithm:         2.055s (Max:     1.837s)
  Time for choose from waitlist:      0.002s
  Time for precision adjustment:      0.172s
  Time for transfer relation:         1.811s
  Time for merge operator:            0.026s
  Time for stop operator:             0.003s
  Time for adding to reached set:     0.004s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           2.063s
Time for final sat check:                1.566s
Time for error path creation:            0.800s
Time for bounding assertions check:      0.219s
Time for induction formula creation:    22.946s
Time for induction check:               42.240s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         3 (300%)
Time for counterexample checks:         1.617s
Time for running CBMC:                  1.505s


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.354s
Automaton transfers with branching:                0
Automaton transfer successors:                        84090 (count: 84369, min: 0, max: 1, avg: 1.00) [0 x 279, 1 x 84090]

CPA algorithm statistics
------------------------
Number of iterations:            80080
Max size of waitlist:            319
Average size of waitlist:        57
Number of computed successors:   84090
Max successors for one state:    2
Number of times merged:          16522
Number of times stopped:         18589
Number of times breaked:         0

Total time for CPA algorithm:        70.974s (Max:    27.179s)
  Time for choose from waitlist:      0.139s
  Time for precision adjustment:      0.764s
  Time for transfer relation:        12.826s
  Time for merge operator:           52.463s
  Time for stop operator:             3.711s
  Time for adding to reached set:     0.224s


Other statistics
================

Code Coverage
-----------------------------
  Function coverage:      0.711
  Visited lines:          133
  Total lines:            427
  Line coverage:          0.311
  Visited conditions:     72
  Total conditions:       106
  Condition coverage:     0.679

CPAchecker general statistics
-----------------------------
Number of program locations:     696
Number of CFA edges:             812
Number of relevant variables:    148
Number of functions:             38
Number of loops:                 9
Size of reached set:             1220
  Number of reached locations:   343 (49%)
    Avg states per location:     3
    Max states per location:     14 (at node N638)
  Number of reached functions:   27 (71%)
  Number of partitions:          1220
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       4

Time for analysis setup:          2.635s
  Time for loading CPAs:          0.867s
  Time for loading parser:        0.454s
  Time for CFA construction:      1.240s
    Time for parsing file(s):     0.337s
    Time for AST to CFA:          0.396s
    Time for CFA sanity check:    0.085s
    Time for post-processing:     0.368s
      Time for var class.:        0.221s
    Time for CFA export:          0.726s
Time for Analysis:               73.545s
CPU time for analysis:          202.940s
Time for analyzing result:        0.001s
Total time for CPAchecker:       76.194s
Total CPU time for CPAchecker:  210.120s
Time for statistics:              1.557s

Time for Garbage Collector:       6.533s (in 72 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                532MB (   507 MiB) max;    253MB (   241 MiB) avg;    550MB (   525 MiB) peak
Used non-heap memory:             54MB (    52 MiB) max;     50MB (    48 MiB) avg;     60MB (    57 MiB) peak
Used in PS Old Gen pool:         123MB (   117 MiB) max;     64MB (    61 MiB) avg;    123MB (   117 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    948MB (   904 MiB) avg
Allocated non-heap memory:        57MB (    54 MiB) max;     53MB (    50 MiB) avg
Total process virtual memory:   8369MB (  7981 MiB) max;   8083MB (  7709 MiB) avg

    
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec3_product47_false-unreach-call_false-termination.cil/minepump_spec3_product47_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_product47_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