java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:03:09,082 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:03:09,084 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:03:09,099 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:03:09,100 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:03:09,102 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:03:09,103 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:03:09,105 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:03:09,108 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:03:09,109 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:03:09,110 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:03:09,111 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:03:09,112 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:03:09,116 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:03:09,117 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:03:09,118 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:03:09,118 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:03:09,128 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:03:09,132 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:03:09,136 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:03:09,138 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:03:09,141 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:03:09,144 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:03:09,145 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:03:09,145 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:03:09,147 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:03:09,148 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:03:09,148 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:03:09,153 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:03:09,154 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:03:09,154 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:03:09,155 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:03:09,155 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:03:09,155 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:03:09,157 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:03:09,158 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:03:09,158 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:03:09,183 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:03:09,183 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:03:09,185 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:03:09,185 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:03:09,186 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:03:09,187 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:03:09,187 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:03:09,187 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:03:09,187 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:03:09,187 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:03:09,188 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:03:09,188 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:03:09,188 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:03:09,189 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:03:09,189 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:03:09,189 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:03:09,189 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:03:09,189 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:03:09,189 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:03:09,190 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:03:09,190 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:03:09,190 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:03:09,190 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:03:09,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:03:09,192 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:03:09,192 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:03:09,192 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:03:09,192 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:03:09,193 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:03:09,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:03:09,193 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:03:09,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:03:09,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:03:09,255 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:03:09,257 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:03:09,261 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:03:09,262 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-11-23 13:03:09,322 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75c20110/facd1a89d6bb494aba4ec555f243e50d/FLAG80a9197ca [2018-11-23 13:03:09,790 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:03:09,790 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-11-23 13:03:09,796 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75c20110/facd1a89d6bb494aba4ec555f243e50d/FLAG80a9197ca [2018-11-23 13:03:10,206 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75c20110/facd1a89d6bb494aba4ec555f243e50d [2018-11-23 13:03:10,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:03:10,218 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:03:10,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:10,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:03:10,223 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:03:10,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:10" (1/1) ... [2018-11-23 13:03:10,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@542edd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:10, skipping insertion in model container [2018-11-23 13:03:10,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:10" (1/1) ... [2018-11-23 13:03:10,239 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:03:10,263 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:03:10,467 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:10,477 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:03:10,519 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:10,557 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:03:10,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:10 WrapperNode [2018-11-23 13:03:10,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:10,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:10,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:03:10,559 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:03:10,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:10" (1/1) ... [2018-11-23 13:03:10,580 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:10" (1/1) ... [2018-11-23 13:03:10,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:10,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:03:10,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:03:10,591 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:03:10,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:10" (1/1) ... [2018-11-23 13:03:10,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:10" (1/1) ... [2018-11-23 13:03:10,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:10" (1/1) ... [2018-11-23 13:03:10,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:10" (1/1) ... [2018-11-23 13:03:10,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:10" (1/1) ... [2018-11-23 13:03:10,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:10" (1/1) ... [2018-11-23 13:03:10,661 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:10" (1/1) ... [2018-11-23 13:03:10,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:03:10,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:03:10,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:03:10,669 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:03:10,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:10" (1/1) ... No working directory specified, using /storage/repos/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-11-23 13:03:10,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:03:10,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:03:10,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:03:10,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:03:10,845 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-11-23 13:03:10,845 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-11-23 13:03:10,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:03:10,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:03:10,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:03:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:03:10,846 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:03:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 13:03:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:03:10,846 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:03:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:03:11,562 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:03:11,562 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 13:03:11,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:11 BoogieIcfgContainer [2018-11-23 13:03:11,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:03:11,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:03:11,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:03:11,568 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:03:11,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:03:10" (1/3) ... [2018-11-23 13:03:11,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55413768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:11, skipping insertion in model container [2018-11-23 13:03:11,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:10" (2/3) ... [2018-11-23 13:03:11,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55413768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:11, skipping insertion in model container [2018-11-23 13:03:11,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:11" (3/3) ... [2018-11-23 13:03:11,572 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-11-23 13:03:11,581 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:03:11,588 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:03:11,607 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:03:11,639 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:03:11,640 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:03:11,640 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:03:11,641 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:03:11,641 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:03:11,641 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:03:11,642 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:03:11,642 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:03:11,642 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:03:11,661 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-23 13:03:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:03:11,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:11,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:11,671 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:11,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:11,677 INFO L82 PathProgramCache]: Analyzing trace with hash 625586084, now seen corresponding path program 1 times [2018-11-23 13:03:11,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:11,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:11,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:11,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:11,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:11,849 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-23 13:03:11,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {37#true} is VALID [2018-11-23 13:03:11,853 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-23 13:03:11,853 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #84#return; {37#true} is VALID [2018-11-23 13:03:11,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret9 := main(); {37#true} is VALID [2018-11-23 13:03:11,854 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {37#true} is VALID [2018-11-23 13:03:11,855 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-23 13:03:11,855 INFO L256 TraceCheckUtils]: 7: Hoare triple {38#false} call SelectionSort(); {37#true} is VALID [2018-11-23 13:03:11,855 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {37#true} is VALID [2018-11-23 13:03:11,855 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#true} assume !true; {37#true} is VALID [2018-11-23 13:03:11,856 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-23 13:03:11,856 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {37#true} {38#false} #88#return; {38#false} is VALID [2018-11-23 13:03:11,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} ~i~1 := 0; {38#false} is VALID [2018-11-23 13:03:11,857 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {38#false} is VALID [2018-11-23 13:03:11,857 INFO L256 TraceCheckUtils]: 14: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {38#false} is VALID [2018-11-23 13:03:11,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-23 13:03:11,858 INFO L273 TraceCheckUtils]: 16: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2018-11-23 13:03:11,858 INFO L273 TraceCheckUtils]: 17: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-23 13:03:11,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:11,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:11,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:03:11,870 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 13:03:11,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:11,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:03:12,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:12,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:03:12,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:03:12,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:03:12,076 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-23 13:03:12,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:12,318 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2018-11-23 13:03:12,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:03:12,319 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 13:03:12,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:12,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2018-11-23 13:03:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:03:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2018-11-23 13:03:12,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 78 transitions. [2018-11-23 13:03:12,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:12,599 INFO L225 Difference]: With dead ends: 60 [2018-11-23 13:03:12,599 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 13:03:12,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:03:12,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 13:03:12,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 13:03:12,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:12,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 13:03:12,659 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:03:12,659 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:03:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:12,666 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 13:03:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 13:03:12,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:12,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:12,667 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 13:03:12,668 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 13:03:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:12,674 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 13:03:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 13:03:12,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:12,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:12,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:12,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:03:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-23 13:03:12,691 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 18 [2018-11-23 13:03:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:12,691 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-23 13:03:12,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:03:12,692 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 13:03:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 13:03:12,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:12,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:12,696 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:12,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:12,696 INFO L82 PathProgramCache]: Analyzing trace with hash 2087778385, now seen corresponding path program 1 times [2018-11-23 13:03:12,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:12,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:12,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:12,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:12,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:12,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {219#true} call ULTIMATE.init(); {219#true} is VALID [2018-11-23 13:03:12,836 INFO L273 TraceCheckUtils]: 1: Hoare triple {219#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {219#true} is VALID [2018-11-23 13:03:12,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {219#true} assume true; {219#true} is VALID [2018-11-23 13:03:12,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {219#true} {219#true} #84#return; {219#true} is VALID [2018-11-23 13:03:12,837 INFO L256 TraceCheckUtils]: 4: Hoare triple {219#true} call #t~ret9 := main(); {219#true} is VALID [2018-11-23 13:03:12,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {219#true} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {221#(<= 4 main_~i~1)} is VALID [2018-11-23 13:03:12,841 INFO L273 TraceCheckUtils]: 6: Hoare triple {221#(<= 4 main_~i~1)} assume !(~i~1 >= 0); {220#false} is VALID [2018-11-23 13:03:12,841 INFO L256 TraceCheckUtils]: 7: Hoare triple {220#false} call SelectionSort(); {219#true} is VALID [2018-11-23 13:03:12,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {219#true} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {219#true} is VALID [2018-11-23 13:03:12,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {219#true} assume !(~lh~0 < ~n~0); {219#true} is VALID [2018-11-23 13:03:12,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {219#true} assume true; {219#true} is VALID [2018-11-23 13:03:12,842 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {219#true} {220#false} #88#return; {220#false} is VALID [2018-11-23 13:03:12,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {220#false} ~i~1 := 0; {220#false} is VALID [2018-11-23 13:03:12,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {220#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {220#false} is VALID [2018-11-23 13:03:12,843 INFO L256 TraceCheckUtils]: 14: Hoare triple {220#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {220#false} is VALID [2018-11-23 13:03:12,843 INFO L273 TraceCheckUtils]: 15: Hoare triple {220#false} ~cond := #in~cond; {220#false} is VALID [2018-11-23 13:03:12,844 INFO L273 TraceCheckUtils]: 16: Hoare triple {220#false} assume 0 == ~cond; {220#false} is VALID [2018-11-23 13:03:12,844 INFO L273 TraceCheckUtils]: 17: Hoare triple {220#false} assume !false; {220#false} is VALID [2018-11-23 13:03:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:12,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:12,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:03:12,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 13:03:12,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:12,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:03:12,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:12,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:03:12,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:03:12,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:12,923 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-11-23 13:03:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:13,439 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 13:03:13,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:03:13,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 13:03:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:03:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-23 13:03:13,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:03:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2018-11-23 13:03:13,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2018-11-23 13:03:13,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:13,601 INFO L225 Difference]: With dead ends: 52 [2018-11-23 13:03:13,601 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:03:13,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:03:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:03:13,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 13:03:13,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:13,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 13:03:13,639 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 13:03:13,639 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 13:03:13,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:13,642 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 13:03:13,642 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 13:03:13,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:13,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:13,643 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 13:03:13,643 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 13:03:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:13,648 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 13:03:13,648 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 13:03:13,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:13,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:13,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:13,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:03:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-23 13:03:13,653 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2018-11-23 13:03:13,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:13,654 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-23 13:03:13,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:03:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 13:03:13,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 13:03:13,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:13,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:13,655 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:13,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:13,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1482156659, now seen corresponding path program 1 times [2018-11-23 13:03:13,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:13,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:13,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:13,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:13,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:13,743 INFO L256 TraceCheckUtils]: 0: Hoare triple {401#true} call ULTIMATE.init(); {401#true} is VALID [2018-11-23 13:03:13,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {401#true} is VALID [2018-11-23 13:03:13,744 INFO L273 TraceCheckUtils]: 2: Hoare triple {401#true} assume true; {401#true} is VALID [2018-11-23 13:03:13,744 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {401#true} {401#true} #84#return; {401#true} is VALID [2018-11-23 13:03:13,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {401#true} call #t~ret9 := main(); {401#true} is VALID [2018-11-23 13:03:13,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {401#true} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {403#(<= 4 main_~i~1)} is VALID [2018-11-23 13:03:13,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {403#(<= 4 main_~i~1)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {403#(<= 4 main_~i~1)} is VALID [2018-11-23 13:03:13,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {403#(<= 4 main_~i~1)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {404#(<= 3 main_~i~1)} is VALID [2018-11-23 13:03:13,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {404#(<= 3 main_~i~1)} assume !(~i~1 >= 0); {402#false} is VALID [2018-11-23 13:03:13,750 INFO L256 TraceCheckUtils]: 9: Hoare triple {402#false} call SelectionSort(); {401#true} is VALID [2018-11-23 13:03:13,750 INFO L273 TraceCheckUtils]: 10: Hoare triple {401#true} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {401#true} is VALID [2018-11-23 13:03:13,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {401#true} assume !(~lh~0 < ~n~0); {401#true} is VALID [2018-11-23 13:03:13,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {401#true} assume true; {401#true} is VALID [2018-11-23 13:03:13,751 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {401#true} {402#false} #88#return; {402#false} is VALID [2018-11-23 13:03:13,752 INFO L273 TraceCheckUtils]: 14: Hoare triple {402#false} ~i~1 := 0; {402#false} is VALID [2018-11-23 13:03:13,752 INFO L273 TraceCheckUtils]: 15: Hoare triple {402#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {402#false} is VALID [2018-11-23 13:03:13,753 INFO L256 TraceCheckUtils]: 16: Hoare triple {402#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {402#false} is VALID [2018-11-23 13:03:13,753 INFO L273 TraceCheckUtils]: 17: Hoare triple {402#false} ~cond := #in~cond; {402#false} is VALID [2018-11-23 13:03:13,754 INFO L273 TraceCheckUtils]: 18: Hoare triple {402#false} assume 0 == ~cond; {402#false} is VALID [2018-11-23 13:03:13,754 INFO L273 TraceCheckUtils]: 19: Hoare triple {402#false} assume !false; {402#false} is VALID [2018-11-23 13:03:13,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:13,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:13,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:13,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:13,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:14,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {401#true} call ULTIMATE.init(); {401#true} is VALID [2018-11-23 13:03:14,144 INFO L273 TraceCheckUtils]: 1: Hoare triple {401#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {401#true} is VALID [2018-11-23 13:03:14,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {401#true} assume true; {401#true} is VALID [2018-11-23 13:03:14,145 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {401#true} {401#true} #84#return; {401#true} is VALID [2018-11-23 13:03:14,145 INFO L256 TraceCheckUtils]: 4: Hoare triple {401#true} call #t~ret9 := main(); {401#true} is VALID [2018-11-23 13:03:14,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {401#true} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {403#(<= 4 main_~i~1)} is VALID [2018-11-23 13:03:14,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {403#(<= 4 main_~i~1)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {403#(<= 4 main_~i~1)} is VALID [2018-11-23 13:03:14,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {403#(<= 4 main_~i~1)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {404#(<= 3 main_~i~1)} is VALID [2018-11-23 13:03:14,165 INFO L273 TraceCheckUtils]: 8: Hoare triple {404#(<= 3 main_~i~1)} assume !(~i~1 >= 0); {402#false} is VALID [2018-11-23 13:03:14,165 INFO L256 TraceCheckUtils]: 9: Hoare triple {402#false} call SelectionSort(); {402#false} is VALID [2018-11-23 13:03:14,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {402#false} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {402#false} is VALID [2018-11-23 13:03:14,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {402#false} assume !(~lh~0 < ~n~0); {402#false} is VALID [2018-11-23 13:03:14,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {402#false} assume true; {402#false} is VALID [2018-11-23 13:03:14,166 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {402#false} {402#false} #88#return; {402#false} is VALID [2018-11-23 13:03:14,166 INFO L273 TraceCheckUtils]: 14: Hoare triple {402#false} ~i~1 := 0; {402#false} is VALID [2018-11-23 13:03:14,166 INFO L273 TraceCheckUtils]: 15: Hoare triple {402#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {402#false} is VALID [2018-11-23 13:03:14,167 INFO L256 TraceCheckUtils]: 16: Hoare triple {402#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {402#false} is VALID [2018-11-23 13:03:14,167 INFO L273 TraceCheckUtils]: 17: Hoare triple {402#false} ~cond := #in~cond; {402#false} is VALID [2018-11-23 13:03:14,167 INFO L273 TraceCheckUtils]: 18: Hoare triple {402#false} assume 0 == ~cond; {402#false} is VALID [2018-11-23 13:03:14,168 INFO L273 TraceCheckUtils]: 19: Hoare triple {402#false} assume !false; {402#false} is VALID [2018-11-23 13:03:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:14,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:14,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 13:03:14,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 13:03:14,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:14,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:03:14,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:14,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:03:14,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:03:14,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:03:14,277 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2018-11-23 13:03:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:14,559 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 13:03:14,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:03:14,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-23 13:03:14,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:03:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2018-11-23 13:03:14,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:03:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2018-11-23 13:03:14,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2018-11-23 13:03:14,811 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:14,813 INFO L225 Difference]: With dead ends: 54 [2018-11-23 13:03:14,813 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 13:03:14,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:03:14,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 13:03:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 13:03:14,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:14,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-23 13:03:14,827 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-23 13:03:14,827 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-23 13:03:14,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:14,830 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 13:03:14,830 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 13:03:14,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:14,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:14,831 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-23 13:03:14,832 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-23 13:03:14,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:14,834 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 13:03:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 13:03:14,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:14,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:14,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:14,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:03:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 13:03:14,838 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 20 [2018-11-23 13:03:14,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:14,839 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 13:03:14,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:03:14,839 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 13:03:14,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:03:14,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:14,840 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:14,840 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:14,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:14,841 INFO L82 PathProgramCache]: Analyzing trace with hash -699737067, now seen corresponding path program 2 times [2018-11-23 13:03:14,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:14,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:14,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:14,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:14,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:14,969 INFO L256 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2018-11-23 13:03:14,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {651#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {651#true} is VALID [2018-11-23 13:03:14,970 INFO L273 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2018-11-23 13:03:14,970 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} #84#return; {651#true} is VALID [2018-11-23 13:03:14,970 INFO L256 TraceCheckUtils]: 4: Hoare triple {651#true} call #t~ret9 := main(); {651#true} is VALID [2018-11-23 13:03:14,971 INFO L273 TraceCheckUtils]: 5: Hoare triple {651#true} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {653#(<= 4 main_~i~1)} is VALID [2018-11-23 13:03:14,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {653#(<= 4 main_~i~1)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {653#(<= 4 main_~i~1)} is VALID [2018-11-23 13:03:14,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {653#(<= 4 main_~i~1)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {654#(<= 3 main_~i~1)} is VALID [2018-11-23 13:03:14,973 INFO L273 TraceCheckUtils]: 8: Hoare triple {654#(<= 3 main_~i~1)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {654#(<= 3 main_~i~1)} is VALID [2018-11-23 13:03:14,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {654#(<= 3 main_~i~1)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {655#(<= 2 main_~i~1)} is VALID [2018-11-23 13:03:14,974 INFO L273 TraceCheckUtils]: 10: Hoare triple {655#(<= 2 main_~i~1)} assume !(~i~1 >= 0); {652#false} is VALID [2018-11-23 13:03:14,974 INFO L256 TraceCheckUtils]: 11: Hoare triple {652#false} call SelectionSort(); {651#true} is VALID [2018-11-23 13:03:14,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {651#true} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {651#true} is VALID [2018-11-23 13:03:14,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {651#true} assume !(~lh~0 < ~n~0); {651#true} is VALID [2018-11-23 13:03:14,976 INFO L273 TraceCheckUtils]: 14: Hoare triple {651#true} assume true; {651#true} is VALID [2018-11-23 13:03:14,976 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {651#true} {652#false} #88#return; {652#false} is VALID [2018-11-23 13:03:14,977 INFO L273 TraceCheckUtils]: 16: Hoare triple {652#false} ~i~1 := 0; {652#false} is VALID [2018-11-23 13:03:14,977 INFO L273 TraceCheckUtils]: 17: Hoare triple {652#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {652#false} is VALID [2018-11-23 13:03:14,977 INFO L256 TraceCheckUtils]: 18: Hoare triple {652#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {652#false} is VALID [2018-11-23 13:03:14,977 INFO L273 TraceCheckUtils]: 19: Hoare triple {652#false} ~cond := #in~cond; {652#false} is VALID [2018-11-23 13:03:14,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {652#false} assume 0 == ~cond; {652#false} is VALID [2018-11-23 13:03:14,978 INFO L273 TraceCheckUtils]: 21: Hoare triple {652#false} assume !false; {652#false} is VALID [2018-11-23 13:03:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:14,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:14,979 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:14,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:03:15,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 13:03:15,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:15,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:15,127 INFO L256 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {651#true} is VALID [2018-11-23 13:03:15,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {651#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {662#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:15,132 INFO L273 TraceCheckUtils]: 2: Hoare triple {662#(<= 5 ~n~0)} assume true; {662#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:15,134 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {662#(<= 5 ~n~0)} {651#true} #84#return; {662#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:15,136 INFO L256 TraceCheckUtils]: 4: Hoare triple {662#(<= 5 ~n~0)} call #t~ret9 := main(); {662#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:15,138 INFO L273 TraceCheckUtils]: 5: Hoare triple {662#(<= 5 ~n~0)} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {662#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:15,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {662#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {662#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:15,143 INFO L273 TraceCheckUtils]: 7: Hoare triple {662#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {662#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:15,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {662#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {662#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:15,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {662#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {662#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:15,144 INFO L273 TraceCheckUtils]: 10: Hoare triple {662#(<= 5 ~n~0)} assume !(~i~1 >= 0); {662#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:15,145 INFO L256 TraceCheckUtils]: 11: Hoare triple {662#(<= 5 ~n~0)} call SelectionSort(); {662#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:15,146 INFO L273 TraceCheckUtils]: 12: Hoare triple {662#(<= 5 ~n~0)} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {696#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:15,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {696#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} assume !(~lh~0 < ~n~0); {652#false} is VALID [2018-11-23 13:03:15,147 INFO L273 TraceCheckUtils]: 14: Hoare triple {652#false} assume true; {652#false} is VALID [2018-11-23 13:03:15,148 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {652#false} {662#(<= 5 ~n~0)} #88#return; {652#false} is VALID [2018-11-23 13:03:15,148 INFO L273 TraceCheckUtils]: 16: Hoare triple {652#false} ~i~1 := 0; {652#false} is VALID [2018-11-23 13:03:15,149 INFO L273 TraceCheckUtils]: 17: Hoare triple {652#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {652#false} is VALID [2018-11-23 13:03:15,149 INFO L256 TraceCheckUtils]: 18: Hoare triple {652#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {652#false} is VALID [2018-11-23 13:03:15,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {652#false} ~cond := #in~cond; {652#false} is VALID [2018-11-23 13:03:15,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {652#false} assume 0 == ~cond; {652#false} is VALID [2018-11-23 13:03:15,150 INFO L273 TraceCheckUtils]: 21: Hoare triple {652#false} assume !false; {652#false} is VALID [2018-11-23 13:03:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:03:15,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:03:15,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-23 13:03:15,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 13:03:15,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:15,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:03:15,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:15,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:03:15,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:03:15,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:03:15,212 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 7 states. [2018-11-23 13:03:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:15,607 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2018-11-23 13:03:15,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:03:15,607 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 13:03:15,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:03:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-23 13:03:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:03:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2018-11-23 13:03:15,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2018-11-23 13:03:15,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:15,738 INFO L225 Difference]: With dead ends: 62 [2018-11-23 13:03:15,738 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 13:03:15,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:03:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 13:03:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2018-11-23 13:03:15,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:15,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 35 states. [2018-11-23 13:03:15,771 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 35 states. [2018-11-23 13:03:15,772 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 35 states. [2018-11-23 13:03:15,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:15,775 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 13:03:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 13:03:15,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:15,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:15,776 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 41 states. [2018-11-23 13:03:15,776 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 41 states. [2018-11-23 13:03:15,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:15,778 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 13:03:15,779 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 13:03:15,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:15,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:15,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:15,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:03:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-23 13:03:15,782 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2018-11-23 13:03:15,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:15,783 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-23 13:03:15,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:03:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 13:03:15,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:03:15,784 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:15,784 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:15,784 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:15,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:15,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1207034289, now seen corresponding path program 1 times [2018-11-23 13:03:15,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:15,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:15,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:15,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:15,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:15,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {948#true} call ULTIMATE.init(); {948#true} is VALID [2018-11-23 13:03:15,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {948#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {948#true} is VALID [2018-11-23 13:03:15,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {948#true} assume true; {948#true} is VALID [2018-11-23 13:03:15,995 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {948#true} {948#true} #84#return; {948#true} is VALID [2018-11-23 13:03:15,995 INFO L256 TraceCheckUtils]: 4: Hoare triple {948#true} call #t~ret9 := main(); {948#true} is VALID [2018-11-23 13:03:16,010 INFO L273 TraceCheckUtils]: 5: Hoare triple {948#true} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {950#(<= 4 main_~i~1)} is VALID [2018-11-23 13:03:16,012 INFO L273 TraceCheckUtils]: 6: Hoare triple {950#(<= 4 main_~i~1)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {950#(<= 4 main_~i~1)} is VALID [2018-11-23 13:03:16,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {950#(<= 4 main_~i~1)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {951#(<= 3 main_~i~1)} is VALID [2018-11-23 13:03:16,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {951#(<= 3 main_~i~1)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {951#(<= 3 main_~i~1)} is VALID [2018-11-23 13:03:16,018 INFO L273 TraceCheckUtils]: 9: Hoare triple {951#(<= 3 main_~i~1)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {952#(<= 2 main_~i~1)} is VALID [2018-11-23 13:03:16,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {952#(<= 2 main_~i~1)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {952#(<= 2 main_~i~1)} is VALID [2018-11-23 13:03:16,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {952#(<= 2 main_~i~1)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {953#(<= 1 main_~i~1)} is VALID [2018-11-23 13:03:16,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {953#(<= 1 main_~i~1)} assume !(~i~1 >= 0); {949#false} is VALID [2018-11-23 13:03:16,022 INFO L256 TraceCheckUtils]: 13: Hoare triple {949#false} call SelectionSort(); {948#true} is VALID [2018-11-23 13:03:16,022 INFO L273 TraceCheckUtils]: 14: Hoare triple {948#true} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {948#true} is VALID [2018-11-23 13:03:16,023 INFO L273 TraceCheckUtils]: 15: Hoare triple {948#true} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {948#true} is VALID [2018-11-23 13:03:16,023 INFO L273 TraceCheckUtils]: 16: Hoare triple {948#true} assume !(~i~0 < ~n~0); {948#true} is VALID [2018-11-23 13:03:16,023 INFO L273 TraceCheckUtils]: 17: Hoare triple {948#true} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {948#true} is VALID [2018-11-23 13:03:16,023 INFO L273 TraceCheckUtils]: 18: Hoare triple {948#true} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {948#true} is VALID [2018-11-23 13:03:16,024 INFO L273 TraceCheckUtils]: 19: Hoare triple {948#true} assume !(~lh~0 < ~n~0); {948#true} is VALID [2018-11-23 13:03:16,024 INFO L273 TraceCheckUtils]: 20: Hoare triple {948#true} assume true; {948#true} is VALID [2018-11-23 13:03:16,024 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {948#true} {949#false} #88#return; {949#false} is VALID [2018-11-23 13:03:16,024 INFO L273 TraceCheckUtils]: 22: Hoare triple {949#false} ~i~1 := 0; {949#false} is VALID [2018-11-23 13:03:16,024 INFO L273 TraceCheckUtils]: 23: Hoare triple {949#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {949#false} is VALID [2018-11-23 13:03:16,025 INFO L256 TraceCheckUtils]: 24: Hoare triple {949#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {949#false} is VALID [2018-11-23 13:03:16,025 INFO L273 TraceCheckUtils]: 25: Hoare triple {949#false} ~cond := #in~cond; {949#false} is VALID [2018-11-23 13:03:16,025 INFO L273 TraceCheckUtils]: 26: Hoare triple {949#false} assume 0 == ~cond; {949#false} is VALID [2018-11-23 13:03:16,025 INFO L273 TraceCheckUtils]: 27: Hoare triple {949#false} assume !false; {949#false} is VALID [2018-11-23 13:03:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:03:16,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:16,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:16,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:16,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:16,149 INFO L256 TraceCheckUtils]: 0: Hoare triple {948#true} call ULTIMATE.init(); {948#true} is VALID [2018-11-23 13:03:16,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {948#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {948#true} is VALID [2018-11-23 13:03:16,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {948#true} assume true; {948#true} is VALID [2018-11-23 13:03:16,150 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {948#true} {948#true} #84#return; {948#true} is VALID [2018-11-23 13:03:16,150 INFO L256 TraceCheckUtils]: 4: Hoare triple {948#true} call #t~ret9 := main(); {948#true} is VALID [2018-11-23 13:03:16,151 INFO L273 TraceCheckUtils]: 5: Hoare triple {948#true} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {950#(<= 4 main_~i~1)} is VALID [2018-11-23 13:03:16,151 INFO L273 TraceCheckUtils]: 6: Hoare triple {950#(<= 4 main_~i~1)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {950#(<= 4 main_~i~1)} is VALID [2018-11-23 13:03:16,152 INFO L273 TraceCheckUtils]: 7: Hoare triple {950#(<= 4 main_~i~1)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {951#(<= 3 main_~i~1)} is VALID [2018-11-23 13:03:16,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {951#(<= 3 main_~i~1)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {951#(<= 3 main_~i~1)} is VALID [2018-11-23 13:03:16,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {951#(<= 3 main_~i~1)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {952#(<= 2 main_~i~1)} is VALID [2018-11-23 13:03:16,153 INFO L273 TraceCheckUtils]: 10: Hoare triple {952#(<= 2 main_~i~1)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {952#(<= 2 main_~i~1)} is VALID [2018-11-23 13:03:16,154 INFO L273 TraceCheckUtils]: 11: Hoare triple {952#(<= 2 main_~i~1)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {953#(<= 1 main_~i~1)} is VALID [2018-11-23 13:03:16,155 INFO L273 TraceCheckUtils]: 12: Hoare triple {953#(<= 1 main_~i~1)} assume !(~i~1 >= 0); {949#false} is VALID [2018-11-23 13:03:16,155 INFO L256 TraceCheckUtils]: 13: Hoare triple {949#false} call SelectionSort(); {949#false} is VALID [2018-11-23 13:03:16,156 INFO L273 TraceCheckUtils]: 14: Hoare triple {949#false} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {949#false} is VALID [2018-11-23 13:03:16,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {949#false} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {949#false} is VALID [2018-11-23 13:03:16,156 INFO L273 TraceCheckUtils]: 16: Hoare triple {949#false} assume !(~i~0 < ~n~0); {949#false} is VALID [2018-11-23 13:03:16,157 INFO L273 TraceCheckUtils]: 17: Hoare triple {949#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {949#false} is VALID [2018-11-23 13:03:16,157 INFO L273 TraceCheckUtils]: 18: Hoare triple {949#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {949#false} is VALID [2018-11-23 13:03:16,157 INFO L273 TraceCheckUtils]: 19: Hoare triple {949#false} assume !(~lh~0 < ~n~0); {949#false} is VALID [2018-11-23 13:03:16,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {949#false} assume true; {949#false} is VALID [2018-11-23 13:03:16,158 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {949#false} {949#false} #88#return; {949#false} is VALID [2018-11-23 13:03:16,158 INFO L273 TraceCheckUtils]: 22: Hoare triple {949#false} ~i~1 := 0; {949#false} is VALID [2018-11-23 13:03:16,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {949#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {949#false} is VALID [2018-11-23 13:03:16,159 INFO L256 TraceCheckUtils]: 24: Hoare triple {949#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {949#false} is VALID [2018-11-23 13:03:16,159 INFO L273 TraceCheckUtils]: 25: Hoare triple {949#false} ~cond := #in~cond; {949#false} is VALID [2018-11-23 13:03:16,159 INFO L273 TraceCheckUtils]: 26: Hoare triple {949#false} assume 0 == ~cond; {949#false} is VALID [2018-11-23 13:03:16,160 INFO L273 TraceCheckUtils]: 27: Hoare triple {949#false} assume !false; {949#false} is VALID [2018-11-23 13:03:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:03:16,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:16,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 13:03:16,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 13:03:16,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:16,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:03:16,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:16,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:03:16,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:03:16,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:03:16,224 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2018-11-23 13:03:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:16,436 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-23 13:03:16,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:03:16,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-23 13:03:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:16,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:03:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-23 13:03:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:03:16,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-23 13:03:16,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2018-11-23 13:03:16,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:16,525 INFO L225 Difference]: With dead ends: 60 [2018-11-23 13:03:16,526 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:03:16,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:03:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:03:16,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-23 13:03:16,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:16,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2018-11-23 13:03:16,576 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2018-11-23 13:03:16,576 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2018-11-23 13:03:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:16,578 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 13:03:16,579 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 13:03:16,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:16,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:16,580 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2018-11-23 13:03:16,580 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2018-11-23 13:03:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:16,582 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-23 13:03:16,582 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 13:03:16,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:16,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:16,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:16,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:16,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:03:16,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 13:03:16,585 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 28 [2018-11-23 13:03:16,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:16,586 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 13:03:16,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:03:16,586 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 13:03:16,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:03:16,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:16,587 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:16,587 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:16,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:16,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1674464753, now seen corresponding path program 2 times [2018-11-23 13:03:16,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:16,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:16,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:16,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:16,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:16,785 INFO L256 TraceCheckUtils]: 0: Hoare triple {1252#true} call ULTIMATE.init(); {1252#true} is VALID [2018-11-23 13:03:16,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {1252#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {1252#true} is VALID [2018-11-23 13:03:16,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {1252#true} assume true; {1252#true} is VALID [2018-11-23 13:03:16,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1252#true} {1252#true} #84#return; {1252#true} is VALID [2018-11-23 13:03:16,786 INFO L256 TraceCheckUtils]: 4: Hoare triple {1252#true} call #t~ret9 := main(); {1252#true} is VALID [2018-11-23 13:03:16,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {1252#true} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {1254#(<= 4 main_~i~1)} is VALID [2018-11-23 13:03:16,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {1254#(<= 4 main_~i~1)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1254#(<= 4 main_~i~1)} is VALID [2018-11-23 13:03:16,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {1254#(<= 4 main_~i~1)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1255#(<= 3 main_~i~1)} is VALID [2018-11-23 13:03:16,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {1255#(<= 3 main_~i~1)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1255#(<= 3 main_~i~1)} is VALID [2018-11-23 13:03:16,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {1255#(<= 3 main_~i~1)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1256#(<= 2 main_~i~1)} is VALID [2018-11-23 13:03:16,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {1256#(<= 2 main_~i~1)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1256#(<= 2 main_~i~1)} is VALID [2018-11-23 13:03:16,797 INFO L273 TraceCheckUtils]: 11: Hoare triple {1256#(<= 2 main_~i~1)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1257#(<= 1 main_~i~1)} is VALID [2018-11-23 13:03:16,798 INFO L273 TraceCheckUtils]: 12: Hoare triple {1257#(<= 1 main_~i~1)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1257#(<= 1 main_~i~1)} is VALID [2018-11-23 13:03:16,798 INFO L273 TraceCheckUtils]: 13: Hoare triple {1257#(<= 1 main_~i~1)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1258#(<= 0 main_~i~1)} is VALID [2018-11-23 13:03:16,799 INFO L273 TraceCheckUtils]: 14: Hoare triple {1258#(<= 0 main_~i~1)} assume !(~i~1 >= 0); {1253#false} is VALID [2018-11-23 13:03:16,799 INFO L256 TraceCheckUtils]: 15: Hoare triple {1253#false} call SelectionSort(); {1252#true} is VALID [2018-11-23 13:03:16,799 INFO L273 TraceCheckUtils]: 16: Hoare triple {1252#true} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {1252#true} is VALID [2018-11-23 13:03:16,800 INFO L273 TraceCheckUtils]: 17: Hoare triple {1252#true} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {1252#true} is VALID [2018-11-23 13:03:16,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {1252#true} assume !(~i~0 < ~n~0); {1252#true} is VALID [2018-11-23 13:03:16,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {1252#true} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {1252#true} is VALID [2018-11-23 13:03:16,800 INFO L273 TraceCheckUtils]: 20: Hoare triple {1252#true} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {1252#true} is VALID [2018-11-23 13:03:16,801 INFO L273 TraceCheckUtils]: 21: Hoare triple {1252#true} assume !(~lh~0 < ~n~0); {1252#true} is VALID [2018-11-23 13:03:16,801 INFO L273 TraceCheckUtils]: 22: Hoare triple {1252#true} assume true; {1252#true} is VALID [2018-11-23 13:03:16,801 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1252#true} {1253#false} #88#return; {1253#false} is VALID [2018-11-23 13:03:16,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {1253#false} ~i~1 := 0; {1253#false} is VALID [2018-11-23 13:03:16,802 INFO L273 TraceCheckUtils]: 25: Hoare triple {1253#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1253#false} is VALID [2018-11-23 13:03:16,802 INFO L256 TraceCheckUtils]: 26: Hoare triple {1253#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {1253#false} is VALID [2018-11-23 13:03:16,803 INFO L273 TraceCheckUtils]: 27: Hoare triple {1253#false} ~cond := #in~cond; {1253#false} is VALID [2018-11-23 13:03:16,803 INFO L273 TraceCheckUtils]: 28: Hoare triple {1253#false} assume 0 == ~cond; {1253#false} is VALID [2018-11-23 13:03:16,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {1253#false} assume !false; {1253#false} is VALID [2018-11-23 13:03:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:03:16,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:16,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:16,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:03:16,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:03:16,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:16,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:17,079 INFO L256 TraceCheckUtils]: 0: Hoare triple {1252#true} call ULTIMATE.init(); {1252#true} is VALID [2018-11-23 13:03:17,080 INFO L273 TraceCheckUtils]: 1: Hoare triple {1252#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {1265#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:17,080 INFO L273 TraceCheckUtils]: 2: Hoare triple {1265#(<= 5 ~n~0)} assume true; {1265#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:17,081 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1265#(<= 5 ~n~0)} {1252#true} #84#return; {1265#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:17,081 INFO L256 TraceCheckUtils]: 4: Hoare triple {1265#(<= 5 ~n~0)} call #t~ret9 := main(); {1265#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:17,082 INFO L273 TraceCheckUtils]: 5: Hoare triple {1265#(<= 5 ~n~0)} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {1265#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:17,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {1265#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1265#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:17,083 INFO L273 TraceCheckUtils]: 7: Hoare triple {1265#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1265#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:17,084 INFO L273 TraceCheckUtils]: 8: Hoare triple {1265#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1265#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:17,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {1265#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1265#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:17,085 INFO L273 TraceCheckUtils]: 10: Hoare triple {1265#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1265#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:17,086 INFO L273 TraceCheckUtils]: 11: Hoare triple {1265#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1265#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:17,087 INFO L273 TraceCheckUtils]: 12: Hoare triple {1265#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1265#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:17,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {1265#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1265#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:17,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {1265#(<= 5 ~n~0)} assume !(~i~1 >= 0); {1265#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:17,090 INFO L256 TraceCheckUtils]: 15: Hoare triple {1265#(<= 5 ~n~0)} call SelectionSort(); {1265#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:17,091 INFO L273 TraceCheckUtils]: 16: Hoare triple {1265#(<= 5 ~n~0)} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {1311#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:17,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {1311#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {1315#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:17,093 INFO L273 TraceCheckUtils]: 18: Hoare triple {1315#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} assume !(~i~0 < ~n~0); {1253#false} is VALID [2018-11-23 13:03:17,093 INFO L273 TraceCheckUtils]: 19: Hoare triple {1253#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {1253#false} is VALID [2018-11-23 13:03:17,093 INFO L273 TraceCheckUtils]: 20: Hoare triple {1253#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {1253#false} is VALID [2018-11-23 13:03:17,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {1253#false} assume !(~lh~0 < ~n~0); {1253#false} is VALID [2018-11-23 13:03:17,094 INFO L273 TraceCheckUtils]: 22: Hoare triple {1253#false} assume true; {1253#false} is VALID [2018-11-23 13:03:17,095 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1253#false} {1265#(<= 5 ~n~0)} #88#return; {1253#false} is VALID [2018-11-23 13:03:17,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {1253#false} ~i~1 := 0; {1253#false} is VALID [2018-11-23 13:03:17,095 INFO L273 TraceCheckUtils]: 25: Hoare triple {1253#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1253#false} is VALID [2018-11-23 13:03:17,096 INFO L256 TraceCheckUtils]: 26: Hoare triple {1253#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {1253#false} is VALID [2018-11-23 13:03:17,096 INFO L273 TraceCheckUtils]: 27: Hoare triple {1253#false} ~cond := #in~cond; {1253#false} is VALID [2018-11-23 13:03:17,097 INFO L273 TraceCheckUtils]: 28: Hoare triple {1253#false} assume 0 == ~cond; {1253#false} is VALID [2018-11-23 13:03:17,097 INFO L273 TraceCheckUtils]: 29: Hoare triple {1253#false} assume !false; {1253#false} is VALID [2018-11-23 13:03:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 13:03:17,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:03:17,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2018-11-23 13:03:17,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-23 13:03:17,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:17,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:03:17,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:17,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:03:17,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:03:17,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:03:17,190 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 10 states. [2018-11-23 13:03:18,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:18,399 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2018-11-23 13:03:18,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:03:18,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-23 13:03:18,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:03:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2018-11-23 13:03:18,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:03:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2018-11-23 13:03:18,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 101 transitions. [2018-11-23 13:03:18,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:18,673 INFO L225 Difference]: With dead ends: 85 [2018-11-23 13:03:18,673 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 13:03:18,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:03:18,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 13:03:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 40. [2018-11-23 13:03:18,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:18,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 40 states. [2018-11-23 13:03:18,724 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 40 states. [2018-11-23 13:03:18,724 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 40 states. [2018-11-23 13:03:18,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:18,729 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-23 13:03:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2018-11-23 13:03:18,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:18,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:18,730 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 63 states. [2018-11-23 13:03:18,730 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 63 states. [2018-11-23 13:03:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:18,734 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-23 13:03:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2018-11-23 13:03:18,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:18,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:18,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:18,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:03:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-11-23 13:03:18,737 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 30 [2018-11-23 13:03:18,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:18,738 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-23 13:03:18,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:03:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-11-23 13:03:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 13:03:18,739 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:18,739 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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-11-23 13:03:18,739 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:18,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:18,740 INFO L82 PathProgramCache]: Analyzing trace with hash -175519861, now seen corresponding path program 1 times [2018-11-23 13:03:18,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:18,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:18,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:18,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:18,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:18,890 INFO L256 TraceCheckUtils]: 0: Hoare triple {1670#true} call ULTIMATE.init(); {1670#true} is VALID [2018-11-23 13:03:18,891 INFO L273 TraceCheckUtils]: 1: Hoare triple {1670#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {1670#true} is VALID [2018-11-23 13:03:18,891 INFO L273 TraceCheckUtils]: 2: Hoare triple {1670#true} assume true; {1670#true} is VALID [2018-11-23 13:03:18,891 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1670#true} {1670#true} #84#return; {1670#true} is VALID [2018-11-23 13:03:18,892 INFO L256 TraceCheckUtils]: 4: Hoare triple {1670#true} call #t~ret9 := main(); {1670#true} is VALID [2018-11-23 13:03:18,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {1670#true} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {1670#true} is VALID [2018-11-23 13:03:18,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {1670#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1670#true} is VALID [2018-11-23 13:03:18,893 INFO L273 TraceCheckUtils]: 7: Hoare triple {1670#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1670#true} is VALID [2018-11-23 13:03:18,893 INFO L273 TraceCheckUtils]: 8: Hoare triple {1670#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1670#true} is VALID [2018-11-23 13:03:18,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {1670#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1670#true} is VALID [2018-11-23 13:03:18,894 INFO L273 TraceCheckUtils]: 10: Hoare triple {1670#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1670#true} is VALID [2018-11-23 13:03:18,894 INFO L273 TraceCheckUtils]: 11: Hoare triple {1670#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1670#true} is VALID [2018-11-23 13:03:18,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {1670#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1670#true} is VALID [2018-11-23 13:03:18,894 INFO L273 TraceCheckUtils]: 13: Hoare triple {1670#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1670#true} is VALID [2018-11-23 13:03:18,895 INFO L273 TraceCheckUtils]: 14: Hoare triple {1670#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1670#true} is VALID [2018-11-23 13:03:18,895 INFO L273 TraceCheckUtils]: 15: Hoare triple {1670#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1670#true} is VALID [2018-11-23 13:03:18,895 INFO L273 TraceCheckUtils]: 16: Hoare triple {1670#true} assume !(~i~1 >= 0); {1670#true} is VALID [2018-11-23 13:03:18,895 INFO L256 TraceCheckUtils]: 17: Hoare triple {1670#true} call SelectionSort(); {1670#true} is VALID [2018-11-23 13:03:18,895 INFO L273 TraceCheckUtils]: 18: Hoare triple {1670#true} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {1670#true} is VALID [2018-11-23 13:03:18,897 INFO L273 TraceCheckUtils]: 19: Hoare triple {1670#true} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {1672#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:18,899 INFO L273 TraceCheckUtils]: 20: Hoare triple {1672#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {1673#(<= (+ SelectionSort_~lh~0 2) ~n~0)} is VALID [2018-11-23 13:03:18,900 INFO L273 TraceCheckUtils]: 21: Hoare triple {1673#(<= (+ SelectionSort_~lh~0 2) ~n~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {1673#(<= (+ SelectionSort_~lh~0 2) ~n~0)} is VALID [2018-11-23 13:03:18,900 INFO L273 TraceCheckUtils]: 22: Hoare triple {1673#(<= (+ SelectionSort_~lh~0 2) ~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1673#(<= (+ SelectionSort_~lh~0 2) ~n~0)} is VALID [2018-11-23 13:03:18,906 INFO L273 TraceCheckUtils]: 23: Hoare triple {1673#(<= (+ SelectionSort_~lh~0 2) ~n~0)} assume !(~i~0 < ~n~0); {1673#(<= (+ SelectionSort_~lh~0 2) ~n~0)} is VALID [2018-11-23 13:03:18,908 INFO L273 TraceCheckUtils]: 24: Hoare triple {1673#(<= (+ SelectionSort_~lh~0 2) ~n~0)} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {1673#(<= (+ SelectionSort_~lh~0 2) ~n~0)} is VALID [2018-11-23 13:03:18,909 INFO L273 TraceCheckUtils]: 25: Hoare triple {1673#(<= (+ SelectionSort_~lh~0 2) ~n~0)} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {1674#(<= (+ SelectionSort_~lh~0 1) ~n~0)} is VALID [2018-11-23 13:03:18,910 INFO L273 TraceCheckUtils]: 26: Hoare triple {1674#(<= (+ SelectionSort_~lh~0 1) ~n~0)} assume !(~lh~0 < ~n~0); {1671#false} is VALID [2018-11-23 13:03:18,910 INFO L273 TraceCheckUtils]: 27: Hoare triple {1671#false} assume true; {1671#false} is VALID [2018-11-23 13:03:18,910 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1671#false} {1670#true} #88#return; {1671#false} is VALID [2018-11-23 13:03:18,910 INFO L273 TraceCheckUtils]: 29: Hoare triple {1671#false} ~i~1 := 0; {1671#false} is VALID [2018-11-23 13:03:18,910 INFO L273 TraceCheckUtils]: 30: Hoare triple {1671#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1671#false} is VALID [2018-11-23 13:03:18,911 INFO L256 TraceCheckUtils]: 31: Hoare triple {1671#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {1671#false} is VALID [2018-11-23 13:03:18,911 INFO L273 TraceCheckUtils]: 32: Hoare triple {1671#false} ~cond := #in~cond; {1671#false} is VALID [2018-11-23 13:03:18,911 INFO L273 TraceCheckUtils]: 33: Hoare triple {1671#false} assume 0 == ~cond; {1671#false} is VALID [2018-11-23 13:03:18,911 INFO L273 TraceCheckUtils]: 34: Hoare triple {1671#false} assume !false; {1671#false} is VALID [2018-11-23 13:03:18,913 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 13:03:18,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:18,914 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:18,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:19,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:19,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {1670#true} call ULTIMATE.init(); {1670#true} is VALID [2018-11-23 13:03:19,266 INFO L273 TraceCheckUtils]: 1: Hoare triple {1670#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {1681#(<= 5 ~n~0)} assume true; {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,267 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1681#(<= 5 ~n~0)} {1670#true} #84#return; {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,268 INFO L256 TraceCheckUtils]: 4: Hoare triple {1681#(<= 5 ~n~0)} call #t~ret9 := main(); {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,268 INFO L273 TraceCheckUtils]: 5: Hoare triple {1681#(<= 5 ~n~0)} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,269 INFO L273 TraceCheckUtils]: 6: Hoare triple {1681#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {1681#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {1681#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {1681#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,271 INFO L273 TraceCheckUtils]: 10: Hoare triple {1681#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {1681#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,272 INFO L273 TraceCheckUtils]: 12: Hoare triple {1681#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,273 INFO L273 TraceCheckUtils]: 13: Hoare triple {1681#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {1681#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,274 INFO L273 TraceCheckUtils]: 15: Hoare triple {1681#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,275 INFO L273 TraceCheckUtils]: 16: Hoare triple {1681#(<= 5 ~n~0)} assume !(~i~1 >= 0); {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,276 INFO L256 TraceCheckUtils]: 17: Hoare triple {1681#(<= 5 ~n~0)} call SelectionSort(); {1681#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:19,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {1681#(<= 5 ~n~0)} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {1733#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:19,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {1733#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {1737#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:19,279 INFO L273 TraceCheckUtils]: 20: Hoare triple {1737#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {1737#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:19,280 INFO L273 TraceCheckUtils]: 21: Hoare triple {1737#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {1737#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:19,281 INFO L273 TraceCheckUtils]: 22: Hoare triple {1737#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1747#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:19,282 INFO L273 TraceCheckUtils]: 23: Hoare triple {1747#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} assume !(~i~0 < ~n~0); {1671#false} is VALID [2018-11-23 13:03:19,282 INFO L273 TraceCheckUtils]: 24: Hoare triple {1671#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {1671#false} is VALID [2018-11-23 13:03:19,283 INFO L273 TraceCheckUtils]: 25: Hoare triple {1671#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {1671#false} is VALID [2018-11-23 13:03:19,283 INFO L273 TraceCheckUtils]: 26: Hoare triple {1671#false} assume !(~lh~0 < ~n~0); {1671#false} is VALID [2018-11-23 13:03:19,283 INFO L273 TraceCheckUtils]: 27: Hoare triple {1671#false} assume true; {1671#false} is VALID [2018-11-23 13:03:19,284 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1671#false} {1681#(<= 5 ~n~0)} #88#return; {1671#false} is VALID [2018-11-23 13:03:19,284 INFO L273 TraceCheckUtils]: 29: Hoare triple {1671#false} ~i~1 := 0; {1671#false} is VALID [2018-11-23 13:03:19,284 INFO L273 TraceCheckUtils]: 30: Hoare triple {1671#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {1671#false} is VALID [2018-11-23 13:03:19,285 INFO L256 TraceCheckUtils]: 31: Hoare triple {1671#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {1671#false} is VALID [2018-11-23 13:03:19,285 INFO L273 TraceCheckUtils]: 32: Hoare triple {1671#false} ~cond := #in~cond; {1671#false} is VALID [2018-11-23 13:03:19,285 INFO L273 TraceCheckUtils]: 33: Hoare triple {1671#false} assume 0 == ~cond; {1671#false} is VALID [2018-11-23 13:03:19,285 INFO L273 TraceCheckUtils]: 34: Hoare triple {1671#false} assume !false; {1671#false} is VALID [2018-11-23 13:03:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 13:03:19,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:19,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-11-23 13:03:19,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-23 13:03:19,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:19,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:03:19,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:19,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:03:19,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:03:19,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:03:19,428 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 9 states. [2018-11-23 13:03:20,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:20,101 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2018-11-23 13:03:20,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:03:20,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-11-23 13:03:20,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:03:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2018-11-23 13:03:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:03:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2018-11-23 13:03:20,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 80 transitions. [2018-11-23 13:03:20,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:20,205 INFO L225 Difference]: With dead ends: 74 [2018-11-23 13:03:20,205 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 13:03:20,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:03:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 13:03:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-23 13:03:20,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:20,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 53 states. [2018-11-23 13:03:20,254 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 53 states. [2018-11-23 13:03:20,255 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 53 states. [2018-11-23 13:03:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:20,258 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 13:03:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-23 13:03:20,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:20,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:20,259 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 55 states. [2018-11-23 13:03:20,259 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 55 states. [2018-11-23 13:03:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:20,261 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 13:03:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2018-11-23 13:03:20,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:20,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:20,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:20,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:03:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-23 13:03:20,264 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 35 [2018-11-23 13:03:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:20,264 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-23 13:03:20,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:03:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-23 13:03:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 13:03:20,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:20,266 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:20,266 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:20,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:20,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1018225731, now seen corresponding path program 2 times [2018-11-23 13:03:20,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:20,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:20,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:20,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:20,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:20,422 INFO L256 TraceCheckUtils]: 0: Hoare triple {2087#true} call ULTIMATE.init(); {2087#true} is VALID [2018-11-23 13:03:20,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {2087#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {2087#true} is VALID [2018-11-23 13:03:20,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {2087#true} assume true; {2087#true} is VALID [2018-11-23 13:03:20,423 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2087#true} {2087#true} #84#return; {2087#true} is VALID [2018-11-23 13:03:20,423 INFO L256 TraceCheckUtils]: 4: Hoare triple {2087#true} call #t~ret9 := main(); {2087#true} is VALID [2018-11-23 13:03:20,423 INFO L273 TraceCheckUtils]: 5: Hoare triple {2087#true} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {2087#true} is VALID [2018-11-23 13:03:20,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {2087#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2087#true} is VALID [2018-11-23 13:03:20,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {2087#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2087#true} is VALID [2018-11-23 13:03:20,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {2087#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2087#true} is VALID [2018-11-23 13:03:20,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {2087#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2087#true} is VALID [2018-11-23 13:03:20,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {2087#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2087#true} is VALID [2018-11-23 13:03:20,424 INFO L273 TraceCheckUtils]: 11: Hoare triple {2087#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2087#true} is VALID [2018-11-23 13:03:20,424 INFO L273 TraceCheckUtils]: 12: Hoare triple {2087#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2087#true} is VALID [2018-11-23 13:03:20,424 INFO L273 TraceCheckUtils]: 13: Hoare triple {2087#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2087#true} is VALID [2018-11-23 13:03:20,425 INFO L273 TraceCheckUtils]: 14: Hoare triple {2087#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2087#true} is VALID [2018-11-23 13:03:20,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {2087#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2087#true} is VALID [2018-11-23 13:03:20,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {2087#true} assume !(~i~1 >= 0); {2087#true} is VALID [2018-11-23 13:03:20,425 INFO L256 TraceCheckUtils]: 17: Hoare triple {2087#true} call SelectionSort(); {2087#true} is VALID [2018-11-23 13:03:20,425 INFO L273 TraceCheckUtils]: 18: Hoare triple {2087#true} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {2087#true} is VALID [2018-11-23 13:03:20,425 INFO L273 TraceCheckUtils]: 19: Hoare triple {2087#true} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {2087#true} is VALID [2018-11-23 13:03:20,426 INFO L273 TraceCheckUtils]: 20: Hoare triple {2087#true} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2087#true} is VALID [2018-11-23 13:03:20,426 INFO L273 TraceCheckUtils]: 21: Hoare triple {2087#true} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2087#true} is VALID [2018-11-23 13:03:20,426 INFO L273 TraceCheckUtils]: 22: Hoare triple {2087#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2087#true} is VALID [2018-11-23 13:03:20,426 INFO L273 TraceCheckUtils]: 23: Hoare triple {2087#true} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2087#true} is VALID [2018-11-23 13:03:20,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {2087#true} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2087#true} is VALID [2018-11-23 13:03:20,426 INFO L273 TraceCheckUtils]: 25: Hoare triple {2087#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2087#true} is VALID [2018-11-23 13:03:20,426 INFO L273 TraceCheckUtils]: 26: Hoare triple {2087#true} assume !(~i~0 < ~n~0); {2087#true} is VALID [2018-11-23 13:03:20,427 INFO L273 TraceCheckUtils]: 27: Hoare triple {2087#true} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2087#true} is VALID [2018-11-23 13:03:20,427 INFO L273 TraceCheckUtils]: 28: Hoare triple {2087#true} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {2087#true} is VALID [2018-11-23 13:03:20,431 INFO L273 TraceCheckUtils]: 29: Hoare triple {2087#true} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {2089#(<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 1))} is VALID [2018-11-23 13:03:20,431 INFO L273 TraceCheckUtils]: 30: Hoare triple {2089#(<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 1))} assume !(~i~0 < ~n~0); {2090#(<= ~n~0 (+ SelectionSort_~lh~0 1))} is VALID [2018-11-23 13:03:20,433 INFO L273 TraceCheckUtils]: 31: Hoare triple {2090#(<= ~n~0 (+ SelectionSort_~lh~0 1))} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2090#(<= ~n~0 (+ SelectionSort_~lh~0 1))} is VALID [2018-11-23 13:03:20,433 INFO L273 TraceCheckUtils]: 32: Hoare triple {2090#(<= ~n~0 (+ SelectionSort_~lh~0 1))} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {2091#(<= ~n~0 SelectionSort_~lh~0)} is VALID [2018-11-23 13:03:20,436 INFO L273 TraceCheckUtils]: 33: Hoare triple {2091#(<= ~n~0 SelectionSort_~lh~0)} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {2088#false} is VALID [2018-11-23 13:03:20,436 INFO L273 TraceCheckUtils]: 34: Hoare triple {2088#false} assume !(~i~0 < ~n~0); {2088#false} is VALID [2018-11-23 13:03:20,436 INFO L273 TraceCheckUtils]: 35: Hoare triple {2088#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2088#false} is VALID [2018-11-23 13:03:20,436 INFO L273 TraceCheckUtils]: 36: Hoare triple {2088#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {2088#false} is VALID [2018-11-23 13:03:20,436 INFO L273 TraceCheckUtils]: 37: Hoare triple {2088#false} assume !(~lh~0 < ~n~0); {2088#false} is VALID [2018-11-23 13:03:20,436 INFO L273 TraceCheckUtils]: 38: Hoare triple {2088#false} assume true; {2088#false} is VALID [2018-11-23 13:03:20,437 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2088#false} {2087#true} #88#return; {2088#false} is VALID [2018-11-23 13:03:20,437 INFO L273 TraceCheckUtils]: 40: Hoare triple {2088#false} ~i~1 := 0; {2088#false} is VALID [2018-11-23 13:03:20,437 INFO L273 TraceCheckUtils]: 41: Hoare triple {2088#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2088#false} is VALID [2018-11-23 13:03:20,437 INFO L256 TraceCheckUtils]: 42: Hoare triple {2088#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {2088#false} is VALID [2018-11-23 13:03:20,437 INFO L273 TraceCheckUtils]: 43: Hoare triple {2088#false} ~cond := #in~cond; {2088#false} is VALID [2018-11-23 13:03:20,437 INFO L273 TraceCheckUtils]: 44: Hoare triple {2088#false} assume 0 == ~cond; {2088#false} is VALID [2018-11-23 13:03:20,437 INFO L273 TraceCheckUtils]: 45: Hoare triple {2088#false} assume !false; {2088#false} is VALID [2018-11-23 13:03:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 13:03:20,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:20,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:03:20,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-23 13:03:20,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:20,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:03:20,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:20,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:03:20,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:03:20,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:03:20,481 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2018-11-23 13:03:20,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:20,708 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2018-11-23 13:03:20,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:03:20,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-11-23 13:03:20,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:03:20,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-23 13:03:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:03:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-23 13:03:20,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2018-11-23 13:03:20,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:20,823 INFO L225 Difference]: With dead ends: 82 [2018-11-23 13:03:20,824 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 13:03:20,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:03:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 13:03:20,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-11-23 13:03:20,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:20,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 54 states. [2018-11-23 13:03:20,880 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 54 states. [2018-11-23 13:03:20,881 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 54 states. [2018-11-23 13:03:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:20,884 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 13:03:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 13:03:20,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:20,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:20,884 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 56 states. [2018-11-23 13:03:20,885 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 56 states. [2018-11-23 13:03:20,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:20,887 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 13:03:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-11-23 13:03:20,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:20,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:20,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:20,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:03:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-11-23 13:03:20,889 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 46 [2018-11-23 13:03:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:20,889 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-11-23 13:03:20,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:03:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-11-23 13:03:20,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 13:03:20,890 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:20,890 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:20,891 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:20,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:20,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1159318645, now seen corresponding path program 3 times [2018-11-23 13:03:20,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:20,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:20,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:20,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:20,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:21,501 INFO L256 TraceCheckUtils]: 0: Hoare triple {2405#true} call ULTIMATE.init(); {2405#true} is VALID [2018-11-23 13:03:21,502 INFO L273 TraceCheckUtils]: 1: Hoare triple {2405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,503 INFO L273 TraceCheckUtils]: 2: Hoare triple {2407#(<= 5 ~n~0)} assume true; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,503 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2407#(<= 5 ~n~0)} {2405#true} #84#return; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {2407#(<= 5 ~n~0)} call #t~ret9 := main(); {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,505 INFO L273 TraceCheckUtils]: 5: Hoare triple {2407#(<= 5 ~n~0)} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {2407#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {2407#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,506 INFO L273 TraceCheckUtils]: 8: Hoare triple {2407#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {2407#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,506 INFO L273 TraceCheckUtils]: 10: Hoare triple {2407#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,507 INFO L273 TraceCheckUtils]: 11: Hoare triple {2407#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,526 INFO L273 TraceCheckUtils]: 12: Hoare triple {2407#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,535 INFO L273 TraceCheckUtils]: 13: Hoare triple {2407#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {2407#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,556 INFO L273 TraceCheckUtils]: 15: Hoare triple {2407#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,571 INFO L273 TraceCheckUtils]: 16: Hoare triple {2407#(<= 5 ~n~0)} assume !(~i~1 >= 0); {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,571 INFO L256 TraceCheckUtils]: 17: Hoare triple {2407#(<= 5 ~n~0)} call SelectionSort(); {2405#true} is VALID [2018-11-23 13:03:21,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {2405#true} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {2408#(= SelectionSort_~lh~0 0)} is VALID [2018-11-23 13:03:21,574 INFO L273 TraceCheckUtils]: 19: Hoare triple {2408#(= SelectionSort_~lh~0 0)} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {2409#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 1)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:21,574 INFO L273 TraceCheckUtils]: 20: Hoare triple {2409#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 1)) (= SelectionSort_~lh~0 0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2409#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 1)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:21,575 INFO L273 TraceCheckUtils]: 21: Hoare triple {2409#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 1)) (= SelectionSort_~lh~0 0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2409#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 1)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:21,575 INFO L273 TraceCheckUtils]: 22: Hoare triple {2409#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 1)) (= SelectionSort_~lh~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2410#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 2)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:21,576 INFO L273 TraceCheckUtils]: 23: Hoare triple {2410#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 2)) (= SelectionSort_~lh~0 0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2410#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 2)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:21,576 INFO L273 TraceCheckUtils]: 24: Hoare triple {2410#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 2)) (= SelectionSort_~lh~0 0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2410#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 2)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:21,577 INFO L273 TraceCheckUtils]: 25: Hoare triple {2410#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 2)) (= SelectionSort_~lh~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2411#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 3)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:21,578 INFO L273 TraceCheckUtils]: 26: Hoare triple {2411#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 3)) (= SelectionSort_~lh~0 0))} assume !(~i~0 < ~n~0); {2412#(and (<= ~n~0 (+ SelectionSort_~lh~0 3)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:21,579 INFO L273 TraceCheckUtils]: 27: Hoare triple {2412#(and (<= ~n~0 (+ SelectionSort_~lh~0 3)) (= SelectionSort_~lh~0 0))} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2412#(and (<= ~n~0 (+ SelectionSort_~lh~0 3)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:21,580 INFO L273 TraceCheckUtils]: 28: Hoare triple {2412#(and (<= ~n~0 (+ SelectionSort_~lh~0 3)) (= SelectionSort_~lh~0 0))} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {2413#(<= ~n~0 3)} is VALID [2018-11-23 13:03:21,585 INFO L273 TraceCheckUtils]: 29: Hoare triple {2413#(<= ~n~0 3)} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {2413#(<= ~n~0 3)} is VALID [2018-11-23 13:03:21,588 INFO L273 TraceCheckUtils]: 30: Hoare triple {2413#(<= ~n~0 3)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2413#(<= ~n~0 3)} is VALID [2018-11-23 13:03:21,592 INFO L273 TraceCheckUtils]: 31: Hoare triple {2413#(<= ~n~0 3)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2413#(<= ~n~0 3)} is VALID [2018-11-23 13:03:21,595 INFO L273 TraceCheckUtils]: 32: Hoare triple {2413#(<= ~n~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2413#(<= ~n~0 3)} is VALID [2018-11-23 13:03:21,595 INFO L273 TraceCheckUtils]: 33: Hoare triple {2413#(<= ~n~0 3)} assume !(~i~0 < ~n~0); {2413#(<= ~n~0 3)} is VALID [2018-11-23 13:03:21,595 INFO L273 TraceCheckUtils]: 34: Hoare triple {2413#(<= ~n~0 3)} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2413#(<= ~n~0 3)} is VALID [2018-11-23 13:03:21,596 INFO L273 TraceCheckUtils]: 35: Hoare triple {2413#(<= ~n~0 3)} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {2413#(<= ~n~0 3)} is VALID [2018-11-23 13:03:21,598 INFO L273 TraceCheckUtils]: 36: Hoare triple {2413#(<= ~n~0 3)} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {2413#(<= ~n~0 3)} is VALID [2018-11-23 13:03:21,598 INFO L273 TraceCheckUtils]: 37: Hoare triple {2413#(<= ~n~0 3)} assume !(~i~0 < ~n~0); {2413#(<= ~n~0 3)} is VALID [2018-11-23 13:03:21,598 INFO L273 TraceCheckUtils]: 38: Hoare triple {2413#(<= ~n~0 3)} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2413#(<= ~n~0 3)} is VALID [2018-11-23 13:03:21,599 INFO L273 TraceCheckUtils]: 39: Hoare triple {2413#(<= ~n~0 3)} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {2413#(<= ~n~0 3)} is VALID [2018-11-23 13:03:21,599 INFO L273 TraceCheckUtils]: 40: Hoare triple {2413#(<= ~n~0 3)} assume !(~lh~0 < ~n~0); {2413#(<= ~n~0 3)} is VALID [2018-11-23 13:03:21,599 INFO L273 TraceCheckUtils]: 41: Hoare triple {2413#(<= ~n~0 3)} assume true; {2413#(<= ~n~0 3)} is VALID [2018-11-23 13:03:21,600 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2413#(<= ~n~0 3)} {2407#(<= 5 ~n~0)} #88#return; {2406#false} is VALID [2018-11-23 13:03:21,600 INFO L273 TraceCheckUtils]: 43: Hoare triple {2406#false} ~i~1 := 0; {2406#false} is VALID [2018-11-23 13:03:21,600 INFO L273 TraceCheckUtils]: 44: Hoare triple {2406#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2406#false} is VALID [2018-11-23 13:03:21,600 INFO L256 TraceCheckUtils]: 45: Hoare triple {2406#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {2406#false} is VALID [2018-11-23 13:03:21,600 INFO L273 TraceCheckUtils]: 46: Hoare triple {2406#false} ~cond := #in~cond; {2406#false} is VALID [2018-11-23 13:03:21,601 INFO L273 TraceCheckUtils]: 47: Hoare triple {2406#false} assume 0 == ~cond; {2406#false} is VALID [2018-11-23 13:03:21,601 INFO L273 TraceCheckUtils]: 48: Hoare triple {2406#false} assume !false; {2406#false} is VALID [2018-11-23 13:03:21,605 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-23 13:03:21,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:21,606 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:21,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:03:21,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 13:03:21,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:21,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:21,925 INFO L256 TraceCheckUtils]: 0: Hoare triple {2405#true} call ULTIMATE.init(); {2405#true} is VALID [2018-11-23 13:03:21,926 INFO L273 TraceCheckUtils]: 1: Hoare triple {2405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,927 INFO L273 TraceCheckUtils]: 2: Hoare triple {2407#(<= 5 ~n~0)} assume true; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,928 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2407#(<= 5 ~n~0)} {2405#true} #84#return; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,928 INFO L256 TraceCheckUtils]: 4: Hoare triple {2407#(<= 5 ~n~0)} call #t~ret9 := main(); {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,929 INFO L273 TraceCheckUtils]: 5: Hoare triple {2407#(<= 5 ~n~0)} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {2407#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,930 INFO L273 TraceCheckUtils]: 7: Hoare triple {2407#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,930 INFO L273 TraceCheckUtils]: 8: Hoare triple {2407#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,931 INFO L273 TraceCheckUtils]: 9: Hoare triple {2407#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {2407#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,932 INFO L273 TraceCheckUtils]: 11: Hoare triple {2407#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,932 INFO L273 TraceCheckUtils]: 12: Hoare triple {2407#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,933 INFO L273 TraceCheckUtils]: 13: Hoare triple {2407#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,933 INFO L273 TraceCheckUtils]: 14: Hoare triple {2407#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,934 INFO L273 TraceCheckUtils]: 15: Hoare triple {2407#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {2407#(<= 5 ~n~0)} assume !(~i~1 >= 0); {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,935 INFO L256 TraceCheckUtils]: 17: Hoare triple {2407#(<= 5 ~n~0)} call SelectionSort(); {2407#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:21,936 INFO L273 TraceCheckUtils]: 18: Hoare triple {2407#(<= 5 ~n~0)} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {2471#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:21,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {2471#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {2475#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:21,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {2475#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2475#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:21,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {2475#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2475#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:21,939 INFO L273 TraceCheckUtils]: 22: Hoare triple {2475#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2485#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:21,940 INFO L273 TraceCheckUtils]: 23: Hoare triple {2485#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2485#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:21,941 INFO L273 TraceCheckUtils]: 24: Hoare triple {2485#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2485#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:21,941 INFO L273 TraceCheckUtils]: 25: Hoare triple {2485#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2495#(and (<= SelectionSort_~i~0 3) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:21,942 INFO L273 TraceCheckUtils]: 26: Hoare triple {2495#(and (<= SelectionSort_~i~0 3) (<= 5 ~n~0))} assume !(~i~0 < ~n~0); {2406#false} is VALID [2018-11-23 13:03:21,942 INFO L273 TraceCheckUtils]: 27: Hoare triple {2406#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2406#false} is VALID [2018-11-23 13:03:21,943 INFO L273 TraceCheckUtils]: 28: Hoare triple {2406#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {2406#false} is VALID [2018-11-23 13:03:21,943 INFO L273 TraceCheckUtils]: 29: Hoare triple {2406#false} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {2406#false} is VALID [2018-11-23 13:03:21,943 INFO L273 TraceCheckUtils]: 30: Hoare triple {2406#false} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2406#false} is VALID [2018-11-23 13:03:21,943 INFO L273 TraceCheckUtils]: 31: Hoare triple {2406#false} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2406#false} is VALID [2018-11-23 13:03:21,943 INFO L273 TraceCheckUtils]: 32: Hoare triple {2406#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2406#false} is VALID [2018-11-23 13:03:21,944 INFO L273 TraceCheckUtils]: 33: Hoare triple {2406#false} assume !(~i~0 < ~n~0); {2406#false} is VALID [2018-11-23 13:03:21,944 INFO L273 TraceCheckUtils]: 34: Hoare triple {2406#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2406#false} is VALID [2018-11-23 13:03:21,944 INFO L273 TraceCheckUtils]: 35: Hoare triple {2406#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {2406#false} is VALID [2018-11-23 13:03:21,944 INFO L273 TraceCheckUtils]: 36: Hoare triple {2406#false} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {2406#false} is VALID [2018-11-23 13:03:21,944 INFO L273 TraceCheckUtils]: 37: Hoare triple {2406#false} assume !(~i~0 < ~n~0); {2406#false} is VALID [2018-11-23 13:03:21,945 INFO L273 TraceCheckUtils]: 38: Hoare triple {2406#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2406#false} is VALID [2018-11-23 13:03:21,945 INFO L273 TraceCheckUtils]: 39: Hoare triple {2406#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {2406#false} is VALID [2018-11-23 13:03:21,945 INFO L273 TraceCheckUtils]: 40: Hoare triple {2406#false} assume !(~lh~0 < ~n~0); {2406#false} is VALID [2018-11-23 13:03:21,945 INFO L273 TraceCheckUtils]: 41: Hoare triple {2406#false} assume true; {2406#false} is VALID [2018-11-23 13:03:21,945 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2406#false} {2407#(<= 5 ~n~0)} #88#return; {2406#false} is VALID [2018-11-23 13:03:21,945 INFO L273 TraceCheckUtils]: 43: Hoare triple {2406#false} ~i~1 := 0; {2406#false} is VALID [2018-11-23 13:03:21,946 INFO L273 TraceCheckUtils]: 44: Hoare triple {2406#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2406#false} is VALID [2018-11-23 13:03:21,946 INFO L256 TraceCheckUtils]: 45: Hoare triple {2406#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {2406#false} is VALID [2018-11-23 13:03:21,946 INFO L273 TraceCheckUtils]: 46: Hoare triple {2406#false} ~cond := #in~cond; {2406#false} is VALID [2018-11-23 13:03:21,946 INFO L273 TraceCheckUtils]: 47: Hoare triple {2406#false} assume 0 == ~cond; {2406#false} is VALID [2018-11-23 13:03:21,946 INFO L273 TraceCheckUtils]: 48: Hoare triple {2406#false} assume !false; {2406#false} is VALID [2018-11-23 13:03:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 13:03:21,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:21,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-11-23 13:03:21,968 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-11-23 13:03:21,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:21,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:03:22,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:22,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:03:22,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:03:22,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:03:22,023 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 13 states. [2018-11-23 13:03:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:22,621 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-11-23 13:03:22,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:03:22,621 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-11-23 13:03:22,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:03:22,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2018-11-23 13:03:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:03:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2018-11-23 13:03:22,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 76 transitions. [2018-11-23 13:03:22,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:22,699 INFO L225 Difference]: With dead ends: 86 [2018-11-23 13:03:22,699 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 13:03:22,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:03:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 13:03:22,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-23 13:03:22,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:22,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 57 states. [2018-11-23 13:03:22,948 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 57 states. [2018-11-23 13:03:22,948 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 57 states. [2018-11-23 13:03:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:22,950 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-23 13:03:22,950 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2018-11-23 13:03:22,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:22,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:22,951 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 59 states. [2018-11-23 13:03:22,951 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 59 states. [2018-11-23 13:03:22,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:22,953 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-23 13:03:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2018-11-23 13:03:22,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:22,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:22,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:22,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:03:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-11-23 13:03:22,956 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 49 [2018-11-23 13:03:22,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:22,956 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-23 13:03:22,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:03:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-23 13:03:22,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 13:03:22,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:22,957 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:22,957 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:22,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:22,958 INFO L82 PathProgramCache]: Analyzing trace with hash 589875219, now seen corresponding path program 4 times [2018-11-23 13:03:22,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:22,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:22,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:22,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:22,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:23,203 INFO L256 TraceCheckUtils]: 0: Hoare triple {2894#true} call ULTIMATE.init(); {2894#true} is VALID [2018-11-23 13:03:23,203 INFO L273 TraceCheckUtils]: 1: Hoare triple {2894#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {2894#true} is VALID [2018-11-23 13:03:23,203 INFO L273 TraceCheckUtils]: 2: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-23 13:03:23,203 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2894#true} {2894#true} #84#return; {2894#true} is VALID [2018-11-23 13:03:23,204 INFO L256 TraceCheckUtils]: 4: Hoare triple {2894#true} call #t~ret9 := main(); {2894#true} is VALID [2018-11-23 13:03:23,204 INFO L273 TraceCheckUtils]: 5: Hoare triple {2894#true} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {2894#true} is VALID [2018-11-23 13:03:23,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {2894#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2894#true} is VALID [2018-11-23 13:03:23,204 INFO L273 TraceCheckUtils]: 7: Hoare triple {2894#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2894#true} is VALID [2018-11-23 13:03:23,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {2894#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2894#true} is VALID [2018-11-23 13:03:23,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {2894#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2894#true} is VALID [2018-11-23 13:03:23,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {2894#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2894#true} is VALID [2018-11-23 13:03:23,205 INFO L273 TraceCheckUtils]: 11: Hoare triple {2894#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2894#true} is VALID [2018-11-23 13:03:23,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {2894#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2894#true} is VALID [2018-11-23 13:03:23,205 INFO L273 TraceCheckUtils]: 13: Hoare triple {2894#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2894#true} is VALID [2018-11-23 13:03:23,205 INFO L273 TraceCheckUtils]: 14: Hoare triple {2894#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2894#true} is VALID [2018-11-23 13:03:23,205 INFO L273 TraceCheckUtils]: 15: Hoare triple {2894#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2894#true} is VALID [2018-11-23 13:03:23,205 INFO L273 TraceCheckUtils]: 16: Hoare triple {2894#true} assume !(~i~1 >= 0); {2894#true} is VALID [2018-11-23 13:03:23,206 INFO L256 TraceCheckUtils]: 17: Hoare triple {2894#true} call SelectionSort(); {2894#true} is VALID [2018-11-23 13:03:23,206 INFO L273 TraceCheckUtils]: 18: Hoare triple {2894#true} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {2894#true} is VALID [2018-11-23 13:03:23,206 INFO L273 TraceCheckUtils]: 19: Hoare triple {2894#true} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {2896#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:23,207 INFO L273 TraceCheckUtils]: 20: Hoare triple {2896#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2896#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:23,207 INFO L273 TraceCheckUtils]: 21: Hoare triple {2896#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2896#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:23,208 INFO L273 TraceCheckUtils]: 22: Hoare triple {2896#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2897#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:23,208 INFO L273 TraceCheckUtils]: 23: Hoare triple {2897#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2897#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:23,208 INFO L273 TraceCheckUtils]: 24: Hoare triple {2897#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2897#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:23,209 INFO L273 TraceCheckUtils]: 25: Hoare triple {2897#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2898#(<= (+ SelectionSort_~lh~0 3) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:23,210 INFO L273 TraceCheckUtils]: 26: Hoare triple {2898#(<= (+ SelectionSort_~lh~0 3) SelectionSort_~i~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} is VALID [2018-11-23 13:03:23,210 INFO L273 TraceCheckUtils]: 27: Hoare triple {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} is VALID [2018-11-23 13:03:23,211 INFO L273 TraceCheckUtils]: 28: Hoare triple {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} is VALID [2018-11-23 13:03:23,211 INFO L273 TraceCheckUtils]: 29: Hoare triple {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} assume !(~i~0 < ~n~0); {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} is VALID [2018-11-23 13:03:23,211 INFO L273 TraceCheckUtils]: 30: Hoare triple {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} is VALID [2018-11-23 13:03:23,212 INFO L273 TraceCheckUtils]: 31: Hoare triple {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {2900#(<= (+ SelectionSort_~lh~0 3) ~n~0)} is VALID [2018-11-23 13:03:23,213 INFO L273 TraceCheckUtils]: 32: Hoare triple {2900#(<= (+ SelectionSort_~lh~0 3) ~n~0)} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {2901#(<= (+ SelectionSort_~i~0 2) ~n~0)} is VALID [2018-11-23 13:03:23,214 INFO L273 TraceCheckUtils]: 33: Hoare triple {2901#(<= (+ SelectionSort_~i~0 2) ~n~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2901#(<= (+ SelectionSort_~i~0 2) ~n~0)} is VALID [2018-11-23 13:03:23,214 INFO L273 TraceCheckUtils]: 34: Hoare triple {2901#(<= (+ SelectionSort_~i~0 2) ~n~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2901#(<= (+ SelectionSort_~i~0 2) ~n~0)} is VALID [2018-11-23 13:03:23,215 INFO L273 TraceCheckUtils]: 35: Hoare triple {2901#(<= (+ SelectionSort_~i~0 2) ~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2902#(<= (+ SelectionSort_~i~0 1) ~n~0)} is VALID [2018-11-23 13:03:23,216 INFO L273 TraceCheckUtils]: 36: Hoare triple {2902#(<= (+ SelectionSort_~i~0 1) ~n~0)} assume !(~i~0 < ~n~0); {2895#false} is VALID [2018-11-23 13:03:23,217 INFO L273 TraceCheckUtils]: 37: Hoare triple {2895#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2895#false} is VALID [2018-11-23 13:03:23,217 INFO L273 TraceCheckUtils]: 38: Hoare triple {2895#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {2895#false} is VALID [2018-11-23 13:03:23,217 INFO L273 TraceCheckUtils]: 39: Hoare triple {2895#false} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {2895#false} is VALID [2018-11-23 13:03:23,217 INFO L273 TraceCheckUtils]: 40: Hoare triple {2895#false} assume !(~i~0 < ~n~0); {2895#false} is VALID [2018-11-23 13:03:23,218 INFO L273 TraceCheckUtils]: 41: Hoare triple {2895#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2895#false} is VALID [2018-11-23 13:03:23,218 INFO L273 TraceCheckUtils]: 42: Hoare triple {2895#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {2895#false} is VALID [2018-11-23 13:03:23,218 INFO L273 TraceCheckUtils]: 43: Hoare triple {2895#false} assume !(~lh~0 < ~n~0); {2895#false} is VALID [2018-11-23 13:03:23,218 INFO L273 TraceCheckUtils]: 44: Hoare triple {2895#false} assume true; {2895#false} is VALID [2018-11-23 13:03:23,219 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2895#false} {2894#true} #88#return; {2895#false} is VALID [2018-11-23 13:03:23,219 INFO L273 TraceCheckUtils]: 46: Hoare triple {2895#false} ~i~1 := 0; {2895#false} is VALID [2018-11-23 13:03:23,219 INFO L273 TraceCheckUtils]: 47: Hoare triple {2895#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2895#false} is VALID [2018-11-23 13:03:23,219 INFO L256 TraceCheckUtils]: 48: Hoare triple {2895#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {2895#false} is VALID [2018-11-23 13:03:23,219 INFO L273 TraceCheckUtils]: 49: Hoare triple {2895#false} ~cond := #in~cond; {2895#false} is VALID [2018-11-23 13:03:23,219 INFO L273 TraceCheckUtils]: 50: Hoare triple {2895#false} assume 0 == ~cond; {2895#false} is VALID [2018-11-23 13:03:23,220 INFO L273 TraceCheckUtils]: 51: Hoare triple {2895#false} assume !false; {2895#false} is VALID [2018-11-23 13:03:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 13:03:23,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:23,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:23,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:03:23,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:03:23,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:23,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:23,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {2894#true} call ULTIMATE.init(); {2894#true} is VALID [2018-11-23 13:03:23,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {2894#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {2894#true} is VALID [2018-11-23 13:03:23,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {2894#true} assume true; {2894#true} is VALID [2018-11-23 13:03:23,490 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2894#true} {2894#true} #84#return; {2894#true} is VALID [2018-11-23 13:03:23,490 INFO L256 TraceCheckUtils]: 4: Hoare triple {2894#true} call #t~ret9 := main(); {2894#true} is VALID [2018-11-23 13:03:23,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {2894#true} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {2894#true} is VALID [2018-11-23 13:03:23,490 INFO L273 TraceCheckUtils]: 6: Hoare triple {2894#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2894#true} is VALID [2018-11-23 13:03:23,490 INFO L273 TraceCheckUtils]: 7: Hoare triple {2894#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2894#true} is VALID [2018-11-23 13:03:23,490 INFO L273 TraceCheckUtils]: 8: Hoare triple {2894#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2894#true} is VALID [2018-11-23 13:03:23,490 INFO L273 TraceCheckUtils]: 9: Hoare triple {2894#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2894#true} is VALID [2018-11-23 13:03:23,491 INFO L273 TraceCheckUtils]: 10: Hoare triple {2894#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2894#true} is VALID [2018-11-23 13:03:23,491 INFO L273 TraceCheckUtils]: 11: Hoare triple {2894#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2894#true} is VALID [2018-11-23 13:03:23,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {2894#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2894#true} is VALID [2018-11-23 13:03:23,491 INFO L273 TraceCheckUtils]: 13: Hoare triple {2894#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2894#true} is VALID [2018-11-23 13:03:23,491 INFO L273 TraceCheckUtils]: 14: Hoare triple {2894#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2894#true} is VALID [2018-11-23 13:03:23,491 INFO L273 TraceCheckUtils]: 15: Hoare triple {2894#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {2894#true} is VALID [2018-11-23 13:03:23,492 INFO L273 TraceCheckUtils]: 16: Hoare triple {2894#true} assume !(~i~1 >= 0); {2894#true} is VALID [2018-11-23 13:03:23,492 INFO L256 TraceCheckUtils]: 17: Hoare triple {2894#true} call SelectionSort(); {2894#true} is VALID [2018-11-23 13:03:23,492 INFO L273 TraceCheckUtils]: 18: Hoare triple {2894#true} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {2894#true} is VALID [2018-11-23 13:03:23,504 INFO L273 TraceCheckUtils]: 19: Hoare triple {2894#true} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {2896#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:23,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {2896#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2896#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:23,505 INFO L273 TraceCheckUtils]: 21: Hoare triple {2896#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2896#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:23,506 INFO L273 TraceCheckUtils]: 22: Hoare triple {2896#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2897#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:23,506 INFO L273 TraceCheckUtils]: 23: Hoare triple {2897#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2897#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:23,507 INFO L273 TraceCheckUtils]: 24: Hoare triple {2897#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2897#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:23,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {2897#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2898#(<= (+ SelectionSort_~lh~0 3) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:23,508 INFO L273 TraceCheckUtils]: 26: Hoare triple {2898#(<= (+ SelectionSort_~lh~0 3) SelectionSort_~i~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} is VALID [2018-11-23 13:03:23,509 INFO L273 TraceCheckUtils]: 27: Hoare triple {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} is VALID [2018-11-23 13:03:23,509 INFO L273 TraceCheckUtils]: 28: Hoare triple {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} is VALID [2018-11-23 13:03:23,510 INFO L273 TraceCheckUtils]: 29: Hoare triple {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} assume !(~i~0 < ~n~0); {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} is VALID [2018-11-23 13:03:23,510 INFO L273 TraceCheckUtils]: 30: Hoare triple {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} is VALID [2018-11-23 13:03:23,511 INFO L273 TraceCheckUtils]: 31: Hoare triple {2899#(<= (+ SelectionSort_~lh~0 4) ~n~0)} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {2900#(<= (+ SelectionSort_~lh~0 3) ~n~0)} is VALID [2018-11-23 13:03:23,515 INFO L273 TraceCheckUtils]: 32: Hoare triple {2900#(<= (+ SelectionSort_~lh~0 3) ~n~0)} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {2901#(<= (+ SelectionSort_~i~0 2) ~n~0)} is VALID [2018-11-23 13:03:23,515 INFO L273 TraceCheckUtils]: 33: Hoare triple {2901#(<= (+ SelectionSort_~i~0 2) ~n~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2901#(<= (+ SelectionSort_~i~0 2) ~n~0)} is VALID [2018-11-23 13:03:23,517 INFO L273 TraceCheckUtils]: 34: Hoare triple {2901#(<= (+ SelectionSort_~i~0 2) ~n~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {2901#(<= (+ SelectionSort_~i~0 2) ~n~0)} is VALID [2018-11-23 13:03:23,517 INFO L273 TraceCheckUtils]: 35: Hoare triple {2901#(<= (+ SelectionSort_~i~0 2) ~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2902#(<= (+ SelectionSort_~i~0 1) ~n~0)} is VALID [2018-11-23 13:03:23,518 INFO L273 TraceCheckUtils]: 36: Hoare triple {2902#(<= (+ SelectionSort_~i~0 1) ~n~0)} assume !(~i~0 < ~n~0); {2895#false} is VALID [2018-11-23 13:03:23,518 INFO L273 TraceCheckUtils]: 37: Hoare triple {2895#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2895#false} is VALID [2018-11-23 13:03:23,518 INFO L273 TraceCheckUtils]: 38: Hoare triple {2895#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {2895#false} is VALID [2018-11-23 13:03:23,518 INFO L273 TraceCheckUtils]: 39: Hoare triple {2895#false} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {2895#false} is VALID [2018-11-23 13:03:23,518 INFO L273 TraceCheckUtils]: 40: Hoare triple {2895#false} assume !(~i~0 < ~n~0); {2895#false} is VALID [2018-11-23 13:03:23,518 INFO L273 TraceCheckUtils]: 41: Hoare triple {2895#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {2895#false} is VALID [2018-11-23 13:03:23,518 INFO L273 TraceCheckUtils]: 42: Hoare triple {2895#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {2895#false} is VALID [2018-11-23 13:03:23,518 INFO L273 TraceCheckUtils]: 43: Hoare triple {2895#false} assume !(~lh~0 < ~n~0); {2895#false} is VALID [2018-11-23 13:03:23,519 INFO L273 TraceCheckUtils]: 44: Hoare triple {2895#false} assume true; {2895#false} is VALID [2018-11-23 13:03:23,519 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2895#false} {2894#true} #88#return; {2895#false} is VALID [2018-11-23 13:03:23,519 INFO L273 TraceCheckUtils]: 46: Hoare triple {2895#false} ~i~1 := 0; {2895#false} is VALID [2018-11-23 13:03:23,519 INFO L273 TraceCheckUtils]: 47: Hoare triple {2895#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {2895#false} is VALID [2018-11-23 13:03:23,519 INFO L256 TraceCheckUtils]: 48: Hoare triple {2895#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {2895#false} is VALID [2018-11-23 13:03:23,519 INFO L273 TraceCheckUtils]: 49: Hoare triple {2895#false} ~cond := #in~cond; {2895#false} is VALID [2018-11-23 13:03:23,519 INFO L273 TraceCheckUtils]: 50: Hoare triple {2895#false} assume 0 == ~cond; {2895#false} is VALID [2018-11-23 13:03:23,520 INFO L273 TraceCheckUtils]: 51: Hoare triple {2895#false} assume !false; {2895#false} is VALID [2018-11-23 13:03:23,521 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-23 13:03:23,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:23,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 13:03:23,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-11-23 13:03:23,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:23,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:03:23,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:23,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:03:23,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:03:23,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:03:23,598 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 9 states. [2018-11-23 13:03:24,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:24,244 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2018-11-23 13:03:24,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:03:24,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-11-23 13:03:24,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:24,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:03:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2018-11-23 13:03:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:03:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 83 transitions. [2018-11-23 13:03:24,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 83 transitions. [2018-11-23 13:03:24,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:24,370 INFO L225 Difference]: With dead ends: 96 [2018-11-23 13:03:24,370 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 13:03:24,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:03:24,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 13:03:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2018-11-23 13:03:24,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:24,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 63 states. [2018-11-23 13:03:24,502 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 63 states. [2018-11-23 13:03:24,502 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 63 states. [2018-11-23 13:03:24,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:24,504 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2018-11-23 13:03:24,504 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2018-11-23 13:03:24,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:24,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:24,504 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 73 states. [2018-11-23 13:03:24,504 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 73 states. [2018-11-23 13:03:24,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:24,506 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2018-11-23 13:03:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2018-11-23 13:03:24,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:24,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:24,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:24,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 13:03:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-11-23 13:03:24,508 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 52 [2018-11-23 13:03:24,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:24,509 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-23 13:03:24,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:03:24,509 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2018-11-23 13:03:24,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 13:03:24,510 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:24,510 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:24,510 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:24,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:24,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1801585221, now seen corresponding path program 5 times [2018-11-23 13:03:24,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:24,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:24,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:24,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:24,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:24,706 INFO L256 TraceCheckUtils]: 0: Hoare triple {3444#true} call ULTIMATE.init(); {3444#true} is VALID [2018-11-23 13:03:24,707 INFO L273 TraceCheckUtils]: 1: Hoare triple {3444#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {3444#true} is VALID [2018-11-23 13:03:24,707 INFO L273 TraceCheckUtils]: 2: Hoare triple {3444#true} assume true; {3444#true} is VALID [2018-11-23 13:03:24,707 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3444#true} {3444#true} #84#return; {3444#true} is VALID [2018-11-23 13:03:24,707 INFO L256 TraceCheckUtils]: 4: Hoare triple {3444#true} call #t~ret9 := main(); {3444#true} is VALID [2018-11-23 13:03:24,708 INFO L273 TraceCheckUtils]: 5: Hoare triple {3444#true} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {3444#true} is VALID [2018-11-23 13:03:24,708 INFO L273 TraceCheckUtils]: 6: Hoare triple {3444#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3444#true} is VALID [2018-11-23 13:03:24,708 INFO L273 TraceCheckUtils]: 7: Hoare triple {3444#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3444#true} is VALID [2018-11-23 13:03:24,708 INFO L273 TraceCheckUtils]: 8: Hoare triple {3444#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3444#true} is VALID [2018-11-23 13:03:24,708 INFO L273 TraceCheckUtils]: 9: Hoare triple {3444#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3444#true} is VALID [2018-11-23 13:03:24,709 INFO L273 TraceCheckUtils]: 10: Hoare triple {3444#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3444#true} is VALID [2018-11-23 13:03:24,709 INFO L273 TraceCheckUtils]: 11: Hoare triple {3444#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3444#true} is VALID [2018-11-23 13:03:24,709 INFO L273 TraceCheckUtils]: 12: Hoare triple {3444#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3444#true} is VALID [2018-11-23 13:03:24,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {3444#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3444#true} is VALID [2018-11-23 13:03:24,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {3444#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3444#true} is VALID [2018-11-23 13:03:24,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {3444#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3444#true} is VALID [2018-11-23 13:03:24,710 INFO L273 TraceCheckUtils]: 16: Hoare triple {3444#true} assume !(~i~1 >= 0); {3444#true} is VALID [2018-11-23 13:03:24,710 INFO L256 TraceCheckUtils]: 17: Hoare triple {3444#true} call SelectionSort(); {3444#true} is VALID [2018-11-23 13:03:24,710 INFO L273 TraceCheckUtils]: 18: Hoare triple {3444#true} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {3444#true} is VALID [2018-11-23 13:03:24,710 INFO L273 TraceCheckUtils]: 19: Hoare triple {3444#true} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {3444#true} is VALID [2018-11-23 13:03:24,710 INFO L273 TraceCheckUtils]: 20: Hoare triple {3444#true} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3444#true} is VALID [2018-11-23 13:03:24,711 INFO L273 TraceCheckUtils]: 21: Hoare triple {3444#true} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3444#true} is VALID [2018-11-23 13:03:24,711 INFO L273 TraceCheckUtils]: 22: Hoare triple {3444#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3444#true} is VALID [2018-11-23 13:03:24,711 INFO L273 TraceCheckUtils]: 23: Hoare triple {3444#true} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3444#true} is VALID [2018-11-23 13:03:24,711 INFO L273 TraceCheckUtils]: 24: Hoare triple {3444#true} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3444#true} is VALID [2018-11-23 13:03:24,711 INFO L273 TraceCheckUtils]: 25: Hoare triple {3444#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3444#true} is VALID [2018-11-23 13:03:24,711 INFO L273 TraceCheckUtils]: 26: Hoare triple {3444#true} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3444#true} is VALID [2018-11-23 13:03:24,711 INFO L273 TraceCheckUtils]: 27: Hoare triple {3444#true} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3444#true} is VALID [2018-11-23 13:03:24,711 INFO L273 TraceCheckUtils]: 28: Hoare triple {3444#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3444#true} is VALID [2018-11-23 13:03:24,712 INFO L273 TraceCheckUtils]: 29: Hoare triple {3444#true} assume !(~i~0 < ~n~0); {3444#true} is VALID [2018-11-23 13:03:24,712 INFO L273 TraceCheckUtils]: 30: Hoare triple {3444#true} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3444#true} is VALID [2018-11-23 13:03:24,712 INFO L273 TraceCheckUtils]: 31: Hoare triple {3444#true} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {3444#true} is VALID [2018-11-23 13:03:24,712 INFO L273 TraceCheckUtils]: 32: Hoare triple {3444#true} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {3446#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:24,713 INFO L273 TraceCheckUtils]: 33: Hoare triple {3446#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3446#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:24,713 INFO L273 TraceCheckUtils]: 34: Hoare triple {3446#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3446#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:24,713 INFO L273 TraceCheckUtils]: 35: Hoare triple {3446#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3447#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:24,714 INFO L273 TraceCheckUtils]: 36: Hoare triple {3447#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} is VALID [2018-11-23 13:03:24,714 INFO L273 TraceCheckUtils]: 37: Hoare triple {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} is VALID [2018-11-23 13:03:24,715 INFO L273 TraceCheckUtils]: 38: Hoare triple {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} is VALID [2018-11-23 13:03:24,715 INFO L273 TraceCheckUtils]: 39: Hoare triple {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} assume !(~i~0 < ~n~0); {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} is VALID [2018-11-23 13:03:24,716 INFO L273 TraceCheckUtils]: 40: Hoare triple {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} is VALID [2018-11-23 13:03:24,716 INFO L273 TraceCheckUtils]: 41: Hoare triple {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {3449#(<= (+ SelectionSort_~lh~0 2) ~n~0)} is VALID [2018-11-23 13:03:24,717 INFO L273 TraceCheckUtils]: 42: Hoare triple {3449#(<= (+ SelectionSort_~lh~0 2) ~n~0)} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {3450#(<= (+ SelectionSort_~i~0 1) ~n~0)} is VALID [2018-11-23 13:03:24,718 INFO L273 TraceCheckUtils]: 43: Hoare triple {3450#(<= (+ SelectionSort_~i~0 1) ~n~0)} assume !(~i~0 < ~n~0); {3445#false} is VALID [2018-11-23 13:03:24,718 INFO L273 TraceCheckUtils]: 44: Hoare triple {3445#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3445#false} is VALID [2018-11-23 13:03:24,718 INFO L273 TraceCheckUtils]: 45: Hoare triple {3445#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {3445#false} is VALID [2018-11-23 13:03:24,719 INFO L273 TraceCheckUtils]: 46: Hoare triple {3445#false} assume !(~lh~0 < ~n~0); {3445#false} is VALID [2018-11-23 13:03:24,719 INFO L273 TraceCheckUtils]: 47: Hoare triple {3445#false} assume true; {3445#false} is VALID [2018-11-23 13:03:24,719 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {3445#false} {3444#true} #88#return; {3445#false} is VALID [2018-11-23 13:03:24,719 INFO L273 TraceCheckUtils]: 49: Hoare triple {3445#false} ~i~1 := 0; {3445#false} is VALID [2018-11-23 13:03:24,719 INFO L273 TraceCheckUtils]: 50: Hoare triple {3445#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3445#false} is VALID [2018-11-23 13:03:24,720 INFO L256 TraceCheckUtils]: 51: Hoare triple {3445#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {3445#false} is VALID [2018-11-23 13:03:24,720 INFO L273 TraceCheckUtils]: 52: Hoare triple {3445#false} ~cond := #in~cond; {3445#false} is VALID [2018-11-23 13:03:24,720 INFO L273 TraceCheckUtils]: 53: Hoare triple {3445#false} assume 0 == ~cond; {3445#false} is VALID [2018-11-23 13:03:24,720 INFO L273 TraceCheckUtils]: 54: Hoare triple {3445#false} assume !false; {3445#false} is VALID [2018-11-23 13:03:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-23 13:03:24,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:24,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:24,734 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:03:24,804 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 13:03:24,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:24,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:24,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {3444#true} call ULTIMATE.init(); {3444#true} is VALID [2018-11-23 13:03:24,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {3444#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {3444#true} is VALID [2018-11-23 13:03:24,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {3444#true} assume true; {3444#true} is VALID [2018-11-23 13:03:24,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3444#true} {3444#true} #84#return; {3444#true} is VALID [2018-11-23 13:03:24,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {3444#true} call #t~ret9 := main(); {3444#true} is VALID [2018-11-23 13:03:24,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {3444#true} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {3444#true} is VALID [2018-11-23 13:03:24,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {3444#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3444#true} is VALID [2018-11-23 13:03:24,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {3444#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3444#true} is VALID [2018-11-23 13:03:24,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {3444#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3444#true} is VALID [2018-11-23 13:03:24,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {3444#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3444#true} is VALID [2018-11-23 13:03:24,963 INFO L273 TraceCheckUtils]: 10: Hoare triple {3444#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3444#true} is VALID [2018-11-23 13:03:24,963 INFO L273 TraceCheckUtils]: 11: Hoare triple {3444#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3444#true} is VALID [2018-11-23 13:03:24,963 INFO L273 TraceCheckUtils]: 12: Hoare triple {3444#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3444#true} is VALID [2018-11-23 13:03:24,963 INFO L273 TraceCheckUtils]: 13: Hoare triple {3444#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3444#true} is VALID [2018-11-23 13:03:24,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {3444#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3444#true} is VALID [2018-11-23 13:03:24,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {3444#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3444#true} is VALID [2018-11-23 13:03:24,963 INFO L273 TraceCheckUtils]: 16: Hoare triple {3444#true} assume !(~i~1 >= 0); {3444#true} is VALID [2018-11-23 13:03:24,964 INFO L256 TraceCheckUtils]: 17: Hoare triple {3444#true} call SelectionSort(); {3444#true} is VALID [2018-11-23 13:03:24,964 INFO L273 TraceCheckUtils]: 18: Hoare triple {3444#true} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {3444#true} is VALID [2018-11-23 13:03:24,964 INFO L273 TraceCheckUtils]: 19: Hoare triple {3444#true} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {3444#true} is VALID [2018-11-23 13:03:24,964 INFO L273 TraceCheckUtils]: 20: Hoare triple {3444#true} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3444#true} is VALID [2018-11-23 13:03:24,964 INFO L273 TraceCheckUtils]: 21: Hoare triple {3444#true} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3444#true} is VALID [2018-11-23 13:03:24,964 INFO L273 TraceCheckUtils]: 22: Hoare triple {3444#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3444#true} is VALID [2018-11-23 13:03:24,965 INFO L273 TraceCheckUtils]: 23: Hoare triple {3444#true} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3444#true} is VALID [2018-11-23 13:03:24,965 INFO L273 TraceCheckUtils]: 24: Hoare triple {3444#true} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3444#true} is VALID [2018-11-23 13:03:24,965 INFO L273 TraceCheckUtils]: 25: Hoare triple {3444#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3444#true} is VALID [2018-11-23 13:03:24,966 INFO L273 TraceCheckUtils]: 26: Hoare triple {3444#true} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3450#(<= (+ SelectionSort_~i~0 1) ~n~0)} is VALID [2018-11-23 13:03:24,966 INFO L273 TraceCheckUtils]: 27: Hoare triple {3450#(<= (+ SelectionSort_~i~0 1) ~n~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3450#(<= (+ SelectionSort_~i~0 1) ~n~0)} is VALID [2018-11-23 13:03:24,967 INFO L273 TraceCheckUtils]: 28: Hoare triple {3450#(<= (+ SelectionSort_~i~0 1) ~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3538#(<= SelectionSort_~i~0 ~n~0)} is VALID [2018-11-23 13:03:24,967 INFO L273 TraceCheckUtils]: 29: Hoare triple {3538#(<= SelectionSort_~i~0 ~n~0)} assume !(~i~0 < ~n~0); {3444#true} is VALID [2018-11-23 13:03:24,967 INFO L273 TraceCheckUtils]: 30: Hoare triple {3444#true} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3444#true} is VALID [2018-11-23 13:03:24,967 INFO L273 TraceCheckUtils]: 31: Hoare triple {3444#true} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {3444#true} is VALID [2018-11-23 13:03:24,968 INFO L273 TraceCheckUtils]: 32: Hoare triple {3444#true} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {3446#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:24,968 INFO L273 TraceCheckUtils]: 33: Hoare triple {3446#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3446#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:24,968 INFO L273 TraceCheckUtils]: 34: Hoare triple {3446#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3446#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:24,969 INFO L273 TraceCheckUtils]: 35: Hoare triple {3446#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3447#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:24,970 INFO L273 TraceCheckUtils]: 36: Hoare triple {3447#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} is VALID [2018-11-23 13:03:24,970 INFO L273 TraceCheckUtils]: 37: Hoare triple {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} is VALID [2018-11-23 13:03:24,970 INFO L273 TraceCheckUtils]: 38: Hoare triple {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} is VALID [2018-11-23 13:03:24,971 INFO L273 TraceCheckUtils]: 39: Hoare triple {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} assume !(~i~0 < ~n~0); {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} is VALID [2018-11-23 13:03:24,971 INFO L273 TraceCheckUtils]: 40: Hoare triple {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} is VALID [2018-11-23 13:03:24,972 INFO L273 TraceCheckUtils]: 41: Hoare triple {3448#(<= (+ SelectionSort_~lh~0 3) ~n~0)} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {3449#(<= (+ SelectionSort_~lh~0 2) ~n~0)} is VALID [2018-11-23 13:03:24,973 INFO L273 TraceCheckUtils]: 42: Hoare triple {3449#(<= (+ SelectionSort_~lh~0 2) ~n~0)} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {3450#(<= (+ SelectionSort_~i~0 1) ~n~0)} is VALID [2018-11-23 13:03:24,974 INFO L273 TraceCheckUtils]: 43: Hoare triple {3450#(<= (+ SelectionSort_~i~0 1) ~n~0)} assume !(~i~0 < ~n~0); {3445#false} is VALID [2018-11-23 13:03:24,974 INFO L273 TraceCheckUtils]: 44: Hoare triple {3445#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3445#false} is VALID [2018-11-23 13:03:24,974 INFO L273 TraceCheckUtils]: 45: Hoare triple {3445#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {3445#false} is VALID [2018-11-23 13:03:24,974 INFO L273 TraceCheckUtils]: 46: Hoare triple {3445#false} assume !(~lh~0 < ~n~0); {3445#false} is VALID [2018-11-23 13:03:24,975 INFO L273 TraceCheckUtils]: 47: Hoare triple {3445#false} assume true; {3445#false} is VALID [2018-11-23 13:03:24,975 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {3445#false} {3444#true} #88#return; {3445#false} is VALID [2018-11-23 13:03:24,975 INFO L273 TraceCheckUtils]: 49: Hoare triple {3445#false} ~i~1 := 0; {3445#false} is VALID [2018-11-23 13:03:24,975 INFO L273 TraceCheckUtils]: 50: Hoare triple {3445#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3445#false} is VALID [2018-11-23 13:03:24,976 INFO L256 TraceCheckUtils]: 51: Hoare triple {3445#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {3445#false} is VALID [2018-11-23 13:03:24,976 INFO L273 TraceCheckUtils]: 52: Hoare triple {3445#false} ~cond := #in~cond; {3445#false} is VALID [2018-11-23 13:03:24,976 INFO L273 TraceCheckUtils]: 53: Hoare triple {3445#false} assume 0 == ~cond; {3445#false} is VALID [2018-11-23 13:03:24,977 INFO L273 TraceCheckUtils]: 54: Hoare triple {3445#false} assume !false; {3445#false} is VALID [2018-11-23 13:03:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 40 proven. 14 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 13:03:25,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:25,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 8 [2018-11-23 13:03:25,007 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-11-23 13:03:25,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:25,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:03:25,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:25,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:03:25,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:03:25,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:03:25,060 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand 8 states. [2018-11-23 13:03:25,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:25,555 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2018-11-23 13:03:25,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:03:25,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2018-11-23 13:03:25,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:03:25,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2018-11-23 13:03:25,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:03:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2018-11-23 13:03:25,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2018-11-23 13:03:25,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:25,634 INFO L225 Difference]: With dead ends: 83 [2018-11-23 13:03:25,634 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 13:03:25,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:03:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 13:03:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-23 13:03:25,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:25,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 67 states. [2018-11-23 13:03:25,784 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 13:03:25,784 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 13:03:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:25,787 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-11-23 13:03:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-11-23 13:03:25,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:25,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:25,787 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 67 states. [2018-11-23 13:03:25,787 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 67 states. [2018-11-23 13:03:25,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:25,789 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2018-11-23 13:03:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-11-23 13:03:25,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:25,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:25,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:25,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:25,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 13:03:25,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-11-23 13:03:25,791 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 55 [2018-11-23 13:03:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:25,792 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-11-23 13:03:25,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:03:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-11-23 13:03:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 13:03:25,793 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:25,793 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:25,793 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:25,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:25,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1704935675, now seen corresponding path program 6 times [2018-11-23 13:03:25,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:25,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:25,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:25,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:25,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:26,076 INFO L256 TraceCheckUtils]: 0: Hoare triple {3978#true} call ULTIMATE.init(); {3978#true} is VALID [2018-11-23 13:03:26,077 INFO L273 TraceCheckUtils]: 1: Hoare triple {3978#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,078 INFO L273 TraceCheckUtils]: 2: Hoare triple {3980#(<= 5 ~n~0)} assume true; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,079 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3980#(<= 5 ~n~0)} {3978#true} #84#return; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,082 INFO L256 TraceCheckUtils]: 4: Hoare triple {3980#(<= 5 ~n~0)} call #t~ret9 := main(); {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,082 INFO L273 TraceCheckUtils]: 5: Hoare triple {3980#(<= 5 ~n~0)} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,082 INFO L273 TraceCheckUtils]: 6: Hoare triple {3980#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,083 INFO L273 TraceCheckUtils]: 7: Hoare triple {3980#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,083 INFO L273 TraceCheckUtils]: 8: Hoare triple {3980#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,083 INFO L273 TraceCheckUtils]: 9: Hoare triple {3980#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,084 INFO L273 TraceCheckUtils]: 10: Hoare triple {3980#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,084 INFO L273 TraceCheckUtils]: 11: Hoare triple {3980#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,084 INFO L273 TraceCheckUtils]: 12: Hoare triple {3980#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,085 INFO L273 TraceCheckUtils]: 13: Hoare triple {3980#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,085 INFO L273 TraceCheckUtils]: 14: Hoare triple {3980#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,085 INFO L273 TraceCheckUtils]: 15: Hoare triple {3980#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,085 INFO L273 TraceCheckUtils]: 16: Hoare triple {3980#(<= 5 ~n~0)} assume !(~i~1 >= 0); {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,086 INFO L256 TraceCheckUtils]: 17: Hoare triple {3980#(<= 5 ~n~0)} call SelectionSort(); {3978#true} is VALID [2018-11-23 13:03:26,086 INFO L273 TraceCheckUtils]: 18: Hoare triple {3978#true} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {3981#(= SelectionSort_~lh~0 0)} is VALID [2018-11-23 13:03:26,087 INFO L273 TraceCheckUtils]: 19: Hoare triple {3981#(= SelectionSort_~lh~0 0)} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {3982#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 1)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:26,088 INFO L273 TraceCheckUtils]: 20: Hoare triple {3982#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 1)) (= SelectionSort_~lh~0 0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3982#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 1)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:26,089 INFO L273 TraceCheckUtils]: 21: Hoare triple {3982#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 1)) (= SelectionSort_~lh~0 0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3982#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 1)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:26,089 INFO L273 TraceCheckUtils]: 22: Hoare triple {3982#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 1)) (= SelectionSort_~lh~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3983#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 2)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:26,090 INFO L273 TraceCheckUtils]: 23: Hoare triple {3983#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 2)) (= SelectionSort_~lh~0 0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3983#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 2)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:26,091 INFO L273 TraceCheckUtils]: 24: Hoare triple {3983#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 2)) (= SelectionSort_~lh~0 0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3983#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 2)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:26,092 INFO L273 TraceCheckUtils]: 25: Hoare triple {3983#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 2)) (= SelectionSort_~lh~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3984#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 3)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:26,093 INFO L273 TraceCheckUtils]: 26: Hoare triple {3984#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 3)) (= SelectionSort_~lh~0 0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3984#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 3)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:26,094 INFO L273 TraceCheckUtils]: 27: Hoare triple {3984#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 3)) (= SelectionSort_~lh~0 0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3984#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 3)) (= SelectionSort_~lh~0 0))} is VALID [2018-11-23 13:03:26,094 INFO L273 TraceCheckUtils]: 28: Hoare triple {3984#(and (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 3)) (= SelectionSort_~lh~0 0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3985#(and (= SelectionSort_~lh~0 0) (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 4)))} is VALID [2018-11-23 13:03:26,095 INFO L273 TraceCheckUtils]: 29: Hoare triple {3985#(and (= SelectionSort_~lh~0 0) (<= SelectionSort_~i~0 (+ SelectionSort_~lh~0 4)))} assume !(~i~0 < ~n~0); {3986#(and (= SelectionSort_~lh~0 0) (<= ~n~0 (+ SelectionSort_~lh~0 4)))} is VALID [2018-11-23 13:03:26,096 INFO L273 TraceCheckUtils]: 30: Hoare triple {3986#(and (= SelectionSort_~lh~0 0) (<= ~n~0 (+ SelectionSort_~lh~0 4)))} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3986#(and (= SelectionSort_~lh~0 0) (<= ~n~0 (+ SelectionSort_~lh~0 4)))} is VALID [2018-11-23 13:03:26,097 INFO L273 TraceCheckUtils]: 31: Hoare triple {3986#(and (= SelectionSort_~lh~0 0) (<= ~n~0 (+ SelectionSort_~lh~0 4)))} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,098 INFO L273 TraceCheckUtils]: 32: Hoare triple {3987#(<= ~n~0 4)} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,098 INFO L273 TraceCheckUtils]: 33: Hoare triple {3987#(<= ~n~0 4)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,099 INFO L273 TraceCheckUtils]: 34: Hoare triple {3987#(<= ~n~0 4)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,099 INFO L273 TraceCheckUtils]: 35: Hoare triple {3987#(<= ~n~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,100 INFO L273 TraceCheckUtils]: 36: Hoare triple {3987#(<= ~n~0 4)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,100 INFO L273 TraceCheckUtils]: 37: Hoare triple {3987#(<= ~n~0 4)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,101 INFO L273 TraceCheckUtils]: 38: Hoare triple {3987#(<= ~n~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,101 INFO L273 TraceCheckUtils]: 39: Hoare triple {3987#(<= ~n~0 4)} assume !(~i~0 < ~n~0); {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,102 INFO L273 TraceCheckUtils]: 40: Hoare triple {3987#(<= ~n~0 4)} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,102 INFO L273 TraceCheckUtils]: 41: Hoare triple {3987#(<= ~n~0 4)} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,103 INFO L273 TraceCheckUtils]: 42: Hoare triple {3987#(<= ~n~0 4)} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,103 INFO L273 TraceCheckUtils]: 43: Hoare triple {3987#(<= ~n~0 4)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,104 INFO L273 TraceCheckUtils]: 44: Hoare triple {3987#(<= ~n~0 4)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,105 INFO L273 TraceCheckUtils]: 45: Hoare triple {3987#(<= ~n~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,105 INFO L273 TraceCheckUtils]: 46: Hoare triple {3987#(<= ~n~0 4)} assume !(~i~0 < ~n~0); {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,106 INFO L273 TraceCheckUtils]: 47: Hoare triple {3987#(<= ~n~0 4)} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,106 INFO L273 TraceCheckUtils]: 48: Hoare triple {3987#(<= ~n~0 4)} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,107 INFO L273 TraceCheckUtils]: 49: Hoare triple {3987#(<= ~n~0 4)} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,107 INFO L273 TraceCheckUtils]: 50: Hoare triple {3987#(<= ~n~0 4)} assume !(~i~0 < ~n~0); {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,108 INFO L273 TraceCheckUtils]: 51: Hoare triple {3987#(<= ~n~0 4)} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,108 INFO L273 TraceCheckUtils]: 52: Hoare triple {3987#(<= ~n~0 4)} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,109 INFO L273 TraceCheckUtils]: 53: Hoare triple {3987#(<= ~n~0 4)} assume !(~lh~0 < ~n~0); {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,109 INFO L273 TraceCheckUtils]: 54: Hoare triple {3987#(<= ~n~0 4)} assume true; {3987#(<= ~n~0 4)} is VALID [2018-11-23 13:03:26,110 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {3987#(<= ~n~0 4)} {3980#(<= 5 ~n~0)} #88#return; {3979#false} is VALID [2018-11-23 13:03:26,110 INFO L273 TraceCheckUtils]: 56: Hoare triple {3979#false} ~i~1 := 0; {3979#false} is VALID [2018-11-23 13:03:26,111 INFO L273 TraceCheckUtils]: 57: Hoare triple {3979#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3979#false} is VALID [2018-11-23 13:03:26,111 INFO L256 TraceCheckUtils]: 58: Hoare triple {3979#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {3979#false} is VALID [2018-11-23 13:03:26,111 INFO L273 TraceCheckUtils]: 59: Hoare triple {3979#false} ~cond := #in~cond; {3979#false} is VALID [2018-11-23 13:03:26,111 INFO L273 TraceCheckUtils]: 60: Hoare triple {3979#false} assume 0 == ~cond; {3979#false} is VALID [2018-11-23 13:03:26,112 INFO L273 TraceCheckUtils]: 61: Hoare triple {3979#false} assume !false; {3979#false} is VALID [2018-11-23 13:03:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-11-23 13:03:26,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:26,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:26,125 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:03:26,191 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-11-23 13:03:26,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:26,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:26,369 INFO L256 TraceCheckUtils]: 0: Hoare triple {3978#true} call ULTIMATE.init(); {3978#true} is VALID [2018-11-23 13:03:26,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {3978#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,371 INFO L273 TraceCheckUtils]: 2: Hoare triple {3980#(<= 5 ~n~0)} assume true; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,372 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3980#(<= 5 ~n~0)} {3978#true} #84#return; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {3980#(<= 5 ~n~0)} call #t~ret9 := main(); {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {3980#(<= 5 ~n~0)} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,377 INFO L273 TraceCheckUtils]: 6: Hoare triple {3980#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,383 INFO L273 TraceCheckUtils]: 7: Hoare triple {3980#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {3980#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,388 INFO L273 TraceCheckUtils]: 9: Hoare triple {3980#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {3980#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {3980#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {3980#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {3980#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,397 INFO L273 TraceCheckUtils]: 14: Hoare triple {3980#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,403 INFO L273 TraceCheckUtils]: 15: Hoare triple {3980#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,403 INFO L273 TraceCheckUtils]: 16: Hoare triple {3980#(<= 5 ~n~0)} assume !(~i~1 >= 0); {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,403 INFO L256 TraceCheckUtils]: 17: Hoare triple {3980#(<= 5 ~n~0)} call SelectionSort(); {3980#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:26,405 INFO L273 TraceCheckUtils]: 18: Hoare triple {3980#(<= 5 ~n~0)} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {4045#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:26,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {4045#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {4049#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:26,410 INFO L273 TraceCheckUtils]: 20: Hoare triple {4049#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4049#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:26,413 INFO L273 TraceCheckUtils]: 21: Hoare triple {4049#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4049#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:26,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {4049#(and (<= SelectionSort_~i~0 1) (<= 5 ~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4059#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:26,416 INFO L273 TraceCheckUtils]: 23: Hoare triple {4059#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4059#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:26,416 INFO L273 TraceCheckUtils]: 24: Hoare triple {4059#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4059#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:26,419 INFO L273 TraceCheckUtils]: 25: Hoare triple {4059#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4069#(and (<= SelectionSort_~i~0 3) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:26,419 INFO L273 TraceCheckUtils]: 26: Hoare triple {4069#(and (<= SelectionSort_~i~0 3) (<= 5 ~n~0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4069#(and (<= SelectionSort_~i~0 3) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:26,420 INFO L273 TraceCheckUtils]: 27: Hoare triple {4069#(and (<= SelectionSort_~i~0 3) (<= 5 ~n~0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4069#(and (<= SelectionSort_~i~0 3) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:26,420 INFO L273 TraceCheckUtils]: 28: Hoare triple {4069#(and (<= SelectionSort_~i~0 3) (<= 5 ~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4079#(and (<= 5 ~n~0) (<= SelectionSort_~i~0 4))} is VALID [2018-11-23 13:03:26,421 INFO L273 TraceCheckUtils]: 29: Hoare triple {4079#(and (<= 5 ~n~0) (<= SelectionSort_~i~0 4))} assume !(~i~0 < ~n~0); {3979#false} is VALID [2018-11-23 13:03:26,421 INFO L273 TraceCheckUtils]: 30: Hoare triple {3979#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3979#false} is VALID [2018-11-23 13:03:26,421 INFO L273 TraceCheckUtils]: 31: Hoare triple {3979#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {3979#false} is VALID [2018-11-23 13:03:26,421 INFO L273 TraceCheckUtils]: 32: Hoare triple {3979#false} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {3979#false} is VALID [2018-11-23 13:03:26,421 INFO L273 TraceCheckUtils]: 33: Hoare triple {3979#false} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3979#false} is VALID [2018-11-23 13:03:26,421 INFO L273 TraceCheckUtils]: 34: Hoare triple {3979#false} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3979#false} is VALID [2018-11-23 13:03:26,422 INFO L273 TraceCheckUtils]: 35: Hoare triple {3979#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3979#false} is VALID [2018-11-23 13:03:26,422 INFO L273 TraceCheckUtils]: 36: Hoare triple {3979#false} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3979#false} is VALID [2018-11-23 13:03:26,422 INFO L273 TraceCheckUtils]: 37: Hoare triple {3979#false} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3979#false} is VALID [2018-11-23 13:03:26,422 INFO L273 TraceCheckUtils]: 38: Hoare triple {3979#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3979#false} is VALID [2018-11-23 13:03:26,422 INFO L273 TraceCheckUtils]: 39: Hoare triple {3979#false} assume !(~i~0 < ~n~0); {3979#false} is VALID [2018-11-23 13:03:26,422 INFO L273 TraceCheckUtils]: 40: Hoare triple {3979#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3979#false} is VALID [2018-11-23 13:03:26,423 INFO L273 TraceCheckUtils]: 41: Hoare triple {3979#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {3979#false} is VALID [2018-11-23 13:03:26,423 INFO L273 TraceCheckUtils]: 42: Hoare triple {3979#false} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {3979#false} is VALID [2018-11-23 13:03:26,423 INFO L273 TraceCheckUtils]: 43: Hoare triple {3979#false} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3979#false} is VALID [2018-11-23 13:03:26,423 INFO L273 TraceCheckUtils]: 44: Hoare triple {3979#false} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {3979#false} is VALID [2018-11-23 13:03:26,423 INFO L273 TraceCheckUtils]: 45: Hoare triple {3979#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3979#false} is VALID [2018-11-23 13:03:26,424 INFO L273 TraceCheckUtils]: 46: Hoare triple {3979#false} assume !(~i~0 < ~n~0); {3979#false} is VALID [2018-11-23 13:03:26,424 INFO L273 TraceCheckUtils]: 47: Hoare triple {3979#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3979#false} is VALID [2018-11-23 13:03:26,424 INFO L273 TraceCheckUtils]: 48: Hoare triple {3979#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {3979#false} is VALID [2018-11-23 13:03:26,424 INFO L273 TraceCheckUtils]: 49: Hoare triple {3979#false} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {3979#false} is VALID [2018-11-23 13:03:26,424 INFO L273 TraceCheckUtils]: 50: Hoare triple {3979#false} assume !(~i~0 < ~n~0); {3979#false} is VALID [2018-11-23 13:03:26,424 INFO L273 TraceCheckUtils]: 51: Hoare triple {3979#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {3979#false} is VALID [2018-11-23 13:03:26,425 INFO L273 TraceCheckUtils]: 52: Hoare triple {3979#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {3979#false} is VALID [2018-11-23 13:03:26,425 INFO L273 TraceCheckUtils]: 53: Hoare triple {3979#false} assume !(~lh~0 < ~n~0); {3979#false} is VALID [2018-11-23 13:03:26,425 INFO L273 TraceCheckUtils]: 54: Hoare triple {3979#false} assume true; {3979#false} is VALID [2018-11-23 13:03:26,425 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {3979#false} {3980#(<= 5 ~n~0)} #88#return; {3979#false} is VALID [2018-11-23 13:03:26,425 INFO L273 TraceCheckUtils]: 56: Hoare triple {3979#false} ~i~1 := 0; {3979#false} is VALID [2018-11-23 13:03:26,426 INFO L273 TraceCheckUtils]: 57: Hoare triple {3979#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {3979#false} is VALID [2018-11-23 13:03:26,426 INFO L256 TraceCheckUtils]: 58: Hoare triple {3979#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {3979#false} is VALID [2018-11-23 13:03:26,426 INFO L273 TraceCheckUtils]: 59: Hoare triple {3979#false} ~cond := #in~cond; {3979#false} is VALID [2018-11-23 13:03:26,426 INFO L273 TraceCheckUtils]: 60: Hoare triple {3979#false} assume 0 == ~cond; {3979#false} is VALID [2018-11-23 13:03:26,426 INFO L273 TraceCheckUtils]: 61: Hoare triple {3979#false} assume !false; {3979#false} is VALID [2018-11-23 13:03:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 46 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 13:03:26,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:26,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2018-11-23 13:03:26,462 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-11-23 13:03:26,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:26,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:03:26,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:26,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:03:26,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:03:26,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:03:26,593 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 15 states. [2018-11-23 13:03:27,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:27,210 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2018-11-23 13:03:27,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:03:27,210 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-11-23 13:03:27,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:03:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2018-11-23 13:03:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:03:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2018-11-23 13:03:27,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2018-11-23 13:03:27,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:27,378 INFO L225 Difference]: With dead ends: 117 [2018-11-23 13:03:27,378 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 13:03:27,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:03:27,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 13:03:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2018-11-23 13:03:27,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:27,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 70 states. [2018-11-23 13:03:27,554 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 70 states. [2018-11-23 13:03:27,554 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 70 states. [2018-11-23 13:03:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:27,556 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-11-23 13:03:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-11-23 13:03:27,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:27,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:27,556 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 77 states. [2018-11-23 13:03:27,556 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 77 states. [2018-11-23 13:03:27,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:27,558 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-11-23 13:03:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2018-11-23 13:03:27,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:27,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:27,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:27,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 13:03:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2018-11-23 13:03:27,560 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 62 [2018-11-23 13:03:27,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:27,560 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2018-11-23 13:03:27,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:03:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2018-11-23 13:03:27,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 13:03:27,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:27,561 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:27,562 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:27,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:27,562 INFO L82 PathProgramCache]: Analyzing trace with hash 788547955, now seen corresponding path program 7 times [2018-11-23 13:03:27,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:27,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:27,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:27,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:03:27,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:28,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {4606#true} call ULTIMATE.init(); {4606#true} is VALID [2018-11-23 13:03:28,614 INFO L273 TraceCheckUtils]: 1: Hoare triple {4606#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {4606#true} is VALID [2018-11-23 13:03:28,614 INFO L273 TraceCheckUtils]: 2: Hoare triple {4606#true} assume true; {4606#true} is VALID [2018-11-23 13:03:28,614 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4606#true} {4606#true} #84#return; {4606#true} is VALID [2018-11-23 13:03:28,614 INFO L256 TraceCheckUtils]: 4: Hoare triple {4606#true} call #t~ret9 := main(); {4606#true} is VALID [2018-11-23 13:03:28,614 INFO L273 TraceCheckUtils]: 5: Hoare triple {4606#true} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {4606#true} is VALID [2018-11-23 13:03:28,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {4606#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {4606#true} is VALID [2018-11-23 13:03:28,615 INFO L273 TraceCheckUtils]: 7: Hoare triple {4606#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {4606#true} is VALID [2018-11-23 13:03:28,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {4606#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {4606#true} is VALID [2018-11-23 13:03:28,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {4606#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {4606#true} is VALID [2018-11-23 13:03:28,615 INFO L273 TraceCheckUtils]: 10: Hoare triple {4606#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {4606#true} is VALID [2018-11-23 13:03:28,615 INFO L273 TraceCheckUtils]: 11: Hoare triple {4606#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {4606#true} is VALID [2018-11-23 13:03:28,616 INFO L273 TraceCheckUtils]: 12: Hoare triple {4606#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {4606#true} is VALID [2018-11-23 13:03:28,616 INFO L273 TraceCheckUtils]: 13: Hoare triple {4606#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {4606#true} is VALID [2018-11-23 13:03:28,616 INFO L273 TraceCheckUtils]: 14: Hoare triple {4606#true} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {4606#true} is VALID [2018-11-23 13:03:28,616 INFO L273 TraceCheckUtils]: 15: Hoare triple {4606#true} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {4606#true} is VALID [2018-11-23 13:03:28,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {4606#true} assume !(~i~1 >= 0); {4606#true} is VALID [2018-11-23 13:03:28,616 INFO L256 TraceCheckUtils]: 17: Hoare triple {4606#true} call SelectionSort(); {4606#true} is VALID [2018-11-23 13:03:28,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {4606#true} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {4606#true} is VALID [2018-11-23 13:03:28,617 INFO L273 TraceCheckUtils]: 19: Hoare triple {4606#true} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {4608#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:28,617 INFO L273 TraceCheckUtils]: 20: Hoare triple {4608#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4608#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:28,617 INFO L273 TraceCheckUtils]: 21: Hoare triple {4608#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4608#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:28,618 INFO L273 TraceCheckUtils]: 22: Hoare triple {4608#(<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4609#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:28,619 INFO L273 TraceCheckUtils]: 23: Hoare triple {4609#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4609#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:28,619 INFO L273 TraceCheckUtils]: 24: Hoare triple {4609#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4609#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:28,620 INFO L273 TraceCheckUtils]: 25: Hoare triple {4609#(<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4610#(<= (+ SelectionSort_~lh~0 3) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:28,620 INFO L273 TraceCheckUtils]: 26: Hoare triple {4610#(<= (+ SelectionSort_~lh~0 3) SelectionSort_~i~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4610#(<= (+ SelectionSort_~lh~0 3) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:28,621 INFO L273 TraceCheckUtils]: 27: Hoare triple {4610#(<= (+ SelectionSort_~lh~0 3) SelectionSort_~i~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4610#(<= (+ SelectionSort_~lh~0 3) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:28,625 INFO L273 TraceCheckUtils]: 28: Hoare triple {4610#(<= (+ SelectionSort_~lh~0 3) SelectionSort_~i~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4611#(<= (+ SelectionSort_~lh~0 4) SelectionSort_~i~0)} is VALID [2018-11-23 13:03:28,626 INFO L273 TraceCheckUtils]: 29: Hoare triple {4611#(<= (+ SelectionSort_~lh~0 4) SelectionSort_~i~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4612#(<= (+ SelectionSort_~lh~0 5) ~n~0)} is VALID [2018-11-23 13:03:28,626 INFO L273 TraceCheckUtils]: 30: Hoare triple {4612#(<= (+ SelectionSort_~lh~0 5) ~n~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4612#(<= (+ SelectionSort_~lh~0 5) ~n~0)} is VALID [2018-11-23 13:03:28,626 INFO L273 TraceCheckUtils]: 31: Hoare triple {4612#(<= (+ SelectionSort_~lh~0 5) ~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4612#(<= (+ SelectionSort_~lh~0 5) ~n~0)} is VALID [2018-11-23 13:03:28,627 INFO L273 TraceCheckUtils]: 32: Hoare triple {4612#(<= (+ SelectionSort_~lh~0 5) ~n~0)} assume !(~i~0 < ~n~0); {4612#(<= (+ SelectionSort_~lh~0 5) ~n~0)} is VALID [2018-11-23 13:03:28,627 INFO L273 TraceCheckUtils]: 33: Hoare triple {4612#(<= (+ SelectionSort_~lh~0 5) ~n~0)} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4612#(<= (+ SelectionSort_~lh~0 5) ~n~0)} is VALID [2018-11-23 13:03:28,629 INFO L273 TraceCheckUtils]: 34: Hoare triple {4612#(<= (+ SelectionSort_~lh~0 5) ~n~0)} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {4613#(<= (+ SelectionSort_~lh~0 4) ~n~0)} is VALID [2018-11-23 13:03:28,631 INFO L273 TraceCheckUtils]: 35: Hoare triple {4613#(<= (+ SelectionSort_~lh~0 4) ~n~0)} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {4614#(<= (+ SelectionSort_~i~0 3) ~n~0)} is VALID [2018-11-23 13:03:28,631 INFO L273 TraceCheckUtils]: 36: Hoare triple {4614#(<= (+ SelectionSort_~i~0 3) ~n~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4614#(<= (+ SelectionSort_~i~0 3) ~n~0)} is VALID [2018-11-23 13:03:28,633 INFO L273 TraceCheckUtils]: 37: Hoare triple {4614#(<= (+ SelectionSort_~i~0 3) ~n~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4614#(<= (+ SelectionSort_~i~0 3) ~n~0)} is VALID [2018-11-23 13:03:28,633 INFO L273 TraceCheckUtils]: 38: Hoare triple {4614#(<= (+ SelectionSort_~i~0 3) ~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4615#(<= (+ SelectionSort_~i~0 2) ~n~0)} is VALID [2018-11-23 13:03:28,635 INFO L273 TraceCheckUtils]: 39: Hoare triple {4615#(<= (+ SelectionSort_~i~0 2) ~n~0)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4615#(<= (+ SelectionSort_~i~0 2) ~n~0)} is VALID [2018-11-23 13:03:28,635 INFO L273 TraceCheckUtils]: 40: Hoare triple {4615#(<= (+ SelectionSort_~i~0 2) ~n~0)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4615#(<= (+ SelectionSort_~i~0 2) ~n~0)} is VALID [2018-11-23 13:03:28,637 INFO L273 TraceCheckUtils]: 41: Hoare triple {4615#(<= (+ SelectionSort_~i~0 2) ~n~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4616#(<= (+ SelectionSort_~i~0 1) ~n~0)} is VALID [2018-11-23 13:03:28,637 INFO L273 TraceCheckUtils]: 42: Hoare triple {4616#(<= (+ SelectionSort_~i~0 1) ~n~0)} assume !(~i~0 < ~n~0); {4607#false} is VALID [2018-11-23 13:03:28,637 INFO L273 TraceCheckUtils]: 43: Hoare triple {4607#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4607#false} is VALID [2018-11-23 13:03:28,637 INFO L273 TraceCheckUtils]: 44: Hoare triple {4607#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {4607#false} is VALID [2018-11-23 13:03:28,637 INFO L273 TraceCheckUtils]: 45: Hoare triple {4607#false} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {4607#false} is VALID [2018-11-23 13:03:28,638 INFO L273 TraceCheckUtils]: 46: Hoare triple {4607#false} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4607#false} is VALID [2018-11-23 13:03:28,638 INFO L273 TraceCheckUtils]: 47: Hoare triple {4607#false} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4607#false} is VALID [2018-11-23 13:03:28,638 INFO L273 TraceCheckUtils]: 48: Hoare triple {4607#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4607#false} is VALID [2018-11-23 13:03:28,638 INFO L273 TraceCheckUtils]: 49: Hoare triple {4607#false} assume !(~i~0 < ~n~0); {4607#false} is VALID [2018-11-23 13:03:28,638 INFO L273 TraceCheckUtils]: 50: Hoare triple {4607#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4607#false} is VALID [2018-11-23 13:03:28,638 INFO L273 TraceCheckUtils]: 51: Hoare triple {4607#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {4607#false} is VALID [2018-11-23 13:03:28,638 INFO L273 TraceCheckUtils]: 52: Hoare triple {4607#false} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {4607#false} is VALID [2018-11-23 13:03:28,638 INFO L273 TraceCheckUtils]: 53: Hoare triple {4607#false} assume !(~i~0 < ~n~0); {4607#false} is VALID [2018-11-23 13:03:28,639 INFO L273 TraceCheckUtils]: 54: Hoare triple {4607#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4607#false} is VALID [2018-11-23 13:03:28,639 INFO L273 TraceCheckUtils]: 55: Hoare triple {4607#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {4607#false} is VALID [2018-11-23 13:03:28,639 INFO L273 TraceCheckUtils]: 56: Hoare triple {4607#false} assume !(~lh~0 < ~n~0); {4607#false} is VALID [2018-11-23 13:03:28,639 INFO L273 TraceCheckUtils]: 57: Hoare triple {4607#false} assume true; {4607#false} is VALID [2018-11-23 13:03:28,639 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {4607#false} {4606#true} #88#return; {4607#false} is VALID [2018-11-23 13:03:28,639 INFO L273 TraceCheckUtils]: 59: Hoare triple {4607#false} ~i~1 := 0; {4607#false} is VALID [2018-11-23 13:03:28,639 INFO L273 TraceCheckUtils]: 60: Hoare triple {4607#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {4607#false} is VALID [2018-11-23 13:03:28,639 INFO L256 TraceCheckUtils]: 61: Hoare triple {4607#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {4607#false} is VALID [2018-11-23 13:03:28,640 INFO L273 TraceCheckUtils]: 62: Hoare triple {4607#false} ~cond := #in~cond; {4607#false} is VALID [2018-11-23 13:03:28,640 INFO L273 TraceCheckUtils]: 63: Hoare triple {4607#false} assume 0 == ~cond; {4607#false} is VALID [2018-11-23 13:03:28,640 INFO L273 TraceCheckUtils]: 64: Hoare triple {4607#false} assume !false; {4607#false} is VALID [2018-11-23 13:03:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 61 proven. 46 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 13:03:28,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:28,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:28,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:28,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:28,975 INFO L256 TraceCheckUtils]: 0: Hoare triple {4606#true} call ULTIMATE.init(); {4606#true} is VALID [2018-11-23 13:03:28,977 INFO L273 TraceCheckUtils]: 1: Hoare triple {4606#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,977 INFO L273 TraceCheckUtils]: 2: Hoare triple {4623#(<= 5 ~n~0)} assume true; {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,978 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4623#(<= 5 ~n~0)} {4606#true} #84#return; {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,978 INFO L256 TraceCheckUtils]: 4: Hoare triple {4623#(<= 5 ~n~0)} call #t~ret9 := main(); {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,979 INFO L273 TraceCheckUtils]: 5: Hoare triple {4623#(<= 5 ~n~0)} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,979 INFO L273 TraceCheckUtils]: 6: Hoare triple {4623#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,980 INFO L273 TraceCheckUtils]: 7: Hoare triple {4623#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,980 INFO L273 TraceCheckUtils]: 8: Hoare triple {4623#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {4623#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {4623#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {4623#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,983 INFO L273 TraceCheckUtils]: 12: Hoare triple {4623#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,983 INFO L273 TraceCheckUtils]: 13: Hoare triple {4623#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,984 INFO L273 TraceCheckUtils]: 14: Hoare triple {4623#(<= 5 ~n~0)} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {4623#(<= 5 ~n~0)} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,984 INFO L273 TraceCheckUtils]: 16: Hoare triple {4623#(<= 5 ~n~0)} assume !(~i~1 >= 0); {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,985 INFO L256 TraceCheckUtils]: 17: Hoare triple {4623#(<= 5 ~n~0)} call SelectionSort(); {4623#(<= 5 ~n~0)} is VALID [2018-11-23 13:03:28,986 INFO L273 TraceCheckUtils]: 18: Hoare triple {4623#(<= 5 ~n~0)} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,986 INFO L273 TraceCheckUtils]: 19: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,987 INFO L273 TraceCheckUtils]: 20: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,988 INFO L273 TraceCheckUtils]: 21: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,989 INFO L273 TraceCheckUtils]: 22: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,989 INFO L273 TraceCheckUtils]: 23: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,990 INFO L273 TraceCheckUtils]: 24: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,991 INFO L273 TraceCheckUtils]: 25: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,991 INFO L273 TraceCheckUtils]: 26: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,992 INFO L273 TraceCheckUtils]: 27: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,993 INFO L273 TraceCheckUtils]: 28: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,993 INFO L273 TraceCheckUtils]: 29: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,994 INFO L273 TraceCheckUtils]: 30: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,995 INFO L273 TraceCheckUtils]: 31: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,995 INFO L273 TraceCheckUtils]: 32: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} assume !(~i~0 < ~n~0); {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,996 INFO L273 TraceCheckUtils]: 33: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,997 INFO L273 TraceCheckUtils]: 34: Hoare triple {4675#(and (<= SelectionSort_~lh~0 0) (<= 5 ~n~0))} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {4724#(and (<= SelectionSort_~lh~0 1) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,998 INFO L273 TraceCheckUtils]: 35: Hoare triple {4724#(and (<= SelectionSort_~lh~0 1) (<= 5 ~n~0))} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {4728#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,999 INFO L273 TraceCheckUtils]: 36: Hoare triple {4728#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4728#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:28,999 INFO L273 TraceCheckUtils]: 37: Hoare triple {4728#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4728#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:29,000 INFO L273 TraceCheckUtils]: 38: Hoare triple {4728#(and (<= SelectionSort_~i~0 2) (<= 5 ~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4738#(and (<= SelectionSort_~i~0 3) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:29,001 INFO L273 TraceCheckUtils]: 39: Hoare triple {4738#(and (<= SelectionSort_~i~0 3) (<= 5 ~n~0))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4738#(and (<= SelectionSort_~i~0 3) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:29,002 INFO L273 TraceCheckUtils]: 40: Hoare triple {4738#(and (<= SelectionSort_~i~0 3) (<= 5 ~n~0))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4738#(and (<= SelectionSort_~i~0 3) (<= 5 ~n~0))} is VALID [2018-11-23 13:03:29,003 INFO L273 TraceCheckUtils]: 41: Hoare triple {4738#(and (<= SelectionSort_~i~0 3) (<= 5 ~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4748#(and (<= 5 ~n~0) (<= SelectionSort_~i~0 4))} is VALID [2018-11-23 13:03:29,003 INFO L273 TraceCheckUtils]: 42: Hoare triple {4748#(and (<= 5 ~n~0) (<= SelectionSort_~i~0 4))} assume !(~i~0 < ~n~0); {4607#false} is VALID [2018-11-23 13:03:29,004 INFO L273 TraceCheckUtils]: 43: Hoare triple {4607#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4607#false} is VALID [2018-11-23 13:03:29,004 INFO L273 TraceCheckUtils]: 44: Hoare triple {4607#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {4607#false} is VALID [2018-11-23 13:03:29,004 INFO L273 TraceCheckUtils]: 45: Hoare triple {4607#false} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {4607#false} is VALID [2018-11-23 13:03:29,004 INFO L273 TraceCheckUtils]: 46: Hoare triple {4607#false} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4607#false} is VALID [2018-11-23 13:03:29,004 INFO L273 TraceCheckUtils]: 47: Hoare triple {4607#false} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {4607#false} is VALID [2018-11-23 13:03:29,005 INFO L273 TraceCheckUtils]: 48: Hoare triple {4607#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4607#false} is VALID [2018-11-23 13:03:29,005 INFO L273 TraceCheckUtils]: 49: Hoare triple {4607#false} assume !(~i~0 < ~n~0); {4607#false} is VALID [2018-11-23 13:03:29,005 INFO L273 TraceCheckUtils]: 50: Hoare triple {4607#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4607#false} is VALID [2018-11-23 13:03:29,005 INFO L273 TraceCheckUtils]: 51: Hoare triple {4607#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {4607#false} is VALID [2018-11-23 13:03:29,005 INFO L273 TraceCheckUtils]: 52: Hoare triple {4607#false} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {4607#false} is VALID [2018-11-23 13:03:29,006 INFO L273 TraceCheckUtils]: 53: Hoare triple {4607#false} assume !(~i~0 < ~n~0); {4607#false} is VALID [2018-11-23 13:03:29,006 INFO L273 TraceCheckUtils]: 54: Hoare triple {4607#false} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {4607#false} is VALID [2018-11-23 13:03:29,006 INFO L273 TraceCheckUtils]: 55: Hoare triple {4607#false} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {4607#false} is VALID [2018-11-23 13:03:29,006 INFO L273 TraceCheckUtils]: 56: Hoare triple {4607#false} assume !(~lh~0 < ~n~0); {4607#false} is VALID [2018-11-23 13:03:29,006 INFO L273 TraceCheckUtils]: 57: Hoare triple {4607#false} assume true; {4607#false} is VALID [2018-11-23 13:03:29,007 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {4607#false} {4623#(<= 5 ~n~0)} #88#return; {4607#false} is VALID [2018-11-23 13:03:29,007 INFO L273 TraceCheckUtils]: 59: Hoare triple {4607#false} ~i~1 := 0; {4607#false} is VALID [2018-11-23 13:03:29,007 INFO L273 TraceCheckUtils]: 60: Hoare triple {4607#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {4607#false} is VALID [2018-11-23 13:03:29,007 INFO L256 TraceCheckUtils]: 61: Hoare triple {4607#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {4607#false} is VALID [2018-11-23 13:03:29,007 INFO L273 TraceCheckUtils]: 62: Hoare triple {4607#false} ~cond := #in~cond; {4607#false} is VALID [2018-11-23 13:03:29,007 INFO L273 TraceCheckUtils]: 63: Hoare triple {4607#false} assume 0 == ~cond; {4607#false} is VALID [2018-11-23 13:03:29,008 INFO L273 TraceCheckUtils]: 64: Hoare triple {4607#false} assume !false; {4607#false} is VALID [2018-11-23 13:03:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 37 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-11-23 13:03:29,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:29,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-11-23 13:03:29,030 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-11-23 13:03:29,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:29,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:03:29,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:29,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:03:29,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:03:29,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:03:29,108 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand 17 states. [2018-11-23 13:03:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:31,034 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2018-11-23 13:03:31,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 13:03:31,034 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-11-23 13:03:31,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:03:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 138 transitions. [2018-11-23 13:03:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:03:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 138 transitions. [2018-11-23 13:03:31,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 138 transitions. [2018-11-23 13:03:31,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:31,497 INFO L225 Difference]: With dead ends: 146 [2018-11-23 13:03:31,497 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 13:03:31,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 13:03:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 13:03:31,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 83. [2018-11-23 13:03:31,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:31,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 83 states. [2018-11-23 13:03:31,748 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 83 states. [2018-11-23 13:03:31,748 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 83 states. [2018-11-23 13:03:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:31,752 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2018-11-23 13:03:31,752 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2018-11-23 13:03:31,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:31,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:31,753 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 106 states. [2018-11-23 13:03:31,753 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 106 states. [2018-11-23 13:03:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:31,755 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2018-11-23 13:03:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 130 transitions. [2018-11-23 13:03:31,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:31,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:31,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:31,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 13:03:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2018-11-23 13:03:31,758 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 65 [2018-11-23 13:03:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:31,759 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2018-11-23 13:03:31,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:03:31,759 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2018-11-23 13:03:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 13:03:31,760 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:31,760 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:31,760 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:31,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:31,761 INFO L82 PathProgramCache]: Analyzing trace with hash -833747949, now seen corresponding path program 8 times [2018-11-23 13:03:31,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:31,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:31,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:31,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:31,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:32,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {5399#true} call ULTIMATE.init(); {5399#true} is VALID [2018-11-23 13:03:32,794 INFO L273 TraceCheckUtils]: 1: Hoare triple {5399#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {5401#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2018-11-23 13:03:32,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {5401#(= (select |#valid| |~#array~0.base|) 1)} assume true; {5401#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2018-11-23 13:03:32,795 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5401#(= (select |#valid| |~#array~0.base|) 1)} {5399#true} #84#return; {5401#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2018-11-23 13:03:32,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {5401#(= (select |#valid| |~#array~0.base|) 1)} call #t~ret9 := main(); {5401#(= (select |#valid| |~#array~0.base|) 1)} is VALID [2018-11-23 13:03:32,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {5401#(= (select |#valid| |~#array~0.base|) 1)} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {5402#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 4) (not (= |~#array~0.base| |main_~#array~1.base|)))} is VALID [2018-11-23 13:03:32,797 INFO L273 TraceCheckUtils]: 6: Hoare triple {5402#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 4) (not (= |~#array~0.base| |main_~#array~1.base|)))} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {5402#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 4) (not (= |~#array~0.base| |main_~#array~1.base|)))} is VALID [2018-11-23 13:03:32,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {5402#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 4) (not (= |~#array~0.base| |main_~#array~1.base|)))} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {5403#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 3) (not (= |~#array~0.base| |main_~#array~1.base|)))} is VALID [2018-11-23 13:03:32,799 INFO L273 TraceCheckUtils]: 8: Hoare triple {5403#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 3) (not (= |~#array~0.base| |main_~#array~1.base|)))} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {5403#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 3) (not (= |~#array~0.base| |main_~#array~1.base|)))} is VALID [2018-11-23 13:03:32,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {5403#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 3) (not (= |~#array~0.base| |main_~#array~1.base|)))} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {5404#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 2) (not (= |~#array~0.base| |main_~#array~1.base|)))} is VALID [2018-11-23 13:03:32,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {5404#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 2) (not (= |~#array~0.base| |main_~#array~1.base|)))} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {5404#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 2) (not (= |~#array~0.base| |main_~#array~1.base|)))} is VALID [2018-11-23 13:03:32,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {5404#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 2) (not (= |~#array~0.base| |main_~#array~1.base|)))} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {5405#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 1) (not (= |~#array~0.base| |main_~#array~1.base|)))} is VALID [2018-11-23 13:03:32,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {5405#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 1) (not (= |~#array~0.base| |main_~#array~1.base|)))} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {5405#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 1) (not (= |~#array~0.base| |main_~#array~1.base|)))} is VALID [2018-11-23 13:03:32,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {5405#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 1) (not (= |~#array~0.base| |main_~#array~1.base|)))} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {5406#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 0) (or (not (= |~#array~0.base| |main_~#array~1.base|)) (not (= main_~i~1 0))))} is VALID [2018-11-23 13:03:32,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {5406#(and (= |main_~#array~1.offset| 0) (<= main_~i~1 0) (or (not (= |~#array~0.base| |main_~#array~1.base|)) (not (= main_~i~1 0))))} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {5407#(and (= |main_~#array~1.offset| 0) (= (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)) main_~i~1) (= main_~i~1 0) (not (= |~#array~0.base| |main_~#array~1.base|)))} is VALID [2018-11-23 13:03:32,805 INFO L273 TraceCheckUtils]: 15: Hoare triple {5407#(and (= |main_~#array~1.offset| 0) (= (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)) main_~i~1) (= main_~i~1 0) (not (= |~#array~0.base| |main_~#array~1.base|)))} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {5408#(and (= |main_~#array~1.offset| 0) (= (select (select |#memory_int| |main_~#array~1.base|) 0) 0) (not (= |~#array~0.base| |main_~#array~1.base|)))} is VALID [2018-11-23 13:03:32,806 INFO L273 TraceCheckUtils]: 16: Hoare triple {5408#(and (= |main_~#array~1.offset| 0) (= (select (select |#memory_int| |main_~#array~1.base|) 0) 0) (not (= |~#array~0.base| |main_~#array~1.base|)))} assume !(~i~1 >= 0); {5408#(and (= |main_~#array~1.offset| 0) (= (select (select |#memory_int| |main_~#array~1.base|) 0) 0) (not (= |~#array~0.base| |main_~#array~1.base|)))} is VALID [2018-11-23 13:03:32,806 INFO L256 TraceCheckUtils]: 17: Hoare triple {5408#(and (= |main_~#array~1.offset| 0) (= (select (select |#memory_int| |main_~#array~1.base|) 0) 0) (not (= |~#array~0.base| |main_~#array~1.base|)))} call SelectionSort(); {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,807 INFO L273 TraceCheckUtils]: 18: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,808 INFO L273 TraceCheckUtils]: 19: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,808 INFO L273 TraceCheckUtils]: 20: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,809 INFO L273 TraceCheckUtils]: 21: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,809 INFO L273 TraceCheckUtils]: 22: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,810 INFO L273 TraceCheckUtils]: 23: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,810 INFO L273 TraceCheckUtils]: 24: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,811 INFO L273 TraceCheckUtils]: 25: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,811 INFO L273 TraceCheckUtils]: 26: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,812 INFO L273 TraceCheckUtils]: 27: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,812 INFO L273 TraceCheckUtils]: 28: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,813 INFO L273 TraceCheckUtils]: 29: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,813 INFO L273 TraceCheckUtils]: 30: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,814 INFO L273 TraceCheckUtils]: 31: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,814 INFO L273 TraceCheckUtils]: 32: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} assume !(~i~0 < ~n~0); {5409#(= |#memory_int| |old(#memory_int)|)} is VALID [2018-11-23 13:03:32,815 INFO L273 TraceCheckUtils]: 33: Hoare triple {5409#(= |#memory_int| |old(#memory_int)|)} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,816 INFO L273 TraceCheckUtils]: 34: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,816 INFO L273 TraceCheckUtils]: 35: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,817 INFO L273 TraceCheckUtils]: 36: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,818 INFO L273 TraceCheckUtils]: 37: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,819 INFO L273 TraceCheckUtils]: 38: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,819 INFO L273 TraceCheckUtils]: 39: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,819 INFO L273 TraceCheckUtils]: 40: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,820 INFO L273 TraceCheckUtils]: 41: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,820 INFO L273 TraceCheckUtils]: 42: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,820 INFO L273 TraceCheckUtils]: 43: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,821 INFO L273 TraceCheckUtils]: 44: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,821 INFO L273 TraceCheckUtils]: 45: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume !(~i~0 < ~n~0); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,822 INFO L273 TraceCheckUtils]: 46: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,823 INFO L273 TraceCheckUtils]: 47: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,823 INFO L273 TraceCheckUtils]: 48: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,825 INFO L273 TraceCheckUtils]: 49: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,825 INFO L273 TraceCheckUtils]: 50: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,826 INFO L273 TraceCheckUtils]: 51: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,826 INFO L273 TraceCheckUtils]: 52: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,826 INFO L273 TraceCheckUtils]: 53: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,826 INFO L273 TraceCheckUtils]: 54: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,827 INFO L273 TraceCheckUtils]: 55: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume !(~i~0 < ~n~0); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,828 INFO L273 TraceCheckUtils]: 56: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,828 INFO L273 TraceCheckUtils]: 57: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,829 INFO L273 TraceCheckUtils]: 58: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,829 INFO L273 TraceCheckUtils]: 59: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,830 INFO L273 TraceCheckUtils]: 60: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,830 INFO L273 TraceCheckUtils]: 61: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,831 INFO L273 TraceCheckUtils]: 62: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume !(~i~0 < ~n~0); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,832 INFO L273 TraceCheckUtils]: 63: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,832 INFO L273 TraceCheckUtils]: 64: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,833 INFO L273 TraceCheckUtils]: 65: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,833 INFO L273 TraceCheckUtils]: 66: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume !(~i~0 < ~n~0); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,834 INFO L273 TraceCheckUtils]: 67: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,835 INFO L273 TraceCheckUtils]: 68: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,835 INFO L273 TraceCheckUtils]: 69: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume !(~lh~0 < ~n~0); {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,836 INFO L273 TraceCheckUtils]: 70: Hoare triple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} assume true; {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} is VALID [2018-11-23 13:03:32,837 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {5410#(= |#memory_int| (store |old(#memory_int)| |~#array~0.base| (select |#memory_int| |~#array~0.base|)))} {5408#(and (= |main_~#array~1.offset| 0) (= (select (select |#memory_int| |main_~#array~1.base|) 0) 0) (not (= |~#array~0.base| |main_~#array~1.base|)))} #88#return; {5411#(and (= |main_~#array~1.offset| 0) (= (select (select |#memory_int| |main_~#array~1.base|) 0) 0))} is VALID [2018-11-23 13:03:32,838 INFO L273 TraceCheckUtils]: 72: Hoare triple {5411#(and (= |main_~#array~1.offset| 0) (= (select (select |#memory_int| |main_~#array~1.base|) 0) 0))} ~i~1 := 0; {5412#(and (= |main_~#array~1.offset| 0) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|))) (= main_~i~1 0))} is VALID [2018-11-23 13:03:32,839 INFO L273 TraceCheckUtils]: 73: Hoare triple {5412#(and (= |main_~#array~1.offset| 0) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|))) (= main_~i~1 0))} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {5413#(and (= main_~i~1 |main_#t~mem8|) (= main_~i~1 0))} is VALID [2018-11-23 13:03:32,840 INFO L256 TraceCheckUtils]: 74: Hoare triple {5413#(and (= main_~i~1 |main_#t~mem8|) (= main_~i~1 0))} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {5414#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:32,840 INFO L273 TraceCheckUtils]: 75: Hoare triple {5414#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5415#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:03:32,841 INFO L273 TraceCheckUtils]: 76: Hoare triple {5415#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {5400#false} is VALID [2018-11-23 13:03:32,841 INFO L273 TraceCheckUtils]: 77: Hoare triple {5400#false} assume !false; {5400#false} is VALID [2018-11-23 13:03:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-11-23 13:03:32,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:32,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:03:32,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:03:32,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:03:32,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:32,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:33,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-23 13:03:33,041 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:03:33,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-23 13:03:33,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 13:03:33,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:03:33,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 13:03:33,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:63 [2018-11-23 13:03:33,093 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:33,093 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_12|]. (let ((.cse0 (select |#memory_int| |~#array~0.base|))) (and (<= (select .cse0 (+ |~#array~0.offset| 8)) 0) (<= 0 (select .cse0 (+ |~#array~0.offset| 12))) (= (store (store |v_#valid_12| 0 0) |~#array~0.base| 1) |#valid|) (= 0 |~#array~0.offset|))) [2018-11-23 13:03:33,094 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse4 (select |#memory_int| |~#array~0.base|))) (let ((.cse0 (<= (select .cse4 (+ |~#array~0.offset| 8)) 0)) (.cse1 (<= 0 (select .cse4 (+ |~#array~0.offset| 12)))) (.cse2 (= (select |#valid| |~#array~0.base|) 1)) (.cse3 (= 0 |~#array~0.offset|))) (or (and .cse0 .cse1 (= 0 (select |#valid| 0)) .cse2 .cse3) (and .cse0 .cse1 .cse2 (= 0 |~#array~0.base|) .cse3)))) [2018-11-23 13:03:33,380 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:03:33,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:03:33,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:03:33,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-23 13:03:33,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:33,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:03:33,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:03:33,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-11-23 13:03:33,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:33,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:33,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:26 [2018-11-23 13:03:33,469 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:33,469 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_13|, v_prenex_1]. (let ((.cse3 (select |#memory_int| |~#array~0.base|))) (let ((.cse0 (<= (select .cse3 (+ |~#array~0.offset| 8)) 0)) (.cse1 (<= 0 (select .cse3 (+ |~#array~0.offset| 12)))) (.cse2 (= 0 |~#array~0.offset|))) (or (and (= (select |v_#valid_13| |~#array~0.base|) 1) .cse0 (= 0 (select |v_#valid_13| |main_~#array~1.base|)) .cse1 (= 0 |~#array~0.base|) .cse2) (and (= 0 (select v_prenex_1 0)) .cse0 (= (select v_prenex_1 |~#array~0.base|) 1) (= 0 (select v_prenex_1 |main_~#array~1.base|)) .cse1 .cse2)))) [2018-11-23 13:03:33,470 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select |#memory_int| |~#array~0.base|))) (and (<= (select .cse0 (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select .cse0 (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))) [2018-11-23 13:03:33,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2018-11-23 13:03:33,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 13:03:33,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:33,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:33,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:03:33,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:37 [2018-11-23 13:03:33,629 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:33,629 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|, main_~i~1]. (let ((.cse0 (select |v_#memory_int_13| |~#array~0.base|))) (and (not (= |main_~#array~1.base| |~#array~0.base|)) (<= (select .cse0 (+ |~#array~0.offset| 8)) 0) (= 0 |~#array~0.offset|) (= |#memory_int| (store |v_#memory_int_13| |main_~#array~1.base| (store (select |v_#memory_int_13| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|) main_~i~1))) (<= 0 (select .cse0 (+ |~#array~0.offset| 12))))) [2018-11-23 13:03:33,630 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~1]. (let ((.cse0 (select |#memory_int| |~#array~0.base|))) (and (<= (select .cse0 (+ |~#array~0.offset| 8)) 0) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|))) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select .cse0 (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))) [2018-11-23 13:03:33,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-23 13:03:33,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-23 13:03:33,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:33,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:33,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:03:33,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-11-23 13:03:33,911 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:33,911 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_14|, main_~i~1, v_prenex_2]. (let ((.cse0 (select |v_#memory_int_14| |main_~#array~1.base|)) (.cse1 (select |v_#memory_int_14| |~#array~0.base|))) (and (= (store |v_#memory_int_14| |main_~#array~1.base| (store .cse0 (+ (* 4 main_~i~1) |main_~#array~1.offset|) main_~i~1)) |#memory_int|) (= v_prenex_2 (select .cse0 (+ (* 4 v_prenex_2) |main_~#array~1.offset|))) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= (select .cse1 (+ |~#array~0.offset| 8)) 0) (<= 0 (select .cse1 (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))) [2018-11-23 13:03:33,911 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~1, v_prenex_2]. (let ((.cse0 (select |#memory_int| |~#array~0.base|)) (.cse1 (select |#memory_int| |main_~#array~1.base|))) (and (<= (select .cse0 (+ |~#array~0.offset| 8)) 0) (= main_~i~1 (select .cse1 (+ (* 4 main_~i~1) |main_~#array~1.offset|))) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select .cse0 (+ |~#array~0.offset| 12))) (= (select .cse1 (+ (* 4 v_prenex_2) |main_~#array~1.offset|)) v_prenex_2) (= 0 |~#array~0.offset|))) [2018-11-23 13:03:34,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-23 13:03:34,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-23 13:03:34,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:34,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:34,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:03:34,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-11-23 13:03:34,143 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:34,144 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, main_~i~1, v_prenex_3]. (let ((.cse0 (select |v_#memory_int_15| |main_~#array~1.base|)) (.cse1 (select |v_#memory_int_15| |~#array~0.base|))) (and (= v_prenex_3 (select .cse0 (+ (* 4 v_prenex_3) |main_~#array~1.offset|))) (= (store |v_#memory_int_15| |main_~#array~1.base| (store .cse0 (+ (* 4 main_~i~1) |main_~#array~1.offset|) main_~i~1)) |#memory_int|) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= (select .cse1 (+ |~#array~0.offset| 8)) 0) (= 0 |~#array~0.offset|) (<= 0 (select .cse1 (+ |~#array~0.offset| 12))))) [2018-11-23 13:03:34,144 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~1, v_prenex_3]. (let ((.cse1 (select |#memory_int| |main_~#array~1.base|)) (.cse0 (select |#memory_int| |~#array~0.base|))) (and (<= (select .cse0 (+ |~#array~0.offset| 8)) 0) (= main_~i~1 (select .cse1 (+ (* 4 main_~i~1) |main_~#array~1.offset|))) (= (select .cse1 (+ (* 4 v_prenex_3) |main_~#array~1.offset|)) v_prenex_3) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select .cse0 (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))) [2018-11-23 13:03:34,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-23 13:03:34,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-23 13:03:34,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:34,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:34,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:03:34,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-11-23 13:03:34,319 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:34,320 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, main_~i~1, v_prenex_4]. (let ((.cse0 (select |v_#memory_int_16| |main_~#array~1.base|)) (.cse1 (select |v_#memory_int_16| |~#array~0.base|))) (and (= |#memory_int| (store |v_#memory_int_16| |main_~#array~1.base| (store .cse0 (+ (* 4 main_~i~1) |main_~#array~1.offset|) main_~i~1))) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select .cse1 (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|) (= (select .cse0 (+ (* 4 v_prenex_4) |main_~#array~1.offset|)) v_prenex_4) (<= (select .cse1 (+ |~#array~0.offset| 8)) 0))) [2018-11-23 13:03:34,320 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_4, main_~i~1]. (let ((.cse0 (select |#memory_int| |main_~#array~1.base|)) (.cse1 (select |#memory_int| |~#array~0.base|))) (and (= (select .cse0 (+ (* 4 v_prenex_4) |main_~#array~1.offset|)) v_prenex_4) (<= (select .cse1 (+ |~#array~0.offset| 8)) 0) (= main_~i~1 (select .cse0 (+ (* 4 main_~i~1) |main_~#array~1.offset|))) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select .cse1 (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))) [2018-11-23 13:03:34,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-11-23 13:03:34,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 23 [2018-11-23 13:03:34,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:34,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:34,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 13:03:34,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:48 [2018-11-23 13:03:36,476 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:36,477 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, |main_~#array~1.base|, main_~i~1, |main_~#array~1.offset|, v_prenex_5]. (let ((.cse1 (select |v_#memory_int_17| |main_~#array~1.base|)) (.cse0 (select |v_#memory_int_17| |~#array~0.base|))) (and (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select .cse0 (+ |~#array~0.offset| 12))) (= v_prenex_5 (select .cse1 (+ (* 4 v_prenex_5) |main_~#array~1.offset|))) (= |#memory_int| (store |v_#memory_int_17| |main_~#array~1.base| (store .cse1 (+ (* 4 main_~i~1) |main_~#array~1.offset|) main_~i~1))) (<= (select .cse0 (+ |~#array~0.offset| 8)) 0) (= 0 |~#array~0.offset|))) [2018-11-23 13:03:36,477 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#array~1.base|, v_prenex_5, |main_~#array~1.offset|, main_~i~1]. (let ((.cse0 (select |#memory_int| |main_~#array~1.base|)) (.cse1 (select |#memory_int| |~#array~0.base|))) (and (= v_prenex_5 (select .cse0 (+ (* 4 v_prenex_5) |main_~#array~1.offset|))) (<= (select .cse1 (+ |~#array~0.offset| 8)) 0) (= main_~i~1 (select .cse0 (+ (* 4 main_~i~1) |main_~#array~1.offset|))) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select .cse1 (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))) [2018-11-23 13:03:42,538 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 13:03:42,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2018-11-23 13:03:42,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2018-11-23 13:03:42,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:42,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:03:42,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2018-11-23 13:03:42,798 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:03:42,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:42,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:03:42,807 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2018-11-23 13:03:42,811 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:03:42,811 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_BEFORE_CALL_2|, |main_~#array~1.base|, main_~i~1, |main_~#array~1.offset|, v_prenex_5]. (let ((.cse0 (select |v_#memory_int_BEFORE_CALL_2| |~#array~0.base|)) (.cse1 (select |v_#memory_int_BEFORE_CALL_2| |main_~#array~1.base|))) (and (<= (select .cse0 (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (= |#memory_int| |old(#memory_int)|) (= main_~i~1 (select .cse1 (+ (* 4 main_~i~1) |main_~#array~1.offset|))) (<= 0 (select .cse0 (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|) (= (select .cse1 (+ (* 4 v_prenex_5) |main_~#array~1.offset|)) v_prenex_5))) [2018-11-23 13:03:42,812 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|)) [2018-11-23 13:03:43,194 INFO L256 TraceCheckUtils]: 0: Hoare triple {5399#true} call ULTIMATE.init(); {5399#true} is VALID [2018-11-23 13:03:43,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {5399#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(20);call write~init~int(0, ~#array~0.base, ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 4 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 8 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 12 + ~#array~0.offset, 4);call write~init~int(0, ~#array~0.base, 16 + ~#array~0.offset, 4);~n~0 := 5; {5422#(or (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 (select |#valid| 0)) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.offset|)) (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.base|) (= 0 |~#array~0.offset|)))} is VALID [2018-11-23 13:03:43,197 INFO L273 TraceCheckUtils]: 2: Hoare triple {5422#(or (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 (select |#valid| 0)) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.offset|)) (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.base|) (= 0 |~#array~0.offset|)))} assume true; {5422#(or (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 (select |#valid| 0)) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.offset|)) (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.base|) (= 0 |~#array~0.offset|)))} is VALID [2018-11-23 13:03:43,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5422#(or (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 (select |#valid| 0)) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.offset|)) (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.base|) (= 0 |~#array~0.offset|)))} {5399#true} #84#return; {5422#(or (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 (select |#valid| 0)) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.offset|)) (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.base|) (= 0 |~#array~0.offset|)))} is VALID [2018-11-23 13:03:43,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {5422#(or (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 (select |#valid| 0)) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.offset|)) (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.base|) (= 0 |~#array~0.offset|)))} call #t~ret9 := main(); {5422#(or (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 (select |#valid| 0)) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.offset|)) (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.base|) (= 0 |~#array~0.offset|)))} is VALID [2018-11-23 13:03:43,200 INFO L273 TraceCheckUtils]: 5: Hoare triple {5422#(or (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 (select |#valid| 0)) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.offset|)) (and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= (select |#valid| |~#array~0.base|) 1) (= 0 |~#array~0.base|) (= 0 |~#array~0.offset|)))} call ~#array~1.base, ~#array~1.offset := #Ultimate.alloc(20);havoc ~i~1;~i~1 := 4; {5435#(and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {5435#(and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,204 INFO L273 TraceCheckUtils]: 7: Hoare triple {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,206 INFO L273 TraceCheckUtils]: 9: Hoare triple {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,207 INFO L273 TraceCheckUtils]: 10: Hoare triple {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,210 INFO L273 TraceCheckUtils]: 12: Hoare triple {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,213 INFO L273 TraceCheckUtils]: 14: Hoare triple {5439#(and (exists ((main_~i~1 Int)) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|)))) (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (not (= |main_~#array~1.base| |~#array~0.base|)) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|))} assume !!(~i~1 >= 0);call write~int(~i~1, ~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {5464#(and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|) (exists ((v_prenex_5 Int) (main_~i~1 Int) (|main_~#array~1.base| Int) (|main_~#array~1.offset| Int)) (and (= v_prenex_5 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 v_prenex_5) |main_~#array~1.offset|))) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|))) (not (= |main_~#array~1.base| |~#array~0.base|)))))} is VALID [2018-11-23 13:03:43,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {5464#(and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|) (exists ((v_prenex_5 Int) (main_~i~1 Int) (|main_~#array~1.base| Int) (|main_~#array~1.offset| Int)) (and (= v_prenex_5 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 v_prenex_5) |main_~#array~1.offset|))) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|))) (not (= |main_~#array~1.base| |~#array~0.base|)))))} #t~post6 := ~i~1;~i~1 := #t~post6 - 1;havoc #t~post6; {5464#(and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|) (exists ((v_prenex_5 Int) (main_~i~1 Int) (|main_~#array~1.base| Int) (|main_~#array~1.offset| Int)) (and (= v_prenex_5 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 v_prenex_5) |main_~#array~1.offset|))) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|))) (not (= |main_~#array~1.base| |~#array~0.base|)))))} is VALID [2018-11-23 13:03:43,215 INFO L273 TraceCheckUtils]: 16: Hoare triple {5464#(and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|) (exists ((v_prenex_5 Int) (main_~i~1 Int) (|main_~#array~1.base| Int) (|main_~#array~1.offset| Int)) (and (= v_prenex_5 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 v_prenex_5) |main_~#array~1.offset|))) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|))) (not (= |main_~#array~1.base| |~#array~0.base|)))))} assume !(~i~1 >= 0); {5464#(and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|) (exists ((v_prenex_5 Int) (main_~i~1 Int) (|main_~#array~1.base| Int) (|main_~#array~1.offset| Int)) (and (= v_prenex_5 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 v_prenex_5) |main_~#array~1.offset|))) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|))) (not (= |main_~#array~1.base| |~#array~0.base|)))))} is VALID [2018-11-23 13:03:43,216 INFO L256 TraceCheckUtils]: 17: Hoare triple {5464#(and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|) (exists ((v_prenex_5 Int) (main_~i~1 Int) (|main_~#array~1.base| Int) (|main_~#array~1.offset| Int)) (and (= v_prenex_5 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 v_prenex_5) |main_~#array~1.offset|))) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|))) (not (= |main_~#array~1.base| |~#array~0.base|)))))} call SelectionSort(); {5474#(and (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {5474#(and (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|))} havoc ~lh~0;havoc ~rh~0;havoc ~i~0;havoc ~temp~0;~lh~0 := 0; {5478#(and (= SelectionSort_~lh~0 0) (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,218 INFO L273 TraceCheckUtils]: 19: Hoare triple {5478#(and (= SelectionSort_~lh~0 0) (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|))} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {5482#(and (= SelectionSort_~i~0 1) (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,219 INFO L273 TraceCheckUtils]: 20: Hoare triple {5482#(and (= SelectionSort_~i~0 1) (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5482#(and (= SelectionSort_~i~0 1) (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,219 INFO L273 TraceCheckUtils]: 21: Hoare triple {5482#(and (= SelectionSort_~i~0 1) (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5482#(and (= SelectionSort_~i~0 1) (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,220 INFO L273 TraceCheckUtils]: 22: Hoare triple {5482#(and (= SelectionSort_~i~0 1) (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5492#(and (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|) (= SelectionSort_~i~0 2))} is VALID [2018-11-23 13:03:43,221 INFO L273 TraceCheckUtils]: 23: Hoare triple {5492#(and (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|) (= SelectionSort_~i~0 2))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5492#(and (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|) (= SelectionSort_~i~0 2))} is VALID [2018-11-23 13:03:43,222 INFO L273 TraceCheckUtils]: 24: Hoare triple {5492#(and (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|) (= SelectionSort_~i~0 2))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5499#(and (= SelectionSort_~i~0 SelectionSort_~rh~0) (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|) (= SelectionSort_~i~0 2))} is VALID [2018-11-23 13:03:43,223 INFO L273 TraceCheckUtils]: 25: Hoare triple {5499#(and (= SelectionSort_~i~0 SelectionSort_~rh~0) (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|) (= SelectionSort_~i~0 2))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5503#(and (= SelectionSort_~i~0 (+ SelectionSort_~rh~0 1)) (= SelectionSort_~rh~0 2) (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,224 INFO L273 TraceCheckUtils]: 26: Hoare triple {5503#(and (= SelectionSort_~i~0 (+ SelectionSort_~rh~0 1)) (= SelectionSort_~rh~0 2) (= |#memory_int| |old(#memory_int)|) (= 0 |~#array~0.offset|))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5507#(and (<= (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) |SelectionSort_#t~mem2|) (= 0 |~#array~0.offset|) (<= |SelectionSort_#t~mem3| (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))))} is VALID [2018-11-23 13:03:43,225 INFO L273 TraceCheckUtils]: 27: Hoare triple {5507#(and (<= (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) |SelectionSort_#t~mem2|) (= 0 |~#array~0.offset|) (<= |SelectionSort_#t~mem3| (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,226 INFO L273 TraceCheckUtils]: 28: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,227 INFO L273 TraceCheckUtils]: 29: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,227 INFO L273 TraceCheckUtils]: 30: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,228 INFO L273 TraceCheckUtils]: 31: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,229 INFO L273 TraceCheckUtils]: 32: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !(~i~0 < ~n~0); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,230 INFO L273 TraceCheckUtils]: 33: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,230 INFO L273 TraceCheckUtils]: 34: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,231 INFO L273 TraceCheckUtils]: 35: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,232 INFO L273 TraceCheckUtils]: 36: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,233 INFO L273 TraceCheckUtils]: 37: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,234 INFO L273 TraceCheckUtils]: 38: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,234 INFO L273 TraceCheckUtils]: 39: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,235 INFO L273 TraceCheckUtils]: 40: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,236 INFO L273 TraceCheckUtils]: 41: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,237 INFO L273 TraceCheckUtils]: 42: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,238 INFO L273 TraceCheckUtils]: 43: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,238 INFO L273 TraceCheckUtils]: 44: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,239 INFO L273 TraceCheckUtils]: 45: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !(~i~0 < ~n~0); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,240 INFO L273 TraceCheckUtils]: 46: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,241 INFO L273 TraceCheckUtils]: 47: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,241 INFO L273 TraceCheckUtils]: 48: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,242 INFO L273 TraceCheckUtils]: 49: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,243 INFO L273 TraceCheckUtils]: 50: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,244 INFO L273 TraceCheckUtils]: 51: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,245 INFO L273 TraceCheckUtils]: 52: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,245 INFO L273 TraceCheckUtils]: 53: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,246 INFO L273 TraceCheckUtils]: 54: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,247 INFO L273 TraceCheckUtils]: 55: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !(~i~0 < ~n~0); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,248 INFO L273 TraceCheckUtils]: 56: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,248 INFO L273 TraceCheckUtils]: 57: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,249 INFO L273 TraceCheckUtils]: 58: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,250 INFO L273 TraceCheckUtils]: 59: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !!(~i~0 < ~n~0);call #t~mem2 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,251 INFO L273 TraceCheckUtils]: 60: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume #t~mem2 < #t~mem3;havoc #t~mem3;havoc #t~mem2;~rh~0 := ~i~0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,252 INFO L273 TraceCheckUtils]: 61: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,252 INFO L273 TraceCheckUtils]: 62: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !(~i~0 < ~n~0); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,253 INFO L273 TraceCheckUtils]: 63: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,254 INFO L273 TraceCheckUtils]: 64: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,255 INFO L273 TraceCheckUtils]: 65: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !!(~lh~0 < ~n~0);~rh~0 := ~lh~0;~i~0 := 1 + ~lh~0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,255 INFO L273 TraceCheckUtils]: 66: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !(~i~0 < ~n~0); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,256 INFO L273 TraceCheckUtils]: 67: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4);call write~int(#t~mem5, ~#array~0.base, ~#array~0.offset + 4 * ~lh~0, 4);havoc #t~mem5;call write~int(~temp~0, ~#array~0.base, ~#array~0.offset + 4 * ~rh~0, 4); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,257 INFO L273 TraceCheckUtils]: 68: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} #t~post0 := ~lh~0;~lh~0 := 1 + #t~post0;havoc #t~post0; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,258 INFO L273 TraceCheckUtils]: 69: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume !(~lh~0 < ~n~0); {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,259 INFO L273 TraceCheckUtils]: 70: Hoare triple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} assume true; {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} is VALID [2018-11-23 13:03:43,260 INFO L268 TraceCheckUtils]: 71: Hoare quadruple {5511#(and (<= (+ (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 12)) 1) (select (select |old(#memory_int)| |~#array~0.base|) (+ |~#array~0.offset| 8))) (= 0 |~#array~0.offset|))} {5464#(and (<= (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 8)) 0) (<= 0 (select (select |#memory_int| |~#array~0.base|) (+ |~#array~0.offset| 12))) (= 0 |~#array~0.offset|) (exists ((v_prenex_5 Int) (main_~i~1 Int) (|main_~#array~1.base| Int) (|main_~#array~1.offset| Int)) (and (= v_prenex_5 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 v_prenex_5) |main_~#array~1.offset|))) (= main_~i~1 (select (select |#memory_int| |main_~#array~1.base|) (+ (* 4 main_~i~1) |main_~#array~1.offset|))) (not (= |main_~#array~1.base| |~#array~0.base|)))))} #88#return; {5400#false} is VALID [2018-11-23 13:03:43,260 INFO L273 TraceCheckUtils]: 72: Hoare triple {5400#false} ~i~1 := 0; {5400#false} is VALID [2018-11-23 13:03:43,260 INFO L273 TraceCheckUtils]: 73: Hoare triple {5400#false} assume !!(~i~1 < 5);call #t~mem8 := read~int(~#array~1.base, ~#array~1.offset + 4 * ~i~1, 4); {5400#false} is VALID [2018-11-23 13:03:43,261 INFO L256 TraceCheckUtils]: 74: Hoare triple {5400#false} call __VERIFIER_assert((if #t~mem8 == ~i~1 then 1 else 0)); {5400#false} is VALID [2018-11-23 13:03:43,261 INFO L273 TraceCheckUtils]: 75: Hoare triple {5400#false} ~cond := #in~cond; {5400#false} is VALID [2018-11-23 13:03:43,261 INFO L273 TraceCheckUtils]: 76: Hoare triple {5400#false} assume 0 == ~cond; {5400#false} is VALID [2018-11-23 13:03:43,261 INFO L273 TraceCheckUtils]: 77: Hoare triple {5400#false} assume !false; {5400#false} is VALID [2018-11-23 13:03:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 4 proven. 94 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-11-23 13:03:43,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:43,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2018-11-23 13:03:43,313 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 78 [2018-11-23 13:03:43,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:43,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 13:03:45,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 77 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:45,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 13:03:45,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 13:03:45,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=717, Unknown=2, NotChecked=0, Total=812 [2018-11-23 13:03:45,415 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand 29 states. [2018-11-23 13:04:14,761 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2018-11-23 13:05:00,843 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-11-23 13:05:11,072 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2018-11-23 13:05:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:47,319 INFO L93 Difference]: Finished difference Result 167 states and 202 transitions. [2018-11-23 13:05:47,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 13:05:47,319 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 78 [2018-11-23 13:05:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:05:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:05:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 109 transitions. [2018-11-23 13:05:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:05:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 109 transitions. [2018-11-23 13:05:47,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 109 transitions. [2018-11-23 13:05:47,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:05:47,795 INFO L225 Difference]: With dead ends: 167 [2018-11-23 13:05:47,795 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 13:05:47,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=434, Invalid=2636, Unknown=10, NotChecked=0, Total=3080 [2018-11-23 13:05:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 13:05:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-11-23 13:05:48,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:05:48,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 92 states. [2018-11-23 13:05:48,087 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 92 states. [2018-11-23 13:05:48,087 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 92 states. [2018-11-23 13:05:48,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:48,091 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2018-11-23 13:05:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2018-11-23 13:05:48,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:48,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:48,092 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 112 states. [2018-11-23 13:05:48,092 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 112 states. [2018-11-23 13:05:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:05:48,095 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2018-11-23 13:05:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2018-11-23 13:05:48,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:05:48,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:05:48,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:05:48,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:05:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 13:05:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2018-11-23 13:05:48,098 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 108 transitions. Word has length 78 [2018-11-23 13:05:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:05:48,099 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 108 transitions. [2018-11-23 13:05:48,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 13:05:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2018-11-23 13:05:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 13:05:48,100 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:05:48,100 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:05:48,100 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:05:48,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:05:48,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1304762168, now seen corresponding path program 1 times [2018-11-23 13:05:48,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:05:48,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:05:48,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:48,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:05:48,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:05:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:05:48,496 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-23 13:05:48,993 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 13:05:49,729 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 13:05:49,735 INFO L168 Benchmark]: Toolchain (without parser) took 159517.57 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 983.6 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -881.6 MB). Peak memory consumption was 102.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:05:49,736 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:05:49,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:05:49,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:05:49,737 INFO L168 Benchmark]: Boogie Preprocessor took 78.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:05:49,737 INFO L168 Benchmark]: RCFGBuilder took 894.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -756.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:05:49,738 INFO L168 Benchmark]: TraceAbstraction took 158168.71 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 257.4 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -135.2 MB). Peak memory consumption was 122.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:05:49,741 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 339.13 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 31.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 78.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 894.20 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -756.9 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 158168.71 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 257.4 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -135.2 MB). Peak memory consumption was 122.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...