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

Generated on 2017-05-11 12:34:08 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_12 = 1; unsigned int INPUTS_at_12[1]; int input_at_12_counter = 0;int initialize_reads() {  for (int instrumentation_index=0; instrumentation_index<1; instrumentation_index++) INPUTS_at_12[instrumentation_index] = __VERIFIER_nondet_uint();}extern void __VERIFIER_assume(int);extern void __VERIFIER_error() __attribute__ ((__noreturn__));  
2
  
3
void __VERIFIER_assert(int cond) {  
4
  if (!(cond != 0)) {  
5
    __VERIFIER_assume(!((0 < 1 + INPUTS_at_12[0]- 1)));__VERIFIER_error();  
6
  }  
7
  return;  
8
}  
9
  
10
extern unsigned int __VERIFIER_nondet_uint();  
11
int main() {initialize_reads();  
12
  int i, n=__VERIFIER_nondet_uint(), sn=0;  
13
  for(i=1; i<=n; i++) {  
14
    sn = sn + (2);  
15
    if (i==4)   
16
      sn=-10;  
17
  }  
18
  if (!(sn==n*(2) || sn == 0)) {  
19
  __VERIFIER_assume(!((0 < 1 + INPUTS_at_12[0]- 1)));__VERIFIER_error();  
20
}  
21
}  
2017-05-11 12:33:58:690	INFO	ResourceLimitChecker.fromConfiguration	Using the following resource limits: CPU-time limit of 900s

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

2017-05-11 12:34:00:677	INFO	CPAchecker.runAlgorithm	Starting analysis ...

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

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

2017-05-11 12:34:00:929	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:34:01:404	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:34:01:505	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:34:01:593	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:34:01:744	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:34:01:746	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:34:01:755	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:34:01:763	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:34:01:902	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:34:02:122	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 1

2017-05-11 12:34:02:123	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b248c2

2017-05-11 12:34:02:124	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:34:02:236	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:34:02:297	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 2

2017-05-11 12:34:02:297	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b248c2

2017-05-11 12:34:02:303	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:34:02:330	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:34:02:389	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:34:02:545	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 3

2017-05-11 12:34:02:546	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b248c2

2017-05-11 12:34:02:546	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:34:02:815	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 4

2017-05-11 12:34:02:816	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b248c2

2017-05-11 12:34:02:816	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:34:03:053	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$InterestingVariableLimitAdjuster.adjustConditions	Adjusting interestingVariableLimit to 6

2017-05-11 12:34:03:054	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b248c2

2017-05-11 12:34:03:054	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:34:03:601	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$FormulaDepthAdjuster.adjustConditions	Adjusting maximum formula depth to 3

2017-05-11 12:34:03:609	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b248c2

2017-05-11 12:34:03:609	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

2017-05-11 12:34:03:818	INFO	Parallel analysis 2:InvariantsCPA:InvariantsCPA$AbstractionStrategyAdjuster.adjustConditions	Adjusting abstraction strategy to NEVER

2017-05-11 12:34:03:843	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Adjusting precision for CPA org.sosy_lab.cpachecker.cpa.invariants.InvariantsCPA@3b248c2

2017-05-11 12:34:03:844	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Updating reached set provided to other analyses

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

2017-05-11 12:34:05:483	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 2

2017-05-11 12:34:05:484	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:34:05:721	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:34:05:723	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:34:05:725	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:34:06:813	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:34:06:954	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 3

2017-05-11 12:34:06:954	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:34:06:969	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:34:06:971	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:34:06:973	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:34:07:308	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:34:07:377	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 4

2017-05-11 12:34:07:378	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:34:07:395	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:34:07:397	INFO	Parallel analysis 1:AbstractBMCAlgorithm.checkBoundingAssertions	Starting assertions check...

2017-05-11 12:34:07:404	INFO	Parallel analysis 1:KInductionProver.check	Running algorithm to create induction hypothesis

2017-05-11 12:34:07:509	INFO	Parallel analysis 1:KInductionProver.check	Starting induction check...

2017-05-11 12:34:07:610	INFO	Parallel analysis 1:BoundsCPA:BoundsCPA.adjustPrecision	Adjusting maxLoopIterations to 5

2017-05-11 12:34:07:610	INFO	Parallel analysis 1:AbstractBMCAlgorithm.run	Creating formula for program

2017-05-11 12:34:07:686	INFO	Parallel analysis 1:AbstractBMCAlgorithm.boundedModelCheck	Starting satisfiability check...

2017-05-11 12:34:07:688	INFO	Parallel analysis 1:BMCAlgorithm.analyzeCounterexample	Error found, creating error path

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

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

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

2017-05-11 12:34:08:105	INFO	Parallel analysis 2:ParallelAlgorithm.runParallelAnalysis	Analysis was terminated

2017-05-11 12:34:08:106	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 (3% 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:         2
  BDD entailment checks:           0
Number of SMT sat checks:          0
  trivial:                         0
  cached:                          0

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

Time for post operator:                  0.424s
  Time for path formula creation:        0.423s
Time for strengthen operator:            0.004s
Time for prec operator:                  0.002s
  Time for abstraction:                  0.000s (Max:     0.000s, 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.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: 2
   Number of created targets for uf: *unsigned_int is 3



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

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

Bounds CPA statistics
---------------------
Bound k:                                           5
Maximum loop iteration reached:                    6


ValueAnalysisCPA statistics
---------------------------
Number of variables:                                    293 (count: 89, min: 0, max: 4, avg: 3.29)
Number of global variables:                             172 (count: 89, min: 0, max: 2, avg: 1.93)

ValueAnalysisPrecisionAdjustment statistics
-------------------------------------------
Number of abstraction computations:                      96
Total time for liveness abstraction:                   0.000s
Total time for abstraction computation:                0.008s
Total time for path thresholds:                        0.000s
Number of tracked memory locations:                5

ValueAnalysisTransferRelation statistics
----------------------------------------
Number of Assumptions:                                   52
Number of deterministic Assumptions:                     24
Level of Determinism:                              46%

ConstraintsStrengthenOperator statistics
----------------------------------------
Total time for strengthening by ConstraintsCPA:     0.000s
Replaced symbolic expressions: 0

AutomatonAnalysis (SVCOMP) statistics
-------------------------------------
Number of states:                                  1
Total time for successor computation:                  0.002s
Automaton transfers with branching:                0
Automaton transfer successors:                           96 (count: 100, min: 0, max: 1, avg: 0.96) [0 x 4, 1 x 96]

CPA algorithm statistics
------------------------
Number of iterations:            100
Max size of waitlist:            4
Average size of waitlist:        1
Number of computed successors:   96
Max successors for one state:    2
Number of times merged:          1
Number of times stopped:         1
Number of times breaked:         0

Total time for CPA algorithm:         0.668s (Max:     0.327s)
  Time for choose from waitlist:      0.001s
  Time for precision adjustment:      0.018s
  Time for transfer relation:         0.580s
  Time for merge operator:            0.028s
  Time for stop operator:             0.001s
  Time for adding to reached set:     0.007s

BMC algorithm statistics
------------------------
Time for BMC formula creation:           0.673s
Time for final sat check:                0.005s
Time for error path creation:            0.161s
Time for bounding assertions check:      0.007s
Time for induction formula creation:     3.869s
Time for induction check:                1.008s

Counterexample-Check Algorithm statistics
-----------------------------------------
Number of counterexample checks:    1
Number of infeasible paths:         0 (0%)
Time for counterexample checks:         0.247s
Time for running CBMC:                  0.225s


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.125s
Automaton transfers with branching:                0
Automaton transfer successors:                         2143 (count: 2293, min: 0, max: 1, avg: 0.93) [0 x 150, 1 x 2143]

CPA algorithm statistics
------------------------
Number of iterations:            1893
Max size of waitlist:            4
Average size of waitlist:        1
Number of computed successors:   2143
Max successors for one state:    2
Number of times merged:          276
Number of times stopped:         528
Number of times breaked:         0

Total time for CPA algorithm:         6.073s (Max:     4.219s)
  Time for choose from waitlist:      0.026s
  Time for precision adjustment:      0.142s
  Time for transfer relation:         1.831s
  Time for merge operator:            3.256s
  Time for stop operator:             0.748s
  Time for adding to reached set:     0.026s


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

Code Coverage
-----------------------------
  Function coverage:      0.667
  Visited lines:          9
  Total lines:            12
  Line coverage:          0.750
  Visited conditions:     12
  Total conditions:       16
  Condition coverage:     0.750

CPAchecker general statistics
-----------------------------
Number of program locations:     50
Number of CFA edges:             55
Number of relevant variables:    7
Number of functions:             3
Number of loops:                 2
Size of reached set:             89
  Number of reached locations:   42 (84%)
    Avg states per location:     2
    Max states per location:     6 (at node N26)
  Number of reached functions:   2 (67%)
  Number of partitions:          89
    Avg size of partitions:      1
    Max size of partitions:      1
  Number of target states:       1

Time for analysis setup:          1.845s
  Time for loading CPAs:          0.380s
  Time for loading parser:        0.534s
  Time for CFA construction:      0.854s
    Time for parsing file(s):     0.248s
    Time for AST to CFA:          0.303s
    Time for CFA sanity check:    0.023s
    Time for post-processing:     0.217s
      Time for var class.:        0.134s
    Time for CFA export:          0.108s
Time for Analysis:                7.427s
CPU time for analysis:           25.760s
Time for analyzing result:        0.000s
Total time for CPAchecker:        9.286s
Total CPU time for CPAchecker:   29.380s
Time for statistics:              0.460s

Time for Garbage Collector:       0.380s (in 4 runs)
Garbage Collector(s) used:    PS MarkSweep, PS Scavenge
Used heap memory:                334MB (   318 MiB) max;    146MB (   139 MiB) avg;    352MB (   336 MiB) peak
Used non-heap memory:             46MB (    44 MiB) max;     37MB (    35 MiB) avg;     50MB (    48 MiB) peak
Used in PS Old Gen pool:          18MB (    17 MiB) max;     13MB (    13 MiB) avg;     18MB (    17 MiB) peak
Allocated heap memory:          1205MB (  1150 MiB) max;    980MB (   935 MiB) avg
Allocated non-heap memory:        48MB (    46 MiB) max;     38MB (    36 MiB) avg
Total process virtual memory:   8299MB (  7915 MiB) max;   7970MB (  7601 MiB) avg

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