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_7_cilled_false-unreach-call_const_ok_linux-32_1-drivers--usb--image--microtek.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) Inline assembler ignored, analysis is probably unsound! (CFABuilder.createCFA, WARNING) 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) 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 ldv_initialize to be a constant function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function blk_queue_dma_alignment to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_lock_device_for_reset to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_reset_device to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, 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) Dereferencing of a non-pointer in expression *(srb) (org.eclipse.cdt.internal.core.dom.parser.ProblemType@156f50d7: Type depends on an unresolved name) (CounterexampleCheck:ASTConverter.convert, WARNING) Error path found and confirmed by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 1 (1% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 1 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (100%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 0 (0%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 1 Times result was 'false': 0 (0%) Number of coverage checks: 6 BDD entailment checks: 0 Number of SMT sat checks: 1 trivial: 0 cached: 0 Max ABE block size: 2 Number of predicates discovered: 0 Number of path formula cache hits: 1 (0%) Time for post operator: 0.026s Time for path formula creation: 0.024s Actual computation: 0.059s Time for strengthen operator: 0.028s Time for satisfiability checks: 0.028s Time for prec operator: 0.004s Time for abstraction: 0.004s (Max: 0.004s, Count: 1) Solving time: 0.000s (Max: 0.000s) Model enumeration time: 0.000s Time for BDD construction: 0.000s (Max: 0.000s) Time for merge operator: 0.003s Time for coverage check: 0.000s Total time for SMT solver (w/o itp): 0.028s Number of BDD nodes: 202 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 3, 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.009s Automaton transfers with branching: 0 Automaton transfer successors: 907 (count: 907, min: 1, max: 1, avg: 1,00) [1 x 907] CPA algorithm statistics ------------------------ Number of iterations: 67 Max size of waitlist: 8 Average size of waitlist: 5 Number of computed successors: 77 Max successors for one state: 2 Number of times merged: 3 Number of times stopped: 3 Number of times breaked: 1 Total time for CPA algorithm: 0.088s (Max: 0.088s) Time for choose from waitlist: 0.001s Time for precision adjustment: 0.004s Time for transfer relation: 0.071s Time for merge operator: 0.004s Time for stop operator: 0.001s Time for adding to reached set: 0.002s 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.234s Counterexample analysis: 0.040s (Max: 0.040s, Calls: 1) Refinement sat check: 0.015s Interpolant computation: 0.000s Error path post-processing: 0.193s Path-formulas extraction: 0.000s Building the counterexample trace: 0.040s Extracting precise counterexample: 0.193s 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: 0 Number of failed refinements: 0 Max. size of reached set before ref.: 75 Max. size of reached set after ref.: 0 Avg. size of reached set before ref.: 75.00 Avg. size of reached set after ref.: NaN Total time for CEGAR algorithm: 0.325s Time for refinements: 0.237s Average time for refinement: 0.237s Max time for refinement: 0.237s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 0 (0%) Time for counterexample checks: 0.279s CPAchecker general statistics ----------------------------- Number of program locations: 711 Number of functions: 51 Number of loops: 2 Size of reached set: 75 Number of reached locations: 75 (11%) Avg states per location: 1 Max states per location: 1 (at node N33) Number of reached functions: 8 (16%) Number of partitions: 75 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 1 Size of final wait list 8 Time for analysis setup: 2.669s Time for loading CPAs: 0.442s Time for loading parser: 0.484s Time for CFA construction: 1.706s Time for parsing file(s): 0.776s Time for AST to CFA: 0.539s Time for CFA sanity check: 0.000s Time for post-processing: 0.246s Time for var class.: 0.000s Time for Analysis: 0.605s CPU time for analysis: 0.600s Total time for CPAchecker: 3.274s Total CPU time for CPAchecker: 3.270s Time for Garbage Collector: 0.034s (in 1 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 131MB ( 125 MiB) max; 74MB ( 70 MiB) avg; 152MB ( 145 MiB) peak Used non-heap memory: 22MB ( 21 MiB) max; 15MB ( 14 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: 504MB ( 481 MiB) max; 504MB ( 481 MiB) avg Allocated non-heap memory: 24MB ( 23 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 4967MB ( 4737 MiB) max; 4905MB ( 4678 MiB) avg Verification result: FALSE. Property violation (__VERIFIER_error(); called in line 9014) found by chosen configuration. More details about the verification run can be found in the directory "./output".