scripts/cpa.sh -heap 50000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -setprop cpa.predicate.handlePointerAliasing=false -64 -timelimit 900s -stats -spec test/programs/benchmarks/ldv-linux-3.4-simple/ALL.prp test/programs/benchmarks/ldv-linux-3.4-simple/32_1_cilled_true-unreach-call_ok_nondet_linux-3.4-32_1-drivers--mtd--ftl.ko-ldv_main0_sequence_infinite_withcheck_stateful.cil.out.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) Handling of pointer aliasing is disabled, analysis is unsound if aliased pointers exist. (PredicateCPA:PathFormulaManagerImpl., WARNING) 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) The following configuration options were specified but are not used: cpa.predicate.memoryAllocationsAlwaysSucceed cpa.predicate.maxPreFilledAllocationSize (CPAchecker.printConfigurationWarnings, WARNING) Starting analysis ... (CPAchecker.runAlgorithm, INFO) Assuming external function ldv_initialize to be a constant function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function register_mtd_blktrans to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function del_mtd_blktrans_dev to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function vfree to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Program contains array, or pointer (multiple level of indirection), or field (enable handleFieldAccess and handleFieldAliasing) access; analysis is imprecise in case of aliasing. (PredicateCPA:CtoFormulaConverter.makeVariableUnsafe, WARNING) Assuming external function mtd_read to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function vmalloc to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function memset to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function add_mtd_blktrans_dev to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __dynamic_pr_debug to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function mtd_write to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) line 3683: Ignoring call via function pointer mtd_sync::__cil_tmp6 for which no suitable target was found in line: (*__cil_tmp6)(mtd); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 3683: Ignoring function call through function pointer *__cil_tmp6: (*__cil_tmp6)(mtd); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Assuming external function mtd_erase to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function deregister_mtd_blktrans to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 126 (3% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 126 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 63 (50%) Times precision was {false}: 0 (0%) Times result was cached: 1 (1%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 62 (49%) Times result was 'false': 4 (3%) Number of strengthen sat checks: 4 Times result was 'false': 3 (75%) Number of coverage checks: 744 BDD entailment checks: 84 Number of SMT sat checks: 4 trivial: 0 cached: 1 Max ABE block size: 84 Number of predicates discovered: 2 Number of abstraction locations: 0 Max number of predicates per location: 0 Avg number of predicates per location: 0 Total predicates per abstraction: 124 Max number of predicates per abstraction: 2 Avg number of predicates per abstraction: 2.00 Number of irrelevant predicates: 0 (0%) Number of preds handled by boolean abs: 124 (100%) Total number of models for allsat: 58 Max number of models for allsat: 1 Avg number of models for allsat: 0.94 Number of path formula cache hits: 2059 (53%) Time for post operator: 0.488s Time for path formula creation: 0.455s Actual computation: 0.435s Time for strengthen operator: 0.034s Time for satisfiability checks: 0.023s Time for prec operator: 2.648s Time for abstraction: 2.640s (Max: 0.568s, Count: 126) Boolean abstraction: 1.369s Solving time: 1.233s (Max: 0.456s) Model enumeration time: 0.107s Time for BDD construction: 0.005s (Max: 0.001s) Time for merge operator: 0.267s Time for coverage check: 0.003s Time for BDD entailment checks: 0.002s Total time for SMT solver (w/o itp): 1.363s Number of BDD nodes: 203 Size of BDD node table: 10007 Size of BDD node cleanup queue: 40 (count: 402, min: 0, max: 40, avg: 0,10) 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.128s Automaton transfers with branching: 0 Automaton transfer successors: 15721 (count: 15721, min: 1, max: 1, avg: 1,00) [1 x 15721] CPA algorithm statistics ------------------------ Number of iterations: 3249 Max size of waitlist: 29 Average size of waitlist: 18 Number of computed successors: 3664 Max successors for one state: 2 Number of times merged: 330 Number of times stopped: 414 Number of times breaked: 1 Total time for CPA algorithm: 4.016s (Max: 2.519s) Time for choose from waitlist: 0.025s Time for precision adjustment: 2.718s Time for transfer relation: 0.827s Time for merge operator: 0.298s Time for stop operator: 0.027s Time for adding to reached set: 0.038s 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.059s Counterexample analysis: 0.017s (Max: 0.017s, Calls: 1) Refinement sat check: 0.013s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.017s Extracting precise counterexample: 0.000s 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: 1 Number of failed refinements: 0 Max. size of reached set before ref.: 1623 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 1623.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 4.093s Time for refinements: 0.076s Average time for refinement: 0.076s Max time for refinement: 0.076s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 939 Number of functions: 35 Number of loops: 19 Size of reached set: 1629 Number of reached locations: 869 (93%) Avg states per location: 1 Max states per location: 33 (at node N4173) Number of reached functions: 27 (77%) Number of partitions: 1629 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 3.252s Time for loading CPAs: 0.688s Time for loading parser: 0.346s Time for CFA construction: 2.111s Time for parsing file(s): 0.696s Time for AST to CFA: 0.847s Time for CFA sanity check: 0.000s Time for post-processing: 0.433s Time for var class.: 0.000s Time for Analysis: 4.096s CPU time for analysis: 10.270s Total time for CPAchecker: 7.349s Total CPU time for CPAchecker: 15.540s Time for Garbage Collector: 0.044s (in 1 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 529MB ( 504 MiB) max; 250MB ( 239 MiB) avg; 570MB ( 544 MiB) peak Used non-heap memory: 25MB ( 24 MiB) max; 19MB ( 18 MiB) avg; 25MB ( 24 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: 26MB ( 25 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 57054MB ( 54411 MiB) max; 57054MB ( 54411 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".