scripts/cpa.sh -heap 50000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -timelimit 900s -stats -spec test/programs/benchmarks/bitvector/ALL.prp test/programs/benchmarks/bitvector/num_conversion_1_true-unreach-call.i -------------------------------------------------------------------------------- Running CPAchecker with Java heap of size 50000M. Using the following resource limits: CPU-time limit of 900s (ResourceLimitChecker.fromConfiguration, INFO) CPAchecker 1.4-svn (OpenJDK 64-Bit Server VM 1.7.0_65) started (CPAchecker.run, INFO) Using predicate analysis with SMTInterpol 2.1-174-ga199d47-comp and JFactory 1.21. (PredicateCPA:PredicateCPA., INFO) Using refinement for predicate analysis with PredicateAbstractionRefinementStrategy strategy. (PredicateCPA:PredicateCPARefiner., INFO) Starting analysis ... (CPAchecker.runAlgorithm, INFO) Error path found, starting counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Using the following resource limits: CPU-time limit of 900s (CounterexampleCheck:ResourceLimitChecker.fromConfiguration, INFO) Error path found, but identified as infeasible by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Infeasible counterexample found, but could not remove it from the ARG. Therefore, we cannot prove safety. (CounterexampleCheckAlgorithm.checkCounterexample, WARNING) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) Analysis incomplete: no errors found, but not everything could be checked. (CPAchecker.analyzeResult, WARNING) PredicateCPA statistics ----------------------- Number of abstractions: 47 (7% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 47 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 2 (4%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 45 (96%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 46 Times result was 'false': 36 (78%) Number of coverage checks: 203 BDD entailment checks: 129 Number of SMT sat checks: 46 trivial: 0 cached: 1 Max ABE block size: 5 Number of predicates discovered: 10 Number of abstraction locations: 2 Max number of predicates per location: 8 Avg number of predicates per location: 5 Total predicates per abstraction: 248 Max number of predicates per abstraction: 8 Avg number of predicates per abstraction: 5.51 Number of irrelevant predicates: 0 (0%) Number of preds handled by boolean abs: 248 (100%) Total number of models for allsat: 175 Max number of models for allsat: 9 Avg number of models for allsat: 3.89 Number of path formula cache hits: 597 (73%) Time for post operator: 0.092s Time for path formula creation: 0.082s Actual computation: 0.094s Time for strengthen operator: 0.133s Time for satisfiability checks: 0.129s Time for prec operator: 0.573s Time for abstraction: 0.572s (Max: 0.020s, Count: 47) Boolean abstraction: 0.347s Solving time: 0.058s (Max: 0.003s) Model enumeration time: 0.184s Time for BDD construction: 0.020s (Max: 0.003s) Time for merge operator: 0.006s Time for coverage check: 0.006s Time for BDD entailment checks: 0.006s Total time for SMT solver (w/o itp): 0.370s Number of BDD nodes: 897 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 536, min: 0, max: 0, avg: 0,00) Time for BDD node cleanup: 0.001s Time for BDD garbage collection: 0.000s (in 0 runs) PrecisionBootstrap statistics ----------------------------- Init. function predicates: 0 Init. global predicates: 0 Init. location predicates: 0 AutomatonAnalysis (SVCOMP) statistics ------------------------------------- Number of states: 1 Total time for successor computation: 0.028s Automaton transfers with branching: 0 Automaton transfer successors: 1018 (count: 1018, min: 1, max: 1, avg: 1,00) [1 x 1018] CPA algorithm statistics ------------------------ Number of iterations: 584 Max size of waitlist: 3 Average size of waitlist: 1 Number of computed successors: 640 Max successors for one state: 2 Number of times merged: 37 Number of times stopped: 38 Number of times breaked: 10 Total time for CPA algorithm: 0.980s (Max: 0.172s) Time for choose from waitlist: 0.008s Time for precision adjustment: 0.600s Time for transfer relation: 0.298s Time for merge operator: 0.010s Time for stop operator: 0.018s Time for adding to reached set: 0.016s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 56 (count: 10, min: 2, max: 10, avg: 5,60) Time for refinement: 0.306s Counterexample analysis: 0.201s (Max: 0.068s, Calls: 10) Refinement sat check: 0.112s Interpolant computation: 0.041s Error path post-processing: 0.070s Path-formulas extraction: 0.000s Building the counterexample trace: 0.201s Extracting precise counterexample: 0.070s Predicate creation: 0.004s Precision update: 0.003s ARG update: 0.015s Length of refined path (in blocks): 44 (count: 8, min: 2, max: 9, avg: 5,50) Number of affected states: 36 (count: 8, min: 1, max: 8, avg: 4,50) Length (states) of path with itp 'true': 0 (count: 8, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 36 (count: 8, min: 1, max: 8, avg: 4,50) Length (states) of path with itp 'false': 0 (count: 8, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 28 (count: 8, min: 0, max: 7, avg: 3,50) Equal non-trivial interpolants along paths: 0 (count: 8, min: 0, max: 0, avg: 0,00) Different precisions along paths: 0 (count: 0, min: 0, max: 0, avg: 0,00) Equal precisions along paths: 0 (count: 0, min: 0, max: 0, avg: 0,00) Number of refs with location-based cutoff: 0 CEGAR algorithm statistics -------------------------- Number of refinements: 10 Number of successful refinements: 9 Number of failed refinements: 0 Max. size of reached set before ref.: 123 Max. size of reached set after ref.: 2 Avg. size of reached set before ref.: 61.40 Avg. size of reached set after ref.: 1.89 Total time for CEGAR algorithm: 1.297s Time for refinements: 0.316s Average time for refinement: 0.031s Max time for refinement: 0.139s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 1 (100%) Time for counterexample checks: 0.167s CPAchecker general statistics ----------------------------- Number of program locations: 17 Number of functions: 2 Number of loops: 1 Size of reached set: 127 Number of reached locations: 16 (94%) Avg states per location: 7 Max states per location: 9 (at node N0) Number of reached functions: 2 (100%) Number of partitions: 119 Avg size of partitions: 1 Max size of partitions: 9 (with key [N17 (before line 21), Function main called from node N9, stack depth 1 [3726c255], stack [main], Init]) Number of target states: 0 Time for analysis setup: 1.422s Time for loading CPAs: 0.559s Time for loading parser: 0.334s Time for CFA construction: 0.437s Time for parsing file(s): 0.186s Time for AST to CFA: 0.157s Time for CFA sanity check: 0.000s Time for post-processing: 0.071s Time for var class.: 0.000s Time for Analysis: 1.464s CPU time for analysis: 2.400s Total time for CPAchecker: 2.888s Total CPU time for CPAchecker: 4.440s Time for Garbage Collector: 0.000s (in 0 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 222MB ( 212 MiB) max; 134MB ( 128 MiB) avg; 222MB ( 212 MiB) peak Used non-heap memory: 21MB ( 20 MiB) max; 17MB ( 16 MiB) avg; 22MB ( 21 MiB) peak Used in PS Old Gen pool: 0MB ( 0 MiB) max; 0MB ( 0 MiB) avg; 0MB ( 0 MiB) peak Allocated heap memory: 2024MB ( 1930 MiB) max; 2024MB ( 1930 MiB) avg Allocated non-heap memory: 24MB ( 23 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 57123MB ( 54476 MiB) max; 57057MB ( 54414 MiB) avg Verification result: UNKNOWN, incomplete analysis. More details about the verification run can be found in the directory "./output".