scripts/cpa.sh -heap 3000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -timelimit 900s -stats -spec test/programs/benchmarks/bitvector/ALL.prp test/programs/benchmarks/bitvector/parity_true-unreach-call.i -------------------------------------------------------------------------------- Running CPAchecker with Java heap of size 3000M. 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: 2 (8% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 2 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) 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: 1 Times result was 'false': 0 (0%) Number of coverage checks: 5 BDD entailment checks: 1 Number of SMT sat checks: 1 trivial: 0 cached: 0 Max ABE block size: 4 Number of predicates discovered: 0 Number of path formula cache hits: 2 (4%) Time for post operator: 0.032s Time for path formula creation: 0.032s Actual computation: 0.036s Time for strengthen operator: 0.030s Time for satisfiability checks: 0.030s Time for prec operator: 0.013s Time for abstraction: 0.013s (Max: 0.012s, 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.002s Time for coverage check: 0.001s Time for BDD entailment checks: 0.001s Total time for SMT solver (w/o itp): 0.030s Number of BDD nodes: 202 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 5, min: 0, max: 0, avg: 0,00) Time for BDD node cleanup: 0.000s 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.003s Automaton transfers with branching: 0 Automaton transfer successors: 56 (count: 56, min: 1, max: 1, avg: 1,00) [1 x 56] CPA algorithm statistics ------------------------ Number of iterations: 22 Max size of waitlist: 3 Average size of waitlist: 1 Number of computed successors: 25 Max successors for one state: 2 Number of times merged: 2 Number of times stopped: 3 Number of times breaked: 1 Total time for CPA algorithm: 0.093s (Max: 0.085s) Time for choose from waitlist: 0.000s Time for precision adjustment: 0.014s Time for transfer relation: 0.071s Time for merge operator: 0.004s Time for stop operator: 0.001s Time for adding to reached set: 0.001s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 2 (count: 1, min: 2, max: 2, avg: 2,00) Time for refinement: 0.068s Counterexample analysis: 0.029s (Max: 0.029s, Calls: 1) Refinement sat check: 0.010s Interpolant computation: 0.000s Error path post-processing: 0.038s Path-formulas extraction: 0.000s Building the counterexample trace: 0.029s Extracting precise counterexample: 0.038s Predicate creation: 0.000s Precision update: 0.000s ARG update: 0.000s Length of refined path (in blocks): 0 (count: 0, min: 0, max: 0, avg: 0,00) Number of affected states: 0 (count: 0, min: 0, max: 0, avg: 0,00) Length (states) of path with itp 'true': 0 (count: 0, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 0 (count: 0, min: 0, max: 0, avg: 0,00) Length (states) of path with itp 'false': 0 (count: 0, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 0 (count: 0, min: 0, max: 0, avg: 0,00) Equal non-trivial interpolants along paths: 0 (count: 0, 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: 1 Number of successful refinements: 0 Number of failed refinements: 0 Max. size of reached set before ref.: 17 Max. size of reached set after ref.: 0 Avg. size of reached set before ref.: 17.00 Avg. size of reached set after ref.: NaN Total time for CEGAR algorithm: 0.167s Time for refinements: 0.073s Average time for refinement: 0.073s Max time for refinement: 0.073s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 1 (100%) Time for counterexample checks: 0.163s CPAchecker general statistics ----------------------------- Number of program locations: 23 Number of functions: 2 Number of loops: 1 Size of reached set: 21 Number of reached locations: 21 (91%) Avg states per location: 1 Max states per location: 1 (at node N0) Number of reached functions: 2 (100%) Number of partitions: 21 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 1.764s Time for loading CPAs: 0.416s Time for loading parser: 0.711s Time for CFA construction: 0.583s Time for parsing file(s): 0.413s Time for AST to CFA: 0.087s Time for CFA sanity check: 0.000s Time for post-processing: 0.053s Time for var class.: 0.000s Time for Analysis: 0.330s CPU time for analysis: 0.330s Total time for CPAchecker: 2.095s Total CPU time for CPAchecker: 2.100s Time for Garbage Collector: 0.000s (in 0 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 112MB ( 107 MiB) max; 59MB ( 56 MiB) avg; 114MB ( 109 MiB) peak Used non-heap memory: 20MB ( 20 MiB) max; 13MB ( 12 MiB) avg; 21MB ( 20 MiB) peak Used in PS Old Gen pool: 0MB ( 0 MiB) max; 0MB ( 0 MiB) avg; 0MB ( 0 MiB) peak Allocated heap memory: 504MB ( 481 MiB) max; 504MB ( 481 MiB) avg Allocated non-heap memory: 24MB ( 23 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 4967MB ( 4737 MiB) max; 4905MB ( 4678 MiB) avg Verification result: UNKNOWN, incomplete analysis. More details about the verification run can be found in the directory "./output".