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/43_1a_cilled_true-unreach-call_ok_nondet_linux-43_1a-drivers--gpio--gpio-mc33880.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) Dead code detected: Label switch_break is not reachable. (CFAFunctionBuilder.leave, 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 spi_register_driver 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 spi_setup to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __mutex_init 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 memset to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __list_add to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function spi_sync to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function gpiochip_add to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function mutex_destroy 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 ldv_check_return_value to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function driver_unregister to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function ldv_check_final_state to be a constant function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 3 (1% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 3 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (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: 2 (67%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 2 Times result was 'false': 1 (50%) Number of coverage checks: 31 BDD entailment checks: 1 Number of SMT sat checks: 2 trivial: 0 cached: 0 Max ABE block size: 77 Number of predicates discovered: 3 Number of abstraction locations: 0 Max number of predicates per location: 0 Avg number of predicates per location: 0 Total predicates per abstraction: 2 Max number of predicates per abstraction: 1 Avg number of predicates per abstraction: 1.00 Number of irrelevant predicates: 0 (0%) Number of preds handled by boolean abs: 2 (100%) Total number of models for allsat: 2 Max number of models for allsat: 1 Avg number of models for allsat: 1.00 Number of path formula cache hits: 62 (23%) Time for post operator: 0.066s Time for path formula creation: 0.065s Actual computation: 0.066s Time for strengthen operator: 0.023s Time for satisfiability checks: 0.022s Time for prec operator: 0.227s Time for abstraction: 0.227s (Max: 0.221s, Count: 3) Boolean abstraction: 0.084s Solving time: 0.068s (Max: 0.067s) Model enumeration time: 0.014s Time for BDD construction: 0.001s (Max: 0.001s) Time for merge operator: 0.158s Time for coverage check: 0.000s Time for BDD entailment checks: 0.000s Total time for SMT solver (w/o itp): 0.104s Number of BDD nodes: 202 Size of BDD node table: 10007 Size of BDD node cleanup queue: 4 (count: 16, min: 0, max: 4, avg: 0,25) Time for BDD node cleanup: 0.001s 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.021s Automaton transfers with branching: 0 Automaton transfer successors: 1571 (count: 1571, min: 1, max: 1, avg: 1,00) [1 x 1571] CPA algorithm statistics ------------------------ Number of iterations: 238 Max size of waitlist: 11 Average size of waitlist: 6 Number of computed successors: 262 Max successors for one state: 2 Number of times merged: 15 Number of times stopped: 16 Number of times breaked: 1 Total time for CPA algorithm: 0.541s (Max: 0.479s) Time for choose from waitlist: 0.000s Time for precision adjustment: 0.232s Time for transfer relation: 0.136s Time for merge operator: 0.161s Time for stop operator: 0.003s Time for adding to reached set: 0.005s 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.010s Counterexample analysis: 0.006s (Max: 0.006s, Calls: 1) Refinement sat check: 0.006s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.006s 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.: 60 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 60.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 0.555s Time for refinements: 0.014s Average time for refinement: 0.014s Max time for refinement: 0.014s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 230 Number of functions: 23 Number of loops: 1 Size of reached set: 188 Number of reached locations: 153 (67%) Avg states per location: 1 Max states per location: 2 (at node N0) Number of reached functions: 14 (61%) Number of partitions: 188 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 1.780s Time for loading CPAs: 0.338s Time for loading parser: 0.476s Time for CFA construction: 0.929s Time for parsing file(s): 0.483s Time for AST to CFA: 0.241s Time for CFA sanity check: 0.000s Time for post-processing: 0.089s Time for var class.: 0.000s Time for Analysis: 0.556s CPU time for analysis: 0.560s Total time for CPAchecker: 2.337s Total CPU time for CPAchecker: 2.330s Time for Garbage Collector: 0.073s (in 1 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 129MB ( 123 MiB) max; 64MB ( 61 MiB) avg; 151MB ( 144 MiB) peak Used non-heap memory: 20MB ( 20 MiB) max; 14MB ( 13 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: 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".