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--usb--serial--ssu100.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) line 4445: Dead code detected: Goto: case_1 (CFACreationUtils.addEdgeToCFA, INFO) line 4450: Dead code detected: Goto: case_2 (CFACreationUtils.addEdgeToCFA, INFO) line 4455: Dead code detected: Goto: case_4 (CFACreationUtils.addEdgeToCFA, INFO) line 4464: Dead code detected: Goto: switch_default (CFACreationUtils.addEdgeToCFA, INFO) Dead code detected: Label case_2 is not reachable. (CFAFunctionBuilder.leave, INFO) Dead code detected: Label case_1 is not reachable. (CFAFunctionBuilder.leave, INFO) Dead code detected: Label switch_default is not reachable. (CFAFunctionBuilder.leave, INFO) Dead code detected: Label case_4 is not reachable. (CFAFunctionBuilder.leave, 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 tty_get_baud_rate to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_control_msg to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dev_get_drvdata to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function _raw_spin_lock_irqsave to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function _raw_spin_unlock_irqrestore to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function prepare_to_wait to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function schedule to be a constant function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function finish_wait 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 __might_sleep to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function _copy_to_user to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function tty_port_tty_get to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_serial_handle_break to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __wake_up to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_serial_handle_sysrq_char to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function tty_insert_flip_string_fixed_flag to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function tty_flip_buffer_push to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function tty_kref_put 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 __raw_spin_lock_init to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __init_waitqueue_head 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_serial_generic_close to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_serial_generic_open 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: 20 (1% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 20 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 8 (40%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 12 (60%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 4 Times result was 'false': 3 (75%) Number of coverage checks: 614 BDD entailment checks: 12 Number of SMT sat checks: 4 trivial: 0 cached: 0 Max ABE block size: 140 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: 24 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: 24 (100%) Total number of models for allsat: 12 Max number of models for allsat: 1 Avg number of models for allsat: 1.00 Number of path formula cache hits: 1252 (40%) Time for post operator: 0.623s Time for path formula creation: 0.563s Actual computation: 0.533s Time for strengthen operator: 0.193s Time for satisfiability checks: 0.176s Time for prec operator: 3.402s Time for abstraction: 3.398s (Max: 2.447s, Count: 20) Boolean abstraction: 1.710s Solving time: 1.566s (Max: 1.335s) Model enumeration time: 0.123s Time for BDD construction: 0.006s (Max: 0.004s) Time for merge operator: 1.077s Time for coverage check: 0.002s Time for BDD entailment checks: 0.002s Total time for SMT solver (w/o itp): 1.865s Number of BDD nodes: 203 Size of BDD node table: 10007 Size of BDD node cleanup queue: 16 (count: 75, min: 0, max: 16, avg: 0,21) 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.068s Automaton transfers with branching: 0 Automaton transfer successors: 9413 (count: 9413, min: 1, max: 1, avg: 1,00) [1 x 9413] CPA algorithm statistics ------------------------ Number of iterations: 2707 Max size of waitlist: 25 Average size of waitlist: 13 Number of computed successors: 3029 Max successors for one state: 2 Number of times merged: 301 Number of times stopped: 313 Number of times breaked: 1 Total time for CPA algorithm: 6.006s (Max: 4.557s) Time for choose from waitlist: 0.065s Time for precision adjustment: 3.481s Time for transfer relation: 1.158s Time for merge operator: 1.119s Time for stop operator: 0.016s Time for adding to reached set: 0.094s 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.076s Counterexample analysis: 0.024s (Max: 0.024s, Calls: 1) Refinement sat check: 0.014s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.024s 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.: 1009 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 1009.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 6.110s Time for refinements: 0.096s Average time for refinement: 0.096s Max time for refinement: 0.096s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 1109 Number of functions: 52 Number of loops: 4 Size of reached set: 1709 Number of reached locations: 1041 (94%) Avg states per location: 1 Max states per location: 26 (at node N248) Number of reached functions: 44 (85%) Number of partitions: 1709 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 4.127s Time for loading CPAs: 0.719s Time for loading parser: 0.608s Time for CFA construction: 2.745s Time for parsing file(s): 1.231s Time for AST to CFA: 0.867s Time for CFA sanity check: 0.000s Time for post-processing: 0.402s Time for var class.: 0.000s Time for Analysis: 6.113s CPU time for analysis: 6.110s Total time for CPAchecker: 10.242s Total CPU time for CPAchecker: 10.240s Time for Garbage Collector: 0.190s (in 2 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 175MB ( 167 MiB) max; 99MB ( 94 MiB) avg; 178MB ( 170 MiB) peak Used non-heap memory: 23MB ( 22 MiB) max; 18MB ( 18 MiB) avg; 23MB ( 22 MiB) peak Used in PS Old Gen pool: 1MB ( 1 MiB) max; 0MB ( 0 MiB) avg; 1MB ( 1 MiB) peak Allocated heap memory: 637MB ( 607 MiB) max; 546MB ( 521 MiB) avg Allocated non-heap memory: 25MB ( 24 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 4900MB ( 4673 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".