scripts/cpa.sh -heap 3000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -timelimit 900s -stats -spec test/programs/benchmarks/ssh-simplified/ALL.prp test/programs/benchmarks/ssh-simplified/s3_srvr_1a_true-unreach-call.cil.c -------------------------------------------------------------------------------- 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) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 60 (1% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 60 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 2 (3%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 58 (97%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 48 Times result was 'false': 44 (92%) Number of coverage checks: 3709 BDD entailment checks: 739 Number of SMT sat checks: 48 trivial: 0 cached: 0 Max ABE block size: 18 Number of predicates discovered: 24 Number of abstraction locations: 2 Max number of predicates per location: 23 Avg number of predicates per location: 13 Total predicates per abstraction: 1021 Max number of predicates per abstraction: 23 Avg number of predicates per abstraction: 17.60 Number of irrelevant predicates: 1 (0%) Number of preds handled by boolean abs: 1020 (100%) Total number of models for allsat: 370 Max number of models for allsat: 15 Avg number of models for allsat: 6.38 Number of path formula cache hits: 2803 (39%) Time for post operator: 0.802s Time for path formula creation: 0.752s Actual computation: 0.708s Time for strengthen operator: 0.109s Time for satisfiability checks: 0.094s Time for prec operator: 2.163s Time for abstraction: 2.160s (Max: 0.094s, Count: 60) Boolean abstraction: 1.159s Solving time: 0.119s (Max: 0.018s) Model enumeration time: 0.691s Time for BDD construction: 0.125s (Max: 0.025s) Time for merge operator: 0.125s Time for coverage check: 0.023s Time for BDD entailment checks: 0.021s Total time for SMT solver (w/o itp): 0.904s Number of BDD nodes: 6644 Size of BDD node table: 10007 Size of BDD node cleanup queue: 3866 (count: 2666, min: 0, max: 3648, avg: 1,45) Time for BDD node cleanup: 0.002s 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.089s Automaton transfers with branching: 0 Automaton transfer successors: 9749 (count: 9749, min: 1, max: 1, avg: 1,00) [1 x 9749] CPA algorithm statistics ------------------------ Number of iterations: 5002 Max size of waitlist: 121 Average size of waitlist: 47 Number of computed successors: 6517 Max successors for one state: 2 Number of times merged: 1485 Number of times stopped: 1490 Number of times breaked: 4 Total time for CPA algorithm: 4.390s (Max: 2.602s) Time for choose from waitlist: 0.038s Time for precision adjustment: 2.243s Time for transfer relation: 1.330s Time for merge operator: 0.322s Time for stop operator: 0.100s Time for adding to reached set: 0.105s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 16 (count: 4, min: 2, max: 6, avg: 4,00) Time for refinement: 0.547s Counterexample analysis: 0.501s (Max: 0.295s, Calls: 4) Refinement sat check: 0.140s Interpolant computation: 0.356s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.501s Extracting precise counterexample: 0.000s Predicate creation: 0.002s Precision update: 0.003s ARG update: 0.027s Length of refined path (in blocks): 14 (count: 3, min: 3, max: 6, avg: 4,67) Number of affected states: 11 (count: 3, min: 2, max: 5, avg: 3,67) Length (states) of path with itp 'true': 0 (count: 3, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 11 (count: 3, min: 2, max: 5, avg: 3,67) Length (states) of path with itp 'false': 0 (count: 3, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 8 (count: 3, min: 1, max: 4, avg: 2,67) Equal non-trivial interpolants along paths: 0 (count: 3, 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: 4 Number of successful refinements: 4 Number of failed refinements: 0 Max. size of reached set before ref.: 830 Max. size of reached set after ref.: 10 Avg. size of reached set before ref.: 443.25 Avg. size of reached set after ref.: 7.75 Total time for CEGAR algorithm: 4.942s Time for refinements: 0.551s Average time for refinement: 0.137s Max time for refinement: 0.312s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 102 Number of functions: 1 Number of loops: 1 Size of reached set: 3286 Number of reached locations: 101 (99%) Avg states per location: 32 Max states per location: 36 (at node N0) Number of reached functions: 1 (100%) Number of partitions: 3251 Avg size of partitions: 1 Max size of partitions: 36 (with key [N18 (before lines 23-212), Function main called from node N1, stack depth 1 [4c9b7ca4], stack [main], Init]) Number of target states: 0 Time for analysis setup: 1.248s Time for loading CPAs: 0.277s Time for loading parser: 0.471s Time for CFA construction: 0.464s Time for parsing file(s): 0.282s Time for AST to CFA: 0.078s Time for CFA sanity check: 0.000s Time for post-processing: 0.055s Time for var class.: 0.000s Time for Analysis: 4.945s CPU time for analysis: 4.940s Total time for CPAchecker: 6.194s Total CPU time for CPAchecker: 6.190s Time for Garbage Collector: 0.107s (in 2 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 148MB ( 141 MiB) max; 78MB ( 75 MiB) avg; 149MB ( 142 MiB) peak Used non-heap memory: 22MB ( 21 MiB) max; 19MB ( 18 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: 637MB ( 607 MiB) max; 508MB ( 485 MiB) avg Allocated non-heap memory: 24MB ( 23 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 4899MB ( 4672 MiB) max; 4899MB ( 4672 MiB) avg Verification result: TRUE. No property violation found by chosen configuration. More details about the verification run can be found in the directory "./output".