java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 01:45:16,397 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 01:45:16,398 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 01:45:16,411 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 01:45:16,411 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 01:45:16,411 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 01:45:16,412 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 01:45:16,414 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 01:45:16,415 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 01:45:16,416 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 01:45:16,417 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 01:45:16,417 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 01:45:16,418 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 01:45:16,419 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 01:45:16,420 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 01:45:16,421 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 01:45:16,423 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 01:45:16,424 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 01:45:16,425 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 01:45:16,426 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 01:45:16,428 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 01:45:16,429 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 01:45:16,429 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 01:45:16,430 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 01:45:16,430 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 01:45:16,431 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 01:45:16,431 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 01:45:16,432 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 01:45:16,432 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 01:45:16,432 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 01:45:16,433 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 01:45:16,433 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 01:45:16,442 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 01:45:16,442 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 01:45:16,443 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 01:45:16,443 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 01:45:16,443 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 01:45:16,444 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 01:45:16,444 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 01:45:16,444 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 01:45:16,444 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 01:45:16,444 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 01:45:16,444 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 01:45:16,444 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 01:45:16,444 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 01:45:16,444 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 01:45:16,444 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 01:45:16,445 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 01:45:16,445 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 01:45:16,445 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 01:45:16,445 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 01:45:16,445 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 01:45:16,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:45:16,445 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 01:45:16,445 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 01:45:16,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 01:45:16,483 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 01:45:16,486 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 01:45:16,487 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 01:45:16,487 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 01:45:16,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:45:16,615 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 01:45:16,616 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 01:45:16,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 01:45:16,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 01:45:16,621 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 01:45:16,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:45:16" (1/1) ... [2018-02-04 01:45:16,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1bdbed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:16, skipping insertion in model container [2018-02-04 01:45:16,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:45:16" (1/1) ... [2018-02-04 01:45:16,634 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:45:16,661 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 01:45:16,744 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:45:16,757 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 01:45:16,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:16 WrapperNode [2018-02-04 01:45:16,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 01:45:16,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 01:45:16,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 01:45:16,763 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 01:45:16,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:16" (1/1) ... [2018-02-04 01:45:16,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:16" (1/1) ... [2018-02-04 01:45:16,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:16" (1/1) ... [2018-02-04 01:45:16,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:16" (1/1) ... [2018-02-04 01:45:16,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:16" (1/1) ... [2018-02-04 01:45:16,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:16" (1/1) ... [2018-02-04 01:45:16,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:16" (1/1) ... [2018-02-04 01:45:16,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 01:45:16,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 01:45:16,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 01:45:16,791 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 01:45:16,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:16" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 01:45:16,825 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 01:45:16,825 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 01:45:16,825 INFO L136 BoogieDeclarations]: Found implementation of procedure insertionSort [2018-02-04 01:45:16,825 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 01:45:16,825 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 01:45:16,826 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 01:45:16,826 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 01:45:16,826 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 01:45:16,826 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 01:45:16,826 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 01:45:16,826 INFO L128 BoogieDeclarations]: Found specification of procedure insertionSort [2018-02-04 01:45:16,826 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 01:45:16,826 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 01:45:16,826 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 01:45:16,977 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 01:45:16,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:45:16 BoogieIcfgContainer [2018-02-04 01:45:16,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 01:45:16,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 01:45:16,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 01:45:16,980 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 01:45:16,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:45:16" (1/3) ... [2018-02-04 01:45:16,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d9ad24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:45:16, skipping insertion in model container [2018-02-04 01:45:16,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:45:16" (2/3) ... [2018-02-04 01:45:16,982 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d9ad24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:45:16, skipping insertion in model container [2018-02-04 01:45:16,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:45:16" (3/3) ... [2018-02-04 01:45:16,983 INFO L107 eAbstractionObserver]: Analyzing ICFG insertionsort-alloca_true-valid-memsafety_true-termination.i [2018-02-04 01:45:16,990 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 01:45:16,996 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-02-04 01:45:17,028 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 01:45:17,028 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 01:45:17,029 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 01:45:17,029 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 01:45:17,029 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 01:45:17,029 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 01:45:17,029 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 01:45:17,029 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 01:45:17,030 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 01:45:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-02-04 01:45:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:45:17,047 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:17,048 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:17,048 INFO L371 AbstractCegarLoop]: === Iteration 1 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:17,051 INFO L82 PathProgramCache]: Analyzing trace with hash 243546787, now seen corresponding path program 1 times [2018-02-04 01:45:17,084 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:17,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:17,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:17,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:17,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:45:17,185 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:17,185 INFO L182 omatonBuilderFactory]: Interpolants [49#true, 50#false, 51#(= 1 (select |#valid| |main_#t~malloc9.base|)), 52#(= 1 (select |#valid| main_~a~0.base)), 53#(= 1 (select |#valid| |insertionSort_#in~a.base|)), 54#(= 1 (select |#valid| insertionSort_~a.base))] [2018-02-04 01:45:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:17,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:45:17,194 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:45:17,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:45:17,195 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 6 states. [2018-02-04 01:45:17,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:17,313 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-02-04 01:45:17,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 01:45:17,314 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-04 01:45:17,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:17,320 INFO L225 Difference]: With dead ends: 41 [2018-02-04 01:45:17,320 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 01:45:17,322 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:17,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 01:45:17,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-02-04 01:45:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 01:45:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-02-04 01:45:17,385 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 14 [2018-02-04 01:45:17,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:17,385 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-02-04 01:45:17,385 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:45:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-02-04 01:45:17,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 01:45:17,385 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:17,385 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:17,385 INFO L371 AbstractCegarLoop]: === Iteration 2 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:17,386 INFO L82 PathProgramCache]: Analyzing trace with hash 243546788, now seen corresponding path program 1 times [2018-02-04 01:45:17,387 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:17,401 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:17,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:17,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 01:45:17,505 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:17,505 INFO L182 omatonBuilderFactory]: Interpolants [144#(and (= insertionSort_~i~0 1) (<= (+ (* 4 insertionSort_~i~0) 4) (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0)), 138#true, 139#false, 140#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|)), 141#(and (= (* 4 main_~array_size~0) (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset)), 142#(and (<= (* 4 |insertionSort_#in~array_size|) (select |#length| |insertionSort_#in~a.base|)) (= 0 |insertionSort_#in~a.offset|)), 143#(and (= insertionSort_~i~0 1) (= insertionSort_~a.offset 0) (<= (* 4 insertionSort_~array_size) (select |#length| insertionSort_~a.base)))] [2018-02-04 01:45:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:17,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 01:45:17,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 01:45:17,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 01:45:17,507 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 7 states. [2018-02-04 01:45:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:17,644 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-02-04 01:45:17,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:45:17,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-04 01:45:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:17,646 INFO L225 Difference]: With dead ends: 59 [2018-02-04 01:45:17,646 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 01:45:17,647 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:45:17,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 01:45:17,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2018-02-04 01:45:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 01:45:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 01:45:17,650 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 14 [2018-02-04 01:45:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:17,650 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 01:45:17,650 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 01:45:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 01:45:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 01:45:17,650 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:17,650 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:17,650 INFO L371 AbstractCegarLoop]: === Iteration 3 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:17,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1724462409, now seen corresponding path program 1 times [2018-02-04 01:45:17,652 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:17,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:17,731 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:17,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:45:17,731 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:17,732 INFO L182 omatonBuilderFactory]: Interpolants [256#(and (= insertionSort_~a.offset 0) (= 1 insertionSort_~i~0)), 257#(and (<= 4 (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0) (= 1 insertionSort_~i~0)), 258#(and (= insertionSort_~j~0 1) (<= 4 (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0)), 251#true, 252#false, 253#(= 0 |main_#t~malloc9.offset|), 254#(= 0 main_~a~0.offset), 255#(= 0 |insertionSort_#in~a.offset|)] [2018-02-04 01:45:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:17,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:45:17,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:45:17,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:17,733 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-02-04 01:45:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:17,873 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-02-04 01:45:17,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 01:45:17,875 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-02-04 01:45:17,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:17,876 INFO L225 Difference]: With dead ends: 79 [2018-02-04 01:45:17,876 INFO L226 Difference]: Without dead ends: 79 [2018-02-04 01:45:17,877 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:45:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-02-04 01:45:17,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 48. [2018-02-04 01:45:17,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 01:45:17,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-02-04 01:45:17,882 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 18 [2018-02-04 01:45:17,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:17,882 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-02-04 01:45:17,882 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:45:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-02-04 01:45:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:45:17,883 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:17,883 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:17,883 INFO L371 AbstractCegarLoop]: === Iteration 4 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:17,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1435415779, now seen corresponding path program 1 times [2018-02-04 01:45:17,884 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:17,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:17,935 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:17,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 01:45:17,935 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:17,936 INFO L182 omatonBuilderFactory]: Interpolants [396#true, 397#false, 398#(= |#valid| |old(#valid)|), 399#(= (store |#valid| |main_#t~malloc9.base| 0) |old(#valid)|)] [2018-02-04 01:45:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:17,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 01:45:17,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 01:45:17,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 01:45:17,936 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 4 states. [2018-02-04 01:45:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:17,983 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-02-04 01:45:17,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 01:45:17,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-04 01:45:17,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:17,985 INFO L225 Difference]: With dead ends: 47 [2018-02-04 01:45:17,985 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 01:45:17,985 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:45:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 01:45:17,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-04 01:45:17,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 01:45:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-02-04 01:45:17,988 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 19 [2018-02-04 01:45:17,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:17,988 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-02-04 01:45:17,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 01:45:17,989 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-02-04 01:45:17,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 01:45:17,989 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:17,989 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:17,989 INFO L371 AbstractCegarLoop]: === Iteration 5 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:17,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1918733159, now seen corresponding path program 1 times [2018-02-04 01:45:17,990 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:17,998 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:18,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 01:45:18,032 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,032 INFO L182 omatonBuilderFactory]: Interpolants [490#true, 491#false, 492#(= 1 insertionSort_~i~0), 493#(= insertionSort_~j~0 1), 494#|insertionSort_#t~short4|] [2018-02-04 01:45:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 01:45:18,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 01:45:18,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 01:45:18,033 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-02-04 01:45:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:18,095 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-02-04 01:45:18,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 01:45:18,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-02-04 01:45:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:18,096 INFO L225 Difference]: With dead ends: 68 [2018-02-04 01:45:18,097 INFO L226 Difference]: Without dead ends: 68 [2018-02-04 01:45:18,097 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-04 01:45:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 41. [2018-02-04 01:45:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-04 01:45:18,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-04 01:45:18,100 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 19 [2018-02-04 01:45:18,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:18,101 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-04 01:45:18,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 01:45:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-04 01:45:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 01:45:18,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:18,101 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:18,102 INFO L371 AbstractCegarLoop]: === Iteration 6 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:18,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1355765508, now seen corresponding path program 1 times [2018-02-04 01:45:18,102 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:18,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:18,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 01:45:18,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 01:45:18,176 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,177 INFO L182 omatonBuilderFactory]: Interpolants [610#true, 611#false, 612#(= 0 |main_#t~malloc9.offset|), 613#(= 0 main_~a~0.offset), 614#(= 0 |insertionSort_#in~a.offset|), 615#(and (= insertionSort_~a.offset 0) (= 1 insertionSort_~i~0)), 616#(and (<= (+ (* 4 insertionSort_~i~0) insertionSort_~a.offset 4) (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0) (= 1 insertionSort_~i~0)), 617#(and (= insertionSort_~j~0 1) (= insertionSort_~a.offset 0) (<= (+ insertionSort_~a.offset 8) (select |#length| insertionSort_~a.base)))] [2018-02-04 01:45:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,177 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 01:45:18,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 01:45:18,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-04 01:45:18,178 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-02-04 01:45:18,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:18,279 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-02-04 01:45:18,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:45:18,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-02-04 01:45:18,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:18,280 INFO L225 Difference]: With dead ends: 66 [2018-02-04 01:45:18,280 INFO L226 Difference]: Without dead ends: 66 [2018-02-04 01:45:18,280 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-02-04 01:45:18,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-04 01:45:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 43. [2018-02-04 01:45:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-04 01:45:18,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-02-04 01:45:18,283 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 21 [2018-02-04 01:45:18,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:18,284 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-02-04 01:45:18,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 01:45:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-02-04 01:45:18,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 01:45:18,284 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:18,284 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:18,285 INFO L371 AbstractCegarLoop]: === Iteration 7 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:18,285 INFO L82 PathProgramCache]: Analyzing trace with hash 461327576, now seen corresponding path program 1 times [2018-02-04 01:45:18,285 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:18,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,385 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:18,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 01:45:18,385 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,385 INFO L182 omatonBuilderFactory]: Interpolants [737#true, 738#false, 739#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|)), 740#(and (= (* 4 main_~array_size~0) (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset)), 741#(and (<= (* 4 |insertionSort_#in~array_size|) (select |#length| |insertionSort_#in~a.base|)) (= 0 |insertionSort_#in~a.offset|)), 742#(and (= insertionSort_~a.offset 0) (<= (* 4 insertionSort_~array_size) (select |#length| insertionSort_~a.base))), 743#(and (<= 0 (+ (* 4 insertionSort_~i~0) insertionSort_~a.offset)) (= insertionSort_~a.offset 0) (<= (* 4 insertionSort_~array_size) (select |#length| insertionSort_~a.base))), 744#(and (= insertionSort_~a.offset 0) (<= 4 (+ (* 4 insertionSort_~i~0) insertionSort_~a.offset)) (<= (* 4 insertionSort_~array_size) (select |#length| insertionSort_~a.base))), 745#(and (<= (+ (* 4 insertionSort_~i~0) 4) (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0) (<= 4 (+ (* 4 insertionSort_~i~0) insertionSort_~a.offset)))] [2018-02-04 01:45:18,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,386 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:45:18,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:45:18,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:45:18,386 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-02-04 01:45:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:18,476 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-02-04 01:45:18,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 01:45:18,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-02-04 01:45:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:18,477 INFO L225 Difference]: With dead ends: 42 [2018-02-04 01:45:18,478 INFO L226 Difference]: Without dead ends: 42 [2018-02-04 01:45:18,478 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:45:18,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-04 01:45:18,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-04 01:45:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 01:45:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-02-04 01:45:18,481 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 25 [2018-02-04 01:45:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:18,481 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-02-04 01:45:18,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:45:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-02-04 01:45:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 01:45:18,482 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:18,482 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:18,482 INFO L371 AbstractCegarLoop]: === Iteration 8 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:18,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2040783234, now seen corresponding path program 1 times [2018-02-04 01:45:18,483 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:18,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:18,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 01:45:18,524 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,524 INFO L182 omatonBuilderFactory]: Interpolants [836#true, 837#false, 838#(= 1 insertionSort_~i~0), 839#(= insertionSort_~j~0 1), 840#(<= insertionSort_~j~0 0), 841#(not |insertionSort_#t~short4|)] [2018-02-04 01:45:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 01:45:18,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 01:45:18,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 01:45:18,525 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 6 states. [2018-02-04 01:45:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:18,573 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-02-04 01:45:18,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:45:18,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-02-04 01:45:18,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:18,574 INFO L225 Difference]: With dead ends: 60 [2018-02-04 01:45:18,574 INFO L226 Difference]: Without dead ends: 60 [2018-02-04 01:45:18,574 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:45:18,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-04 01:45:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 47. [2018-02-04 01:45:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 01:45:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-04 01:45:18,576 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 27 [2018-02-04 01:45:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:18,577 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-04 01:45:18,577 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 01:45:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-04 01:45:18,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 01:45:18,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:18,577 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:18,577 INFO L371 AbstractCegarLoop]: === Iteration 9 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:18,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1160223154, now seen corresponding path program 1 times [2018-02-04 01:45:18,578 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:18,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:18,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,688 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:18,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 01:45:18,689 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,689 INFO L182 omatonBuilderFactory]: Interpolants [960#(and (<= 4 (select |#length| |insertionSort_#in~a.base|)) (= 0 |insertionSort_#in~a.offset|)), 961#(and (<= 4 (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0) (= 1 insertionSort_~i~0)), 962#(and (= insertionSort_~j~0 1) (<= 4 (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0)), 963#(and (<= 0 insertionSort_~j~0) (<= 4 (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0)), 964#(and (<= 0 insertionSort_~j~0) (= insertionSort_~a.offset 0) (or |insertionSort_#t~short4| (<= (+ (* 4 insertionSort_~j~0) 4) (select |#length| insertionSort_~a.base)))), 965#(and (<= 0 insertionSort_~j~0) (= insertionSort_~a.offset 0) (<= (+ (* 4 insertionSort_~j~0) 4) (select |#length| insertionSort_~a.base))), 955#true, 956#false, 957#(<= 1 main_~array_size~0), 958#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|) (<= 1 main_~array_size~0)), 959#(and (= (* 4 main_~array_size~0) (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset) (<= 1 main_~array_size~0))] [2018-02-04 01:45:18,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,689 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:45:18,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:45:18,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:45:18,690 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2018-02-04 01:45:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:18,837 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-02-04 01:45:18,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:45:18,838 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-02-04 01:45:18,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:18,838 INFO L225 Difference]: With dead ends: 59 [2018-02-04 01:45:18,838 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 01:45:18,838 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:45:18,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 01:45:18,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2018-02-04 01:45:18,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 01:45:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-02-04 01:45:18,841 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 28 [2018-02-04 01:45:18,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:18,842 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-02-04 01:45:18,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:45:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-02-04 01:45:18,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 01:45:18,842 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:18,843 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:18,843 INFO L371 AbstractCegarLoop]: === Iteration 10 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:18,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2127039869, now seen corresponding path program 1 times [2018-02-04 01:45:18,844 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:18,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:18,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 01:45:18,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,921 INFO L182 omatonBuilderFactory]: Interpolants [1089#true, 1090#false, 1091#(= 0 |main_#t~malloc9.offset|), 1092#(= 0 main_~a~0.offset), 1093#(= 0 |insertionSort_#in~a.offset|), 1094#(= insertionSort_~a.offset 0), 1095#(and (<= (+ (* 4 insertionSort_~i~0) insertionSort_~a.offset 4) (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0)), 1096#(and (<= (+ (* 4 insertionSort_~i~0) insertionSort_~a.offset) (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0)), 1097#(and (<= (+ insertionSort_~a.offset (* 4 insertionSort_~j~0)) (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0)), 1098#(and (<= (+ insertionSort_~a.offset (* 4 insertionSort_~j~0)) (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0) (or (<= 1 insertionSort_~j~0) (not |insertionSort_#t~short4|))), 1099#(and (<= 1 insertionSort_~j~0) (<= (+ insertionSort_~a.offset (* 4 insertionSort_~j~0)) (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0))] [2018-02-04 01:45:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:18,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 01:45:18,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 01:45:18,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-02-04 01:45:18,922 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 11 states. [2018-02-04 01:45:19,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:19,008 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-04 01:45:19,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 01:45:19,008 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-02-04 01:45:19,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:19,009 INFO L225 Difference]: With dead ends: 54 [2018-02-04 01:45:19,009 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 01:45:19,009 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-02-04 01:45:19,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 01:45:19,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-02-04 01:45:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 01:45:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-02-04 01:45:19,011 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 29 [2018-02-04 01:45:19,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:19,011 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-02-04 01:45:19,011 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 01:45:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-02-04 01:45:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 01:45:19,011 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:19,011 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:19,011 INFO L371 AbstractCegarLoop]: === Iteration 11 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1513732531, now seen corresponding path program 1 times [2018-02-04 01:45:19,012 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:19,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:19,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:19,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 01:45:19,080 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:19,081 INFO L182 omatonBuilderFactory]: Interpolants [1216#true, 1217#false, 1218#(= 0 |main_#t~malloc9.offset|), 1219#(= 0 main_~a~0.offset), 1220#(= 0 |insertionSort_#in~a.offset|), 1221#(= insertionSort_~a.offset 0), 1222#(and (<= 0 (+ (* 4 insertionSort_~i~0) insertionSort_~a.offset)) (= insertionSort_~a.offset 0)), 1223#(and (= insertionSort_~a.offset 0) (<= 4 (+ (* 4 insertionSort_~i~0) insertionSort_~a.offset))), 1224#(and (<= 4 (+ insertionSort_~a.offset (* 4 insertionSort_~j~0))) (= insertionSort_~a.offset 0)), 1225#(and |insertionSort_#t~short4| (= insertionSort_~a.offset 0))] [2018-02-04 01:45:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:19,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 01:45:19,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 01:45:19,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-02-04 01:45:19,081 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 10 states. [2018-02-04 01:45:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:19,158 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-02-04 01:45:19,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 01:45:19,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-02-04 01:45:19,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:19,159 INFO L225 Difference]: With dead ends: 57 [2018-02-04 01:45:19,159 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 01:45:19,159 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-02-04 01:45:19,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 01:45:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2018-02-04 01:45:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 01:45:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-02-04 01:45:19,161 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 30 [2018-02-04 01:45:19,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:19,161 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-02-04 01:45:19,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 01:45:19,161 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-02-04 01:45:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 01:45:19,161 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:19,161 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:19,161 INFO L371 AbstractCegarLoop]: === Iteration 12 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:19,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1302781360, now seen corresponding path program 1 times [2018-02-04 01:45:19,162 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:19,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:45:19,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:19,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-04 01:45:19,254 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:19,254 INFO L182 omatonBuilderFactory]: Interpolants [1344#(and (= (* 4 main_~array_size~0) (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset)), 1345#(and (<= (* 4 |insertionSort_#in~array_size|) (select |#length| |insertionSort_#in~a.base|)) (= 0 |insertionSort_#in~a.offset|)), 1346#(and (= insertionSort_~a.offset 0) (<= (* 4 insertionSort_~array_size) (select |#length| insertionSort_~a.base))), 1347#(and (<= (+ (* 4 insertionSort_~i~0) 4) (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0)), 1348#(and (= insertionSort_~a.offset 0) (<= (+ (* 4 insertionSort_~j~0) 4) (select |#length| insertionSort_~a.base))), 1349#(and (<= 4 (+ insertionSort_~a.offset (* 4 insertionSort_~j~0))) (= insertionSort_~a.offset 0) (<= (+ (* 4 insertionSort_~j~0) 4) (select |#length| insertionSort_~a.base))), 1341#true, 1342#false, 1343#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|))] [2018-02-04 01:45:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 01:45:19,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 01:45:19,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 01:45:19,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 01:45:19,255 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 9 states. [2018-02-04 01:45:19,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:19,409 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-04 01:45:19,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 01:45:19,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-04 01:45:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:19,410 INFO L225 Difference]: With dead ends: 54 [2018-02-04 01:45:19,411 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 01:45:19,411 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-02-04 01:45:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 01:45:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-02-04 01:45:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 01:45:19,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-02-04 01:45:19,413 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 32 [2018-02-04 01:45:19,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:19,414 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-02-04 01:45:19,414 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 01:45:19,414 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-02-04 01:45:19,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-02-04 01:45:19,415 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 01:45:19,415 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 01:45:19,419 INFO L371 AbstractCegarLoop]: === Iteration 13 === [insertionSortErr0RequiresViolation, insertionSortErr9RequiresViolation, insertionSortErr2RequiresViolation, insertionSortErr5RequiresViolation, insertionSortErr3RequiresViolation, insertionSortErr4RequiresViolation, insertionSortErr8RequiresViolation, insertionSortErr6RequiresViolation, insertionSortErr1RequiresViolation, insertionSortErr7RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 01:45:19,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1566732926, now seen corresponding path program 1 times [2018-02-04 01:45:19,420 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 01:45:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 01:45:19,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 01:45:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 01:45:19,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 01:45:19,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 01:45:19,520 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 01:45:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 01:45:19,521 INFO L182 omatonBuilderFactory]: Interpolants [1472#(and (<= 4 (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0) (or (<= 1 insertionSort_~j~0) (not |insertionSort_#t~short4|))), 1473#(and (<= 1 insertionSort_~j~0) (<= 4 (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0)), 1474#(and (<= 0 insertionSort_~j~0) (<= 4 (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0)), 1475#(and (<= 0 insertionSort_~j~0) (= insertionSort_~a.offset 0) (or |insertionSort_#t~short4| (<= (+ (* 4 insertionSort_~j~0) 4) (select |#length| insertionSort_~a.base)))), 1476#(and (<= 0 insertionSort_~j~0) (= insertionSort_~a.offset 0) (<= (+ (* 4 insertionSort_~j~0) 4) (select |#length| insertionSort_~a.base))), 1465#true, 1466#false, 1467#(<= 1 main_~array_size~0), 1468#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc9.base|)) (= 0 |main_#t~malloc9.offset|) (<= 1 main_~array_size~0)), 1469#(and (= (* 4 main_~array_size~0) (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset) (<= 1 main_~array_size~0)), 1470#(and (<= 4 (select |#length| |insertionSort_#in~a.base|)) (= 0 |insertionSort_#in~a.offset|)), 1471#(and (<= 4 (select |#length| insertionSort_~a.base)) (= insertionSort_~a.offset 0))] [2018-02-04 01:45:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-04 01:45:19,521 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 01:45:19,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 01:45:19,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-04 01:45:19,521 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 12 states. [2018-02-04 01:45:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 01:45:19,640 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-02-04 01:45:19,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 01:45:19,640 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-02-04 01:45:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 01:45:19,641 INFO L225 Difference]: With dead ends: 58 [2018-02-04 01:45:19,641 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 01:45:19,641 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2018-02-04 01:45:19,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 01:45:19,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 01:45:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 01:45:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 01:45:19,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-02-04 01:45:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 01:45:19,642 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 01:45:19,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 01:45:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 01:45:19,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 01:45:19,646 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:45:19 BoogieIcfgContainer [2018-02-04 01:45:19,646 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 01:45:19,647 INFO L168 Benchmark]: Toolchain (without parser) took 3030.87 ms. Allocated memory was 403.7 MB in the beginning and 667.4 MB in the end (delta: 263.7 MB). Free memory was 360.4 MB in the beginning and 465.9 MB in the end (delta: -105.5 MB). Peak memory consumption was 158.2 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:19,647 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 403.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 01:45:19,648 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.98 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 349.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:19,648 INFO L168 Benchmark]: Boogie Preprocessor took 27.09 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 347.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:19,648 INFO L168 Benchmark]: RCFGBuilder took 186.78 ms. Allocated memory is still 403.7 MB. Free memory was 347.2 MB in the beginning and 330.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:19,648 INFO L168 Benchmark]: TraceAbstraction took 2668.35 ms. Allocated memory was 403.7 MB in the beginning and 667.4 MB in the end (delta: 263.7 MB). Free memory was 330.0 MB in the beginning and 465.9 MB in the end (delta: -135.9 MB). Peak memory consumption was 127.8 MB. Max. memory is 5.3 GB. [2018-02-04 01:45:19,649 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 403.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 145.98 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 349.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.09 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 347.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 186.78 ms. Allocated memory is still 403.7 MB. Free memory was 347.2 MB in the beginning and 330.0 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2668.35 ms. Allocated memory was 403.7 MB in the beginning and 667.4 MB in the end (delta: 263.7 MB). Free memory was 330.0 MB in the beginning and 465.9 MB in the end (delta: -135.9 MB). Peak memory consumption was 127.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 11 error locations. SAFE Result, 2.6s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 298 SDtfs, 1066 SDslu, 901 SDs, 0 SdLazy, 1030 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 27/50 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 147 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 56853 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 27/50 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/insertionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_01-45-19-654.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/insertionsort-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_01-45-19-654.csv Received shutdown request...