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

Generated on 2017-05-11 12:38:13 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_33 = 1; _Bool INPUTS_at_33[1]; int input_at_33_counter = 0;int num_of_inputs_at_11 = 6; int INPUTS_at_11[6]; int input_at_11_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_33[instrumentation_index] = __VERIFIER_nondet_bool();  for (int instrumentation_index=0; instrumentation_index<6; instrumentation_index++) INPUTS_at_11[instrumentation_index] = __VERIFIER_nondet_int();}extern void __VERIFIER_assume(int);extern void __VERIFIER_error() __attribute__ ((__noreturn__));  
2
void __VERIFIER_assert(int cond) {  
3
  if (!(cond != 0)) {  
4
    __VERIFIER_assume(!((0 != (INPUTS_at_33[0]? 1 : 0) && INPUTS_at_11[0]- 1 < 1 + 0)));__VERIFIER_assume(!((0 == (INPUTS_at_33[0]? 1 : 0))));__VERIFIER_error();  
5
  }  
6
  return;  
7
}  
8
_Bool __VERIFIER_nondet_bool();  
9
int __VERIFIER_nondet_int();  
10
void f(int d) {  
11
  int x = __VERIFIER_nondet_int(), y = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(), z = 1;  
12
  L1:  
13
  while (z < k) {   
14
    z = 2 * z;   
15
  }  
16
  if (!(z>=2)) {  
17
  __VERIFIER_assume(!((0 != (INPUTS_at_33[0]? 1 : 0) && INPUTS_at_11[0]- 1 < 1 + 0)));__VERIFIER_assume(!((0 == (INPUTS_at_33[0]? 1 : 0))));__VERIFIER_error();  
18
}  
19
  L2:  
20
  while (x > 0 && y > 0) {  
21
    _Bool c = __VERIFIER_nondet_bool();  
22
    if (c != 0) {  
23
      P1:  
24
      x = x - d;  
25
      y = __VERIFIER_nondet_bool();  
26
      z = z - 1;  
27
    } else {  
28
      y = y - d;  
29
    }  
30
  }  
31
}  
32
int main() {initialize_reads();  
33
  _Bool c = (input_at_33_counter < num_of_inputs_at_33) ? INPUTS_at_33[input_at_33_counter++] : __VERIFIER_nondet_bool() ;  
34
  if (c != 0) {  
35
    f(1);  
36
  } else {  
37
    f(2);  
38
  }  
39
  return 0;  
40
}  
2017-05-11 12:36:46:471	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 12:36:46:581	INFO	CPAchecker.run	CPAchecker 1.6.1-svn (Java HotSpot(TM) 64-Bit Server VM 1.8.0_102) started

2017-05-11 12:36:49:334	INFO	CPAchecker.runAlgorithm	Starting analysis ...

2017-05-11 12:36:49:403	INFO	Parallel analysis 1:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 12:36:49:437	INFO	Parallel analysis 2:ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

2017-05-11 12:36:49:705	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 12:36:50:391	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 12:36:50:510	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 12:36:50:667	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 12:36:50:907	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 12:36:50:910	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 12:36:50:922	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 12:36:50:938	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 12:36:51:300	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:36:52:000	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 12:36:52:001	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@13b9e884

2017-05-11 12:36:52:002	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:36:52:089	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:36:52:106	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:36:52:245	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:36:53:052	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 12:36:53:053	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@13b9e884

2017-05-11 12:36:53:053	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:36:53:986	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 12:36:53:986	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@13b9e884

2017-05-11 12:36:53:987	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:36:54:791	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 8

2017-05-11 12:36:54:792	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@13b9e884

2017-05-11 12:36:54:817	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:36:55:984	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 10

2017-05-11 12:36:56:005	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@13b9e884

2017-05-11 12:36:56:006	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:36:56:876	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 12:36:56:876	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@13b9e884

2017-05-11 12:36:56:879	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:36:57:612	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 14

2017-05-11 12:36:57:630	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@13b9e884

2017-05-11 12:36:57:630	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:36:58:546	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 16

2017-05-11 12:36:58:552	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@13b9e884

2017-05-11 12:36:58:552	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:36:59:173	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$AbstractionStrategyAdjuster.adjustConditions	Adjusting abstraction strategy to NEVER

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

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

2017-05-11 12:37:01:106	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:37:01:130	INFO	ParallelAlgorithm.handleFutureResults	/lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/invariantGeneration-no-out.properties finished without usable result.

2017-05-11 12:37:08:571	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:37:13:098	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 12:37:13:099	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:37:13:111	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:37:13:112	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:37:13:124	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:37:18:385	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:37:22:956	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 12:37:22:957	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:37:22:963	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:37:22:964	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:37:22:978	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:37:28:578	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:37:33:365	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 12:37:33:366	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:37:33:372	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:37:33:372	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:37:33:390	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:37:40:054	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:37:44:685	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 12:37:44:686	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:37:44:692	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:37:44:693	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:37:44:715	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:37:50:725	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:37:55:822	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 6

2017-05-11 12:37:55:823	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:37:55:828	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:37:55:829	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:37:55:851	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:38:04:867	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:38:10:572	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 7

2017-05-11 12:38:10:573	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:38:10:902	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:38:11:041	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

2017-05-11 12:38:11:672	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:38:12:293	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found but identified as infeasible.

2017-05-11 12:38:12:293	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found, starting counterexample check with CBMC.

2017-05-11 12:38:12:515	INFO	Parallel analysis 1:CounterexampleCheckAlgorithm.checkCounterexample	Error path found and confirmed by counterexample check with CBMC.

2017-05-11 12:38:12:517	INFO	ParallelAlgorithm.handleFutureResults	/lustre/work/anon/anon/cfc/analyzers/cpachecker/config/components/kInduction/svcomp16-kInduction.properties finished successfully.

2017-05-11 12:38:12:521	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:            2 (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:         2 (100%)
  Times precision was empty:       2 (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:         436
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

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

Total number of created targets for pointer analysis: 74
   Number of created targets for uf: *signed_int is 73
   Number of created targets for uf: *_Bool is 3



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

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

Bounds CPA statistics
---------------------
Bound k:                                           7
Maximum loop iteration reached:                    8


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                  11172 (count: 1643, min: 0, max: 10, avg: 6.80)
Number of global variables:                            6558 (count: 1643, min: 0, max: 5, avg: 3.99)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                    1866
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.016s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                16

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                  606
Number of deterministic Assumptions:                     48
Level of Determinism:                              8%

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:                         1866 (count: 1868, min: 0, max: 1, avg: 1.00) [0 x 2, 1 x 1866]

CPA algorithm statistics
------------------------
Number of iterations:            1655
Max size of waitlist:            87
Average size of waitlist:        42
Number of computed successors:   1866
Max successors for one state:    2
Number of times merged:          218
Number of times stopped:         218
Number of times breaked:         0

Total time for CPA algorithm:         1.106s (Max:     0.750s)
  Time for choose from waitlist:      0.004s
  Time for precision adjustment:      0.049s
  Time for transfer relation:         0.983s
  Time for merge operator:            0.030s
  Time for stop operator:             0.004s
  Time for adding to reached set:     0.008s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           1.136s
Time for final sat check:                0.140s
Time for error path creation:            0.566s
Time for bounding assertions check:      0.093s
Time for induction formula creation:    48.849s
Time for induction check:               29.313s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         1 (100%)
Time for counterexample checks:         0.843s
Time for running CBMC:                  0.731s


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.199s
Automaton transfers with branching:                0
Automaton transfer successors:                         3013 (count: 3081, min: 0, max: 1, avg: 0.98) [0 x 68, 1 x 3013]

CPA algorithm statistics
------------------------
Number of iterations:            2675
Max size of waitlist:            9
Average size of waitlist:        3
Number of computed successors:   3013
Max successors for one state:    2
Number of times merged:          841
Number of times stopped:         1129
Number of times breaked:         0

Total time for CPA algorithm:         8.883s (Max:     1.770s)
  Time for choose from waitlist:      0.056s
  Time for precision adjustment:      0.258s
  Time for transfer relation:         4.940s
  Time for merge operator:            3.116s
  Time for stop operator:             0.244s
  Time for adding to reached set:     0.053s


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

Code Coverage
-----------------------------
  Function coverage:      0.750
  Visited lines:          22
  Total lines:            25
  Line coverage:          0.880
  Visited conditions:     29
  Total conditions:       44
  Condition coverage:     0.659

CPAchecker general statistics
-----------------------------
Number of program locations:     119
Number of CFA edges:             139
Number of relevant variables:    24
Number of functions:             4
Number of loops:                 4
Size of reached set:             1643
  Number of reached locations:   95 (80%)
    Avg states per location:     17
    Max states per location:     96 (at node N71)
  Number of reached functions:   3 (75%)
  Number of partitions:          1643
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       2

Time for analysis setup:          2.721s
  Time for loading CPAs:          0.868s
  Time for loading parser:        0.689s
  Time for CFA construction:      1.066s
    Time for parsing file(s):     0.321s
    Time for AST to CFA:          0.379s
    Time for CFA sanity check:    0.038s
    Time for post-processing:     0.260s
      Time for var class.:        0.170s
    Time for CFA export:          0.331s
Time for Analysis:               83.184s
CPU time for analysis:          112.110s
Time for analyzing result:        0.001s
Total time for CPAchecker:       85.921s
Total CPU time for CPAchecker:  116.600s
Time for statistics:              0.935s

Time for Garbage Collector:       4.369s (in 39 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                433MB (   413 MiB) max;    214MB (   204 MiB) avg;    455MB (   434 MiB) peak
Used non-heap memory:             50MB (    48 MiB) max;     46MB (    44 MiB) avg;     54MB (    52 MiB) peak
Used in PS Old Gen pool:          32MB (    30 MiB) max;     20MB (    19 MiB) avg;     32MB (    30 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    977MB (   932 MiB) avg
Allocated non-heap memory:        52MB (    49 MiB) max;     48MB (    46 MiB) avg
Total process virtual memory:   6598MB (  6292 MiB) max;   6385MB (  6090 MiB) avg

    
analysis.programNames = /lustre/work/anon/anon/cfc/benchmarks/sv_subset_falsified_by_cpa_or_ua_transform/scripts/analysis_logs/trex01_false-unreach-call_true-termination/trex01_false-unreach-call_true-termination.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/trex01_false-unreach-call_true-termination/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