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

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

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

2017-05-11 19:09:01:166	INFO	CFACreationUtils.addEdgeToCFA	line 356: Dead code detected: return (retValue_acc);

2017-05-11 19:09:01:172	INFO	CFACreationUtils.addEdgeToCFA	line 402: Dead code detected: return (retValue_acc);

2017-05-11 19:09:01:180	INFO	CFACreationUtils.addEdgeToCFA	line 506: Dead code detected: return (retValue_acc);

2017-05-11 19:09:01:182	INFO	CFACreationUtils.addEdgeToCFA	line 518: Dead code detected: return (retValue_acc);

2017-05-11 19:09:01:184	INFO	CFACreationUtils.addEdgeToCFA	line 541: Dead code detected: return (retValue_acc);

2017-05-11 19:09:01:206	INFO	CFACreationUtils.addEdgeToCFA	line 659: Dead code detected: return (retValue_acc);

2017-05-11 19:09:01:208	INFO	CFACreationUtils.addEdgeToCFA	line 691: Dead code detected: return (retValue_acc);

2017-05-11 19:09:01:210	INFO	CFACreationUtils.addEdgeToCFA	line 705: Dead code detected: return (retValue_acc);

2017-05-11 19:09:01:214	INFO	CFACreationUtils.addEdgeToCFA	line 797: Dead code detected: return (retValue_acc);

2017-05-11 19:09:01:216	INFO	CFACreationUtils.addEdgeToCFA	line 806: Dead code detected: return (retValue_acc);

2017-05-11 19:09:01:219	INFO	CFACreationUtils.addEdgeToCFA	line 861: Dead code detected: return (retValue_acc);

2017-05-11 19:09:01:346	WARNING	CFunctionPointerResolver.replaceFunctionPointerCall	line 193: Function pointer *__cil_tmp10 with type int (*)(int, int) is called, but no possible target functions were found.

2017-05-11 19:09:02:324	INFO	CPAchecker.runAlgorithm	Starting analysis ...

2017-05-11 19:09:02:346	INFO	Parallel analysis 1:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 19:09:02:369	INFO	Parallel analysis 2:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 19:09:02:556	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 19:09:03:124	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 19:09:03:213	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 19:09:03:298	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 19:09:03:529	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 19:09:03:533	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 19:09:03:544	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 19:09:03:560	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 19:09:03:762	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 19:09:05:900	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 19:09:05:900	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

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

2017-05-11 19:09:06:725	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 19:09:06:787	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 19:09:07:255	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 19:09:08:952	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 19:09:08:953	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

2017-05-11 19:09:08:953	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:09:11:169	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 19:09:11:170	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

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

2017-05-11 19:09:11:874	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 19:09:11:874	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

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

2017-05-11 19:09:13:123	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 10

2017-05-11 19:09:13:124	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

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

2017-05-11 19:09:14:094	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 19:09:14:099	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

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

2017-05-11 19:09:14:807	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 14

2017-05-11 19:09:14:808	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

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

2017-05-11 19:09:15:416	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 19:09:15:416	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

2017-05-11 19:09:15:417	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:09:15:838	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 20

2017-05-11 19:09:15:838	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

2017-05-11 19:09:15:839	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:09:16:314	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 22

2017-05-11 19:09:16:314	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

2017-05-11 19:09:16:314	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:09:16:517	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 19:09:16:661	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 26

2017-05-11 19:09:16:662	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

2017-05-11 19:09:16:662	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:09:17:565	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 28

2017-05-11 19:09:17:566	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

2017-05-11 19:09:17:566	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:09:19:018	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 29

2017-05-11 19:09:19:018	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

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

2017-05-11 19:09:19:677	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 31

2017-05-11 19:09:19:678	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

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

2017-05-11 19:09:20:488	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 32

2017-05-11 19:09:20:489	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

2017-05-11 19:09:20:489	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:09:21:335	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 33

2017-05-11 19:09:21:336	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

2017-05-11 19:09:21:336	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:09:21:672	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 19:09:21:672	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 19:09:21:681	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 19:09:21:682	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 19:09:21:720	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 19:09:22:009	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 35

2017-05-11 19:09:22:010	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

2017-05-11 19:09:22:010	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:09:22:576	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 39

2017-05-11 19:09:22:577	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

2017-05-11 19:09:22:577	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:09:24:146	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 19:09:27:038	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 41

2017-05-11 19:09:27:038	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

2017-05-11 19:09:27:038	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:09:33:628	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 19:09:33:628	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 19:09:33:637	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 19:09:33:638	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 19:09:33:692	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 19:09:38:371	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 19:09:45:003	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 19:09:45:004	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 19:09:45:012	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 19:09:45:013	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 19:09:45:084	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 19:09:49:746	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 19:09:49:872	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 42

2017-05-11 19:09:49:872	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

2017-05-11 19:09:49:872	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:10:07:389	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 19:10:07:389	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 19:10:07:398	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 19:10:07:399	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 19:10:07:476	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 19:10:11:568	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 44

2017-05-11 19:10:11:569	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

2017-05-11 19:10:11:569	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:10:15:039	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 19:10:37:554	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

2017-05-11 19:10:37:555	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 19:10:37:562	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 19:10:37:563	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 19:10:37:663	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 19:10:45:438	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 19:10:56:876	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 45

2017-05-11 19:10:56:877	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

2017-05-11 19:10:56:877	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:11:17:009	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 7

2017-05-11 19:11:17:010	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 19:11:17:019	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 19:11:17:020	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 19:11:17:135	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 19:11:27:710	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 19:11:57:627	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 8

2017-05-11 19:11:57:627	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 19:11:57:636	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 19:11:57:636	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 19:11:57:759	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 19:12:14:930	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 46

2017-05-11 19:12:14:931	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

2017-05-11 19:12:14:931	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 19:12:17:161	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 19:13:27:871	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 9

2017-05-11 19:13:27:872	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 19:13:28:361	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 19:13:31:027	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 48

2017-05-11 19:13:31:027	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@29392bbc

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

2017-05-11 19:13:37:478	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 19:13:40:848	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 19:13:41:187	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 19:13:41:187	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 19:13:41:497	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 19:13:41:497	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 19:13:41:931	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 19:13:41:932	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 19:13:42:335	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 19:13:42:335	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 19:13:42:778	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 19:13:42:778	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 19:13:43:294	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 19:13:43:294	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 19:13:44:181	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 19:13:44:182	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 19:13:44:855	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 19:13:44:856	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 19:13:45:522	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 19:13:45:526	INFO	ParallelAlgorithm.handleFutureResults	/lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.

2017-05-11 19:13:45:530	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 19:13:45:531	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:            9 (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:         9 (100%)
  Times precision was empty:       9 (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:         618
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  2.509s
  Time for path formula creation:        2.509s
Time for strengthen operator:            0.006s
Time for prec operator:                  0.004s
  Time for abstraction:                  0.000s (Max:     0.000s, Count: 9)
    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.028s
Time for coverage check:                 0.000s
Total time for SMT solver (w/o itp):     0.000s

Total number of created targets for pointer analysis: 1458
   Number of created targets for uf: *signed_int is 163



PrecisionBootstrap statistics
-----------------------------
Init. function predicates:                         0
Init. global predicates:                           0
Init. location predicates:                         0

Invariant Generation statistics
-------------------------------

Bounds CPA statistics
---------------------
Bound k:                                           9
Maximum loop iteration reached:                    10


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  30794 (count: 1882, min: 0, max: 28, avg: 16.36)
Number of global variables:                           21292 (count: 1882, min: 0, max: 21, avg: 11.31)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    2198
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.041s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                57

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  962
Number of deterministic Assumptions:                    236
Level of Determinism:                              25%

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.006s
Automaton transfers with branching:                0
Automaton transfer successors:                         2198 (count: 2207, min: 0, max: 1, avg: 1.00) [0 x 9, 1 x 2198]

CPA algorithm statistics
------------------------
Number of iterations:            1898
Max size of waitlist:            8
Average size of waitlist:        2
Number of computed successors:   2198
Max successors for one state:    2
Number of times merged:          309
Number of times stopped:         309
Number of times breaked:         0

Total time for CPA algorithm:         3.448s (Max:     2.908s)
  Time for choose from waitlist:      0.001s
  Time for precision adjustment:      0.084s
  Time for transfer relation:         3.292s
  Time for merge operator:            0.047s
  Time for stop operator:             0.005s
  Time for adding to reached set:     0.005s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           3.457s
Time for final sat check:                9.126s
Time for error path creation:            2.481s
Time for bounding assertions check:      0.874s
Time for induction formula creation:    66.238s
Time for induction check:              193.563s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         8 (800%)
Time for counterexample checks:         4.674s
Time for running CBMC:                  4.429s


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.813s
  Time for transition matches:                         0.418s
  Time for transition assertions:                      0.000s
  Time for transition actions:                         0.001s
Automaton transfers with branching:                0
Automaton transfer successors:                       235571 (count: 236606, min: 0, max: 1, avg: 1.00) [0 x 1035, 1 x 235571]

CPA algorithm statistics
------------------------
Number of iterations:            206627
Max size of waitlist:            965
Average size of waitlist:        208
Number of computed successors:   235571
Max successors for one state:    2
Number of times merged:          51095
Number of times stopped:         55064
Number of times breaked:         0

Total time for CPA algorithm:       280.358s (Max:    78.020s)
  Time for choose from waitlist:      0.186s
  Time for precision adjustment:      2.220s
  Time for transfer relation:        28.947s
  Time for merge operator:          227.811s
  Time for stop operator:            18.897s
  Time for adding to reached set:     0.871s


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

Code Coverage
-----------------------------
  Function coverage:      0.600
  Visited lines:          104
  Total lines:            406
  Line coverage:          0.256
  Visited conditions:     103
  Total conditions:       142
  Condition coverage:     0.725

CPAchecker general statistics
-----------------------------
Number of program locations:     685
Number of CFA edges:             802
Number of relevant variables:    140
Number of functions:             35
Number of loops:                 9
Size of reached set:             1882
  Number of reached locations:   313 (46%)
    Avg states per location:     6
    Max states per location:     17 (at node N552)
  Number of reached functions:   21 (60%)
  Number of partitions:          1882
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       9

Time for analysis setup:          2.399s
  Time for loading CPAs:          0.585s
  Time for loading parser:        0.449s
  Time for CFA construction:      1.291s
    Time for parsing file(s):     0.339s
    Time for AST to CFA:          0.404s
    Time for CFA sanity check:    0.115s
    Time for post-processing:     0.396s
      Time for var class.:        0.229s
    Time for CFA export:          0.546s
Time for Analysis:              283.204s
CPU time for analysis:          664.080s
Time for analyzing result:        0.001s
Total time for CPAchecker:      285.617s
Total CPU time for CPAchecker:  670.270s
Time for statistics:              3.777s

Time for Garbage Collector:      25.899s (in 292 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                796MB (   759 MiB) max;    422MB (   403 MiB) avg;    839MB (   800 MiB) peak
Used non-heap memory:             55MB (    53 MiB) max;     52MB (    49 MiB) avg;     62MB (    59 MiB) peak
Used in PS Old Gen pool:         405MB (   386 MiB) max;    231MB (   220 MiB) avg;    408MB (   389 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    959MB (   915 MiB) avg
Allocated non-heap memory:        57MB (    55 MiB) max;     54MB (    52 MiB) avg
Total process virtual memory:   8771MB (  8365 MiB) max;   8351MB (  7964 MiB) avg

    
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec4_product33_false-unreach-call_false-termination.cil/minepump_spec4_product33_false-unreach-call_false-termination.cil.over.instr.c
analysis.summaryEdges = true
analysis.useParallelAnalyses = true
cfa.allowBranchSwapping = false
cfa.simplifyCfa = false
limits.time.cpu = 900
log.level = INFO
output.path = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/minepump_spec4_product33_false-unreach-call_false-termination.cil/cpa_output
overflow.config = sv-comp16--k-induction-overflow.properties
parallelAlgorithm.configFiles = components/kInduction/svcomp16-kInduction.properties, components/invariantGeneration-no-out.properties::supply-reached-refinable
specification = /work/anon/anon/cfc/analyzers/cpachecker/config/specification/sv-comp-reachability.spc