scripts/cpa.sh -heap 3000M -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--i2c--busses--i2c-diolan-u2c.ko-ldv_main0_sequence_infinite_withcheck_stateful.cil.out.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) 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 dev_get_drvdata to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function i2c_del_adapter to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dev_set_drvdata to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_put_dev to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __dynamic_dev_dbg to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_get_dev 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 snprintf to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function _dev_info to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_bulk_msg to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dev_err to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function i2c_add_adapter to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function ldv_check_return_value to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 619 (2% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 619 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 487 (79%) Times precision was {false}: 0 (0%) Times result was cached: 19 (3%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 113 (18%) Times result was 'false': 45 (7%) Number of strengthen sat checks: 8 Times result was 'false': 7 (88%) Number of coverage checks: 7936 BDD entailment checks: 304 Number of SMT sat checks: 8 trivial: 0 cached: 0 Max ABE block size: 183 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: 226 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: 226 (100%) Total number of models for allsat: 70 Max number of models for allsat: 1 Avg number of models for allsat: 0.62 Number of path formula cache hits: 30648 (70%) Time for post operator: 1.862s Time for path formula creation: 1.779s Actual computation: 1.644s Time for strengthen operator: 0.336s Time for satisfiability checks: 0.278s Time for prec operator: 15.101s Time for abstraction: 15.092s (Max: 2.014s, Count: 619) Boolean abstraction: 9.002s Solving time: 8.461s (Max: 1.761s) Model enumeration time: 0.414s Time for BDD construction: 0.002s (Max: 0.001s) Time for merge operator: 1.062s Time for coverage check: 0.015s Time for BDD entailment checks: 0.005s Total time for SMT solver (w/o itp): 9.153s Number of BDD nodes: 203 Size of BDD node table: 10007 Size of BDD node cleanup queue: 46 (count: 1250, min: 0, max: 33, avg: 0,04) 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.312s Automaton transfers with branching: 0 Automaton transfer successors: 123226 (count: 123226, min: 1, max: 1, avg: 1,00) [1 x 123226] CPA algorithm statistics ------------------------ Number of iterations: 36000 Max size of waitlist: 978 Average size of waitlist: 349 Number of computed successors: 40611 Max successors for one state: 2 Number of times merged: 3816 Number of times stopped: 4120 Number of times breaked: 1 Total time for CPA algorithm: 21.284s (Max: 15.531s) Time for choose from waitlist: 0.120s Time for precision adjustment: 15.423s Time for transfer relation: 3.314s Time for merge operator: 1.418s Time for stop operator: 0.220s Time for adding to reached set: 0.260s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 8 (count: 1, min: 8, max: 8, avg: 8,00) Time for refinement: 0.702s Counterexample analysis: 0.406s (Max: 0.406s, Calls: 1) Refinement sat check: 0.372s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.406s 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.: 32491 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 32491.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 21.996s Time for refinements: 0.712s Average time for refinement: 0.712s Max time for refinement: 0.712s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 543 Number of functions: 44 Number of loops: 4 Size of reached set: 4002 Number of reached locations: 464 (85%) Avg states per location: 8 Max states per location: 88 (at node N65) Number of reached functions: 34 (77%) Number of partitions: 4002 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 3.055s Time for loading CPAs: 0.607s Time for loading parser: 0.618s Time for CFA construction: 1.781s Time for parsing file(s): 0.785s Time for AST to CFA: 0.604s Time for CFA sanity check: 0.000s Time for post-processing: 0.222s Time for var class.: 0.000s Time for Analysis: 21.999s CPU time for analysis: 22.000s Total time for CPAchecker: 25.055s Total CPU time for CPAchecker: 25.060s Time for Garbage Collector: 0.512s (in 6 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 569MB ( 543 MiB) max; 214MB ( 204 MiB) avg; 575MB ( 549 MiB) peak Used non-heap memory: 26MB ( 25 MiB) max; 23MB ( 21 MiB) avg; 26MB ( 25 MiB) peak Used in PS Old Gen pool: 20MB ( 19 MiB) max; 12MB ( 11 MiB) avg; 20MB ( 19 MiB) peak Allocated heap memory: 1366MB ( 1303 MiB) max; 769MB ( 734 MiB) avg Allocated non-heap memory: 28MB ( 26 MiB) max; 26MB ( 24 MiB) avg Total process virtual memory: 4901MB ( 4674 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".