scripts/cpa.sh -heap 50000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -timelimit 900s -stats -spec test/programs/benchmarks/ntdrivers-simplified/ALL.prp test/programs/benchmarks/ntdrivers-simplified/floppy_simpl4_false-unreach-call_true-termination.cil.c -------------------------------------------------------------------------------- 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 and confirmed by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 6 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 6 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 2 (33%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 4 (67%) Times result was 'false': 1 (17%) Number of strengthen sat checks: 97 Times result was 'false': 94 (97%) Number of coverage checks: 648 BDD entailment checks: 2 Number of SMT sat checks: 97 trivial: 0 cached: 37 Max ABE block size: 133 Number of predicates discovered: 14 Number of abstraction locations: 2 Max number of predicates per location: 11 Avg number of predicates per location: 9 Total predicates per abstraction: 34 Max number of predicates per abstraction: 11 Avg number of predicates per abstraction: 8.50 Number of irrelevant predicates: 0 (0%) Number of preds handled by boolean abs: 34 (100%) Total number of models for allsat: 5 Max number of models for allsat: 2 Avg number of models for allsat: 1.25 Number of path formula cache hits: 1507 (40%) Time for post operator: 0.365s Time for path formula creation: 0.342s Actual computation: 0.342s Time for strengthen operator: 1.353s Time for satisfiability checks: 1.341s Time for prec operator: 0.239s Time for abstraction: 0.238s (Max: 0.130s, Count: 6) Boolean abstraction: 0.163s Solving time: 0.047s (Max: 0.029s) Model enumeration time: 0.108s Time for BDD construction: 0.001s (Max: 0.001s) Time for merge operator: 0.096s Time for coverage check: 0.001s Time for BDD entailment checks: 0.001s Total time for SMT solver (w/o itp): 1.493s Number of BDD nodes: 248 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 70, 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.093s Automaton transfers with branching: 0 Automaton transfer successors: 5082 (count: 5082, min: 1, max: 1, avg: 1,00) [1 x 5082] CPA algorithm statistics ------------------------ Number of iterations: 2812 Max size of waitlist: 24 Average size of waitlist: 13 Number of computed successors: 3167 Max successors for one state: 2 Number of times merged: 323 Number of times stopped: 325 Number of times breaked: 3 Total time for CPA algorithm: 2.556s (Max: 1.268s) Time for choose from waitlist: 0.020s Time for precision adjustment: 0.296s Time for transfer relation: 1.961s Time for merge operator: 0.122s Time for stop operator: 0.026s Time for adding to reached set: 0.054s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 5 (count: 3, min: 1, max: 2, avg: 1,67) Time for refinement: 0.547s Counterexample analysis: 0.417s (Max: 0.183s, Calls: 3) Refinement sat check: 0.207s Interpolant computation: 0.109s Error path post-processing: 0.093s Path-formulas extraction: 0.000s Building the counterexample trace: 0.417s Extracting precise counterexample: 0.093s Predicate creation: 0.001s Precision update: 0.002s ARG update: 0.001s Length of refined path (in blocks): 2 (count: 1, min: 2, max: 2, avg: 2,00) Number of affected states: 1 (count: 1, min: 1, max: 1, avg: 1,00) Length (states) of path with itp 'true': 0 (count: 1, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 1 (count: 1, min: 1, max: 1, avg: 1,00) Length (states) of path with itp 'false': 0 (count: 1, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 0 (count: 1, min: 0, max: 0, avg: 0,00) Equal non-trivial interpolants along paths: 0 (count: 1, 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: 3 Number of successful refinements: 2 Number of failed refinements: 0 Max. size of reached set before ref.: 1644 Max. size of reached set after ref.: 1530 Avg. size of reached set before ref.: 1458.00 Avg. size of reached set after ref.: 765.50 Total time for CEGAR algorithm: 3.114s Time for refinements: 0.558s Average time for refinement: 0.186s Max time for refinement: 0.278s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 0 (0%) Time for counterexample checks: 0.507s CPAchecker general statistics ----------------------------- Number of program locations: 741 Number of functions: 28 Number of loops: 1 Size of reached set: 1644 Number of reached locations: 715 (96%) Avg states per location: 2 Max states per location: 56 (at node N1377) Number of reached functions: 27 (96%) Number of partitions: 1644 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 1 Size of final wait list 14 Time for analysis setup: 2.119s Time for loading CPAs: 0.707s Time for loading parser: 0.334s Time for CFA construction: 0.964s Time for parsing file(s): 0.287s Time for AST to CFA: 0.383s Time for CFA sanity check: 0.000s Time for post-processing: 0.219s Time for var class.: 0.000s Time for Analysis: 3.621s CPU time for analysis: 8.720s Total time for CPAchecker: 5.743s Total CPU time for CPAchecker: 11.620s Time for Garbage Collector: 0.000s (in 0 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 435MB ( 415 MiB) max; 211MB ( 202 MiB) avg; 435MB ( 415 MiB) peak Used non-heap memory: 24MB ( 23 MiB) max; 19MB ( 18 MiB) avg; 25MB ( 23 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: 25MB ( 24 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 57123MB ( 54476 MiB) max; 57059MB ( 54416 MiB) avg Verification result: FALSE. Property violation (__VERIFIER_error(); called in line 2163) found by chosen configuration. More details about the verification run can be found in the directory "./output".