java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-824f902 [2018-12-19 12:03:53,205 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-19 12:03:53,207 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-19 12:03:53,222 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-19 12:03:53,222 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-19 12:03:53,223 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-19 12:03:53,225 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-19 12:03:53,226 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-19 12:03:53,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-19 12:03:53,229 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-19 12:03:53,230 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-19 12:03:53,230 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-19 12:03:53,231 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-19 12:03:53,232 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-19 12:03:53,234 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-19 12:03:53,234 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-19 12:03:53,235 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-19 12:03:53,237 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-19 12:03:53,239 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-19 12:03:53,241 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-19 12:03:53,242 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-19 12:03:53,244 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-19 12:03:53,246 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-19 12:03:53,247 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-19 12:03:53,247 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-19 12:03:53,248 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-19 12:03:53,249 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-19 12:03:53,250 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-19 12:03:53,251 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-19 12:03:53,252 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-19 12:03:53,252 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-19 12:03:53,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-19 12:03:53,253 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-19 12:03:53,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-19 12:03:53,255 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-19 12:03:53,255 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-19 12:03:53,256 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-19 12:03:53,270 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-19 12:03:53,270 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-19 12:03:53,271 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-19 12:03:53,271 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-19 12:03:53,271 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-19 12:03:53,272 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-19 12:03:53,272 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-19 12:03:53,272 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-19 12:03:53,272 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-19 12:03:53,272 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-19 12:03:53,274 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-19 12:03:53,275 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-19 12:03:53,275 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-19 12:03:53,275 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-19 12:03:53,276 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-19 12:03:53,276 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-19 12:03:53,276 INFO L133 SettingsManager]: * Use SBE=true [2018-12-19 12:03:53,277 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-19 12:03:53,277 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-19 12:03:53,277 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-19 12:03:53,277 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-19 12:03:53,277 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-19 12:03:53,278 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-19 12:03:53,278 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-19 12:03:53,278 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-19 12:03:53,278 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-19 12:03:53,278 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-19 12:03:53,278 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-19 12:03:53,279 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-19 12:03:53,279 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-19 12:03:53,279 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-19 12:03:53,279 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-19 12:03:53,280 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-19 12:03:53,280 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-19 12:03:53,280 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-19 12:03:53,280 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-19 12:03:53,280 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-19 12:03:53,281 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-19 12:03:53,281 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-19 12:03:53,281 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-19 12:03:53,312 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-19 12:03:53,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-19 12:03:53,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-19 12:03:53,330 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-19 12:03:53,331 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-19 12:03:53,331 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2018-12-19 12:03:53,332 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2018-12-19 12:03:53,381 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-19 12:03:53,383 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-19 12:03:53,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-19 12:03:53,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-19 12:03:53,384 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-19 12:03:53,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:03:53" (1/1) ... [2018-12-19 12:03:53,416 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:03:53" (1/1) ... [2018-12-19 12:03:53,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-19 12:03:53,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-19 12:03:53,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-19 12:03:53,426 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-19 12:03:53,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:03:53" (1/1) ... [2018-12-19 12:03:53,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:03:53" (1/1) ... [2018-12-19 12:03:53,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:03:53" (1/1) ... [2018-12-19 12:03:53,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:03:53" (1/1) ... [2018-12-19 12:03:53,445 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:03:53" (1/1) ... [2018-12-19 12:03:53,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:03:53" (1/1) ... [2018-12-19 12:03:53,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:03:53" (1/1) ... [2018-12-19 12:03:53,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-19 12:03:53,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-19 12:03:53,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-19 12:03:53,451 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-19 12:03:53,452 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:03:53" (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-12-19 12:03:53,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-19 12:03:53,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-19 12:03:54,024 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-19 12:03:54,025 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-19 12:03:54,025 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:03:54 BoogieIcfgContainer [2018-12-19 12:03:54,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-19 12:03:54,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-19 12:03:54,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-19 12:03:54,031 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-19 12:03:54,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:03:53" (1/2) ... [2018-12-19 12:03:54,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de01fdf and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:03:54, skipping insertion in model container [2018-12-19 12:03:54,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:03:54" (2/2) ... [2018-12-19 12:03:54,035 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2018-12-19 12:03:54,045 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-19 12:03:54,054 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-19 12:03:54,073 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-19 12:03:54,109 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-19 12:03:54,109 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-19 12:03:54,110 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-19 12:03:54,110 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-19 12:03:54,110 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-19 12:03:54,110 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-19 12:03:54,110 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-19 12:03:54,111 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-19 12:03:54,125 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-19 12:03:54,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 12:03:54,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:03:54,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 12:03:54,137 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:03:54,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:03:54,144 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-19 12:03:54,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:03:54,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:03:54,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:03:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:03:54,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:03:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:03:54,355 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {11#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:03:54,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(<= 4 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {10#false} is VALID [2018-12-19 12:03:54,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10#false} is VALID [2018-12-19 12:03:54,364 INFO L273 TraceCheckUtils]: 3: Hoare triple {10#false} assume !false; {10#false} is VALID [2018-12-19 12:03:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:03:54,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 12:03:54,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-19 12:03:54,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:03:54,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-19 12:03:54,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:03:54,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-19 12:03:54,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:03:54,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-19 12:03:54,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-19 12:03:54,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 12:03:54,427 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-19 12:03:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:03:54,545 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-19 12:03:54,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 12:03:54,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-19 12:03:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:03:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:03:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-19 12:03:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:03:54,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-19 12:03:54,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2018-12-19 12:03:54,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:03:54,667 INFO L225 Difference]: With dead ends: 11 [2018-12-19 12:03:54,667 INFO L226 Difference]: Without dead ends: 7 [2018-12-19 12:03:54,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-19 12:03:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-19 12:03:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-19 12:03:54,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:03:54,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2018-12-19 12:03:54,747 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-19 12:03:54,747 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-19 12:03:54,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:03:54,749 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2018-12-19 12:03:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-19 12:03:54,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:03:54,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:03:54,750 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-19 12:03:54,751 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-19 12:03:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:03:54,753 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2018-12-19 12:03:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-19 12:03:54,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:03:54,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:03:54,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:03:54,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:03:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-19 12:03:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-19 12:03:54,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2018-12-19 12:03:54,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:03:54,759 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-19 12:03:54,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-19 12:03:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-19 12:03:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-19 12:03:54,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:03:54,760 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-19 12:03:54,760 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:03:54,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:03:54,761 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2018-12-19 12:03:54,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:03:54,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:03:54,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:03:54,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:03:54,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:03:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:03:54,891 INFO L273 TraceCheckUtils]: 0: Hoare triple {59#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {61#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:03:54,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {61#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {62#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:03:54,901 INFO L273 TraceCheckUtils]: 2: Hoare triple {62#(<= 3 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {60#false} is VALID [2018-12-19 12:03:54,901 INFO L273 TraceCheckUtils]: 3: Hoare triple {60#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {60#false} is VALID [2018-12-19 12:03:54,902 INFO L273 TraceCheckUtils]: 4: Hoare triple {60#false} assume !false; {60#false} is VALID [2018-12-19 12:03:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:03:54,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:03:54,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:03:54,904 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-19 12:03:54,905 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2018-12-19 12:03:54,941 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:03:54,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:03:55,254 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-19 12:03:55,256 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 75 root evaluator evaluations with a maximum evaluation depth of 3. Performed 75 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-19 12:03:55,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:03:55,263 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-19 12:03:55,493 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 33.33% of their original sizes. [2018-12-19 12:03:55,522 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2018-12-19 12:03:55,753 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2018-12-19 12:03:55,801 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-19 12:03:55,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-19 12:03:55,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-12-19 12:03:55,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:03:55,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-19 12:03:55,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:03:55,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 12:03:55,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:03:55,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 12:03:55,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 12:03:55,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-19 12:03:55,871 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2018-12-19 12:03:56,552 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:03:56,553 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:03:56,553 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:03:56,554 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:03:56,555 WARN L224 ngHoareTripleChecker]: Pre: {103#true} [2018-12-19 12:03:56,555 WARN L228 ngHoareTripleChecker]: Action: ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; [2018-12-19 12:03:56,556 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2018-12-19 12:03:56,556 WARN L230 ngHoareTripleChecker]: Post: {104#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:03:56,556 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:03:56,558 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:03:56,559 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:03:56,561 WARN L270 ngHoareTripleChecker]: Pre: {103#true} [2018-12-19 12:03:56,561 WARN L274 ngHoareTripleChecker]: Action: ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; [2018-12-19 12:03:56,562 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2018-12-19 12:03:56,572 WARN L276 ngHoareTripleChecker]: Post: {104#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:03:56,573 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:03:56,574 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:03:56,574 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, ~n, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, ~n, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-19 12:03:56,575 WARN L628 ntHoareTripleChecker]: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) (~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4;) [2018-12-19 12:03:56,575 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-19 12:03:56,575 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:03:56,619 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:03:56,619 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:03:56,620 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:03:56,620 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:03:56,620 WARN L224 ngHoareTripleChecker]: Pre: {113#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:03:56,621 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-19 12:03:56,621 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-19 12:03:56,621 WARN L230 ngHoareTripleChecker]: Post: {114#false} [2018-12-19 12:03:56,622 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:03:56,622 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:03:56,622 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:03:56,702 WARN L270 ngHoareTripleChecker]: Pre: {113#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:03:56,702 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-19 12:03:56,703 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-19 12:03:56,708 WARN L276 ngHoareTripleChecker]: Post: {114#false} [2018-12-19 12:03:56,709 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:03:56,709 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:03:56,709 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2018-12-19 12:03:56,709 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) (assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1;) [2018-12-19 12:03:56,710 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-19 12:03:56,710 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:03:56,730 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:03:56,731 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:03:56,731 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:03:56,731 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:03:56,732 WARN L224 ngHoareTripleChecker]: Pre: {118#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:03:56,732 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; [2018-12-19 12:03:56,732 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) [2018-12-19 12:03:56,733 WARN L230 ngHoareTripleChecker]: Post: {119#false} [2018-12-19 12:03:56,733 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:03:56,733 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:03:56,733 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:03:56,811 WARN L270 ngHoareTripleChecker]: Pre: {118#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:03:56,812 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; [2018-12-19 12:03:56,812 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) [2018-12-19 12:03:56,850 WARN L276 ngHoareTripleChecker]: Post: {119#false} [2018-12-19 12:03:56,850 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:03:56,850 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:03:56,851 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2018-12-19 12:03:56,851 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) (assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0;) [2018-12-19 12:03:56,851 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-19 12:03:56,852 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:03:56,930 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:03:56,930 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:03:56,930 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:03:56,931 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:03:56,931 WARN L224 ngHoareTripleChecker]: Pre: {126#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:03:56,931 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-19 12:03:56,931 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-19 12:03:56,932 WARN L230 ngHoareTripleChecker]: Post: {127#false} [2018-12-19 12:03:56,932 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:03:56,932 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:03:56,932 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:03:56,958 WARN L270 ngHoareTripleChecker]: Pre: {126#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:03:56,958 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-19 12:03:56,959 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-19 12:03:56,963 WARN L276 ngHoareTripleChecker]: Post: {127#false} [2018-12-19 12:03:56,963 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:03:56,963 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:03:56,964 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2018-12-19 12:03:56,964 WARN L628 ntHoareTripleChecker]: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) (assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1;) [2018-12-19 12:03:56,964 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-19 12:03:56,964 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:03:57,030 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:03:57,030 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:03:57,031 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:03:57,031 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:03:57,031 WARN L224 ngHoareTripleChecker]: Pre: {128#(= c_~n 5)} [2018-12-19 12:03:57,032 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-19 12:03:57,032 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-19 12:03:57,032 WARN L230 ngHoareTripleChecker]: Post: {129#false} [2018-12-19 12:03:57,033 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:03:57,033 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:03:57,033 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:03:57,060 WARN L270 ngHoareTripleChecker]: Pre: {128#(= ~n 5)} [2018-12-19 12:03:57,060 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-19 12:03:57,060 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-19 12:03:57,064 WARN L276 ngHoareTripleChecker]: Post: {129#false} [2018-12-19 12:03:57,064 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:03:57,064 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:03:57,065 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-19 12:03:57,065 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) (assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false;) [2018-12-19 12:03:57,065 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-19 12:03:57,065 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:03:57,691 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:03:57,692 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:03:57,692 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:03:57,692 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:03:57,693 WARN L224 ngHoareTripleChecker]: Pre: {130#(= c_~n 5)} [2018-12-19 12:03:57,693 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-19 12:03:57,693 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-19 12:03:57,693 WARN L230 ngHoareTripleChecker]: Post: {131#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:03:57,693 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:03:57,694 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:03:57,694 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:03:57,696 WARN L270 ngHoareTripleChecker]: Pre: {130#(= ~n 5)} [2018-12-19 12:03:57,696 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-19 12:03:57,696 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-19 12:03:57,701 WARN L276 ngHoareTripleChecker]: Post: {131#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:03:57,701 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:03:57,701 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:03:57,702 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-19 12:03:57,702 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) (assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false;) [2018-12-19 12:03:57,703 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-19 12:03:57,703 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:03:58,377 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:03:58,378 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:03:58,378 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:03:58,378 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:03:58,378 WARN L224 ngHoareTripleChecker]: Pre: {134#(= c_~n 5)} [2018-12-19 12:03:58,379 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-19 12:03:58,379 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-19 12:03:58,379 WARN L230 ngHoareTripleChecker]: Post: {135#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:03:58,379 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:03:58,380 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:03:58,380 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:03:58,391 WARN L270 ngHoareTripleChecker]: Pre: {134#(= ~n 5)} [2018-12-19 12:03:58,391 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-19 12:03:58,391 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-19 12:03:58,402 WARN L276 ngHoareTripleChecker]: Post: {135#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:03:58,402 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:03:58,403 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:03:58,403 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-19 12:03:58,403 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) (assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1;) [2018-12-19 12:03:58,403 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-19 12:03:58,404 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:03:59,090 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:03:59,090 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:03:59,091 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:03:59,091 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:03:59,091 WARN L224 ngHoareTripleChecker]: Pre: {139#(= c_~n 5)} [2018-12-19 12:03:59,092 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-19 12:03:59,092 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-19 12:03:59,092 WARN L230 ngHoareTripleChecker]: Post: {140#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:03:59,093 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:03:59,093 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:03:59,093 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:03:59,105 WARN L270 ngHoareTripleChecker]: Pre: {139#(= ~n 5)} [2018-12-19 12:03:59,106 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-19 12:03:59,106 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-19 12:03:59,121 WARN L276 ngHoareTripleChecker]: Post: {140#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:03:59,121 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:03:59,121 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:03:59,121 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-19 12:03:59,122 WARN L628 ntHoareTripleChecker]: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) (assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1;) [2018-12-19 12:03:59,122 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-19 12:03:59,122 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:03:59,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:03:59,129 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-19 12:03:59,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 12:03:59,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-19 12:03:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:03:59,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:03:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-19 12:03:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:03:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-19 12:03:59,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2018-12-19 12:03:59,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:03:59,170 INFO L225 Difference]: With dead ends: 11 [2018-12-19 12:03:59,170 INFO L226 Difference]: Without dead ends: 9 [2018-12-19 12:03:59,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-19 12:03:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-19 12:03:59,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-19 12:03:59,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:03:59,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 8 states. [2018-12-19 12:03:59,185 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 8 states. [2018-12-19 12:03:59,186 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 8 states. [2018-12-19 12:03:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:03:59,188 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2018-12-19 12:03:59,188 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2018-12-19 12:03:59,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:03:59,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:03:59,189 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states. [2018-12-19 12:03:59,189 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states. [2018-12-19 12:03:59,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:03:59,191 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2018-12-19 12:03:59,191 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2018-12-19 12:03:59,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:03:59,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:03:59,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:03:59,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:03:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:03:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-19 12:03:59,193 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2018-12-19 12:03:59,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:03:59,194 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-19 12:03:59,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 12:03:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-19 12:03:59,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-19 12:03:59,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:03:59,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-19 12:03:59,195 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:03:59,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:03:59,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1948270601, now seen corresponding path program 1 times [2018-12-19 12:03:59,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:03:59,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:03:59,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:03:59,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:03:59,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:03:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:03:59,284 INFO L273 TraceCheckUtils]: 0: Hoare triple {175#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {177#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:03:59,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {177#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {178#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:03:59,307 INFO L273 TraceCheckUtils]: 2: Hoare triple {178#(<= 3 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {176#false} is VALID [2018-12-19 12:03:59,307 INFO L273 TraceCheckUtils]: 3: Hoare triple {176#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {176#false} is VALID [2018-12-19 12:03:59,308 INFO L273 TraceCheckUtils]: 4: Hoare triple {176#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {176#false} is VALID [2018-12-19 12:03:59,308 INFO L273 TraceCheckUtils]: 5: Hoare triple {176#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {176#false} is VALID [2018-12-19 12:03:59,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {176#false} assume !false; {176#false} is VALID [2018-12-19 12:03:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-19 12:03:59,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:03:59,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:03:59,310 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-19 12:03:59,310 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22] [2018-12-19 12:03:59,312 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:03:59,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:03:59,526 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-19 12:03:59,527 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 1 different actions 3 times. Never widened. Performed 82 root evaluator evaluations with a maximum evaluation depth of 4. Performed 82 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-19 12:03:59,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:03:59,527 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-19 12:03:59,788 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 28.89% of their original sizes. [2018-12-19 12:03:59,806 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2018-12-19 12:03:59,881 INFO L420 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2018-12-19 12:03:59,912 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-19 12:03:59,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-19 12:03:59,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2018-12-19 12:03:59,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:03:59,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-12-19 12:03:59,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:03:59,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-12-19 12:03:59,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:03:59,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-19 12:03:59,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-19 12:03:59,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-19 12:03:59,928 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2018-12-19 12:03:59,938 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:03:59,938 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:03:59,939 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:03:59,940 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:03:59,940 WARN L224 ngHoareTripleChecker]: Pre: {238#true} [2018-12-19 12:03:59,940 WARN L228 ngHoareTripleChecker]: Action: ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; [2018-12-19 12:03:59,941 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2018-12-19 12:03:59,941 WARN L230 ngHoareTripleChecker]: Post: {239#(and (= c_ULTIMATE.start_SelectionSort_~rh~4 0) (= c_ULTIMATE.start_SelectionSort_~i~4 1) (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:03:59,941 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:03:59,942 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:03:59,942 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:03:59,944 WARN L270 ngHoareTripleChecker]: Pre: {238#true} [2018-12-19 12:03:59,945 WARN L274 ngHoareTripleChecker]: Action: ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; [2018-12-19 12:03:59,945 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2018-12-19 12:03:59,965 WARN L276 ngHoareTripleChecker]: Post: {239#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:00,035 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:04:00,035 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:04:00,035 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, ~n, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, ~n, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-19 12:04:00,039 WARN L628 ntHoareTripleChecker]: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) (~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4;) [2018-12-19 12:04:00,039 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-19 12:04:00,039 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:04:00,707 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:04:00,707 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:04:00,707 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:04:00,708 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:04:00,708 WARN L224 ngHoareTripleChecker]: Pre: {240#true} [2018-12-19 12:04:00,708 WARN L228 ngHoareTripleChecker]: Action: ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; [2018-12-19 12:04:00,708 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2018-12-19 12:04:00,709 WARN L230 ngHoareTripleChecker]: Post: {241#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:00,709 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:04:00,709 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:04:00,709 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:04:00,710 WARN L270 ngHoareTripleChecker]: Pre: {240#true} [2018-12-19 12:04:00,711 WARN L274 ngHoareTripleChecker]: Action: ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; [2018-12-19 12:04:00,711 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2018-12-19 12:04:00,716 WARN L276 ngHoareTripleChecker]: Post: {241#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:00,716 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:04:00,716 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:04:00,717 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, ~n, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, ~n, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-19 12:04:00,717 WARN L628 ntHoareTripleChecker]: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) (~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4;) [2018-12-19 12:04:00,717 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-19 12:04:00,717 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:04:00,734 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:04:00,735 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:04:00,735 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:04:00,735 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:04:00,735 WARN L224 ngHoareTripleChecker]: Pre: {246#(= c_~n 5)} [2018-12-19 12:04:00,735 WARN L228 ngHoareTripleChecker]: Action: assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; [2018-12-19 12:04:00,736 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~lh~4_primed 0) (not (<= 0 c_ULTIMATE.start_main_~i~7))) [2018-12-19 12:04:00,736 WARN L230 ngHoareTripleChecker]: Post: {247#(and (= c_ULTIMATE.start_SelectionSort_~rh~4 0) (= c_ULTIMATE.start_SelectionSort_~i~4 1) (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:00,736 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:04:00,736 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:04:00,736 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:04:00,738 WARN L270 ngHoareTripleChecker]: Pre: {246#(= ~n 5)} [2018-12-19 12:04:00,738 WARN L274 ngHoareTripleChecker]: Action: assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; [2018-12-19 12:04:00,738 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~lh~4_primed 0) (not (<= 0 c_ULTIMATE.start_main_~i~7))) [2018-12-19 12:04:00,749 WARN L276 ngHoareTripleChecker]: Post: {247#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:00,750 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:04:00,750 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:04:00,750 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-19 12:04:00,751 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start_SelectionSort_~lh~4_primed 0) (not (<= 0 c_ULTIMATE.start_main_~i~7))) (assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0;) [2018-12-19 12:04:00,751 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-19 12:04:00,751 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:04:00,759 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:04:00,759 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:04:00,759 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:04:00,760 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:04:00,760 WARN L224 ngHoareTripleChecker]: Pre: {250#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:00,760 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-19 12:04:00,760 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-19 12:04:00,761 WARN L230 ngHoareTripleChecker]: Post: {251#false} [2018-12-19 12:04:00,761 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:04:00,762 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:04:00,762 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:04:00,766 WARN L270 ngHoareTripleChecker]: Pre: {250#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:00,766 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-19 12:04:00,767 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-19 12:04:00,769 WARN L276 ngHoareTripleChecker]: Post: {251#false} [2018-12-19 12:04:00,769 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:04:00,769 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:04:00,769 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2018-12-19 12:04:00,770 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) (assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1;) [2018-12-19 12:04:00,770 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-19 12:04:00,770 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:04:00,797 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:04:00,797 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:04:00,797 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:04:00,797 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:04:00,798 WARN L224 ngHoareTripleChecker]: Pre: {258#(and (= c_ULTIMATE.start_SelectionSort_~rh~4 0) (= c_ULTIMATE.start_SelectionSort_~i~4 1) (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:00,798 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-19 12:04:00,798 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-19 12:04:00,798 WARN L230 ngHoareTripleChecker]: Post: {259#false} [2018-12-19 12:04:00,798 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:04:00,799 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:04:00,799 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:04:00,806 WARN L270 ngHoareTripleChecker]: Pre: {258#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:00,806 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-19 12:04:00,807 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-19 12:04:00,808 WARN L276 ngHoareTripleChecker]: Post: {259#false} [2018-12-19 12:04:00,809 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:04:00,809 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:04:00,809 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ULTIMATE.start_SelectionSort_~i~4 = 1; ~n = 5; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ULTIMATE.start_SelectionSort_~i~4 = 1; ~n = 5; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2018-12-19 12:04:00,809 WARN L628 ntHoareTripleChecker]: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) (assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1;) [2018-12-19 12:04:00,810 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-19 12:04:00,810 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:04:00,913 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:04:00,913 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:04:00,913 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:04:00,914 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:04:00,914 WARN L224 ngHoareTripleChecker]: Pre: {272#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:00,914 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; [2018-12-19 12:04:00,914 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) [2018-12-19 12:04:00,914 WARN L230 ngHoareTripleChecker]: Post: {273#false} [2018-12-19 12:04:00,915 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:04:00,915 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:04:00,915 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:04:00,922 WARN L270 ngHoareTripleChecker]: Pre: {272#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:00,922 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; [2018-12-19 12:04:00,922 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) [2018-12-19 12:04:00,926 WARN L276 ngHoareTripleChecker]: Post: {273#false} [2018-12-19 12:04:00,927 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:04:00,927 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:04:00,927 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2018-12-19 12:04:00,927 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) (assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0;) [2018-12-19 12:04:00,927 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-19 12:04:00,928 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:04:00,968 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:04:00,969 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:04:00,969 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:04:00,969 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:04:00,969 WARN L224 ngHoareTripleChecker]: Pre: {283#(= c_~n 5)} [2018-12-19 12:04:00,970 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-19 12:04:00,970 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-19 12:04:00,970 WARN L230 ngHoareTripleChecker]: Post: {284#false} [2018-12-19 12:04:00,971 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:04:00,971 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:04:00,971 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:04:00,975 WARN L270 ngHoareTripleChecker]: Pre: {283#(= ~n 5)} [2018-12-19 12:04:00,976 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-19 12:04:00,976 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-19 12:04:00,977 WARN L276 ngHoareTripleChecker]: Post: {284#false} [2018-12-19 12:04:00,977 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:04:00,977 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:04:00,978 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-19 12:04:00,978 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) (assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false;) [2018-12-19 12:04:00,978 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-19 12:04:00,978 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:04:01,006 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:04:01,006 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:04:01,007 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:04:01,007 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:04:01,007 WARN L224 ngHoareTripleChecker]: Pre: {285#(= c_~n 5)} [2018-12-19 12:04:01,007 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-19 12:04:01,007 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-19 12:04:01,008 WARN L230 ngHoareTripleChecker]: Post: {286#(and (= c_ULTIMATE.start_SelectionSort_~rh~4 0) (= c_ULTIMATE.start_SelectionSort_~i~4 1) (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:01,008 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:04:01,008 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:04:01,009 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:04:01,012 WARN L270 ngHoareTripleChecker]: Pre: {285#(= ~n 5)} [2018-12-19 12:04:01,012 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-19 12:04:01,013 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-19 12:04:01,035 WARN L276 ngHoareTripleChecker]: Post: {286#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:01,036 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:04:01,036 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:04:01,036 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-19 12:04:01,036 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) (assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false;) [2018-12-19 12:04:01,037 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-19 12:04:01,037 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:04:01,696 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:04:01,696 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:04:01,696 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:04:01,697 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:04:01,697 WARN L224 ngHoareTripleChecker]: Pre: {287#(= c_~n 5)} [2018-12-19 12:04:01,697 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-19 12:04:01,697 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-19 12:04:01,698 WARN L230 ngHoareTripleChecker]: Post: {288#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:01,698 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:04:01,698 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:04:01,698 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:04:01,709 WARN L270 ngHoareTripleChecker]: Pre: {287#(= ~n 5)} [2018-12-19 12:04:01,709 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-19 12:04:01,709 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-19 12:04:01,714 WARN L276 ngHoareTripleChecker]: Post: {288#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:01,714 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:04:01,714 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:04:01,715 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-19 12:04:01,715 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) (assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false;) [2018-12-19 12:04:01,715 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-19 12:04:01,715 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:04:01,722 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:04:01,722 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:04:01,722 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:04:01,723 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:04:01,723 WARN L224 ngHoareTripleChecker]: Pre: {291#(= c_~n 5)} [2018-12-19 12:04:01,723 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-19 12:04:01,723 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-19 12:04:01,723 WARN L230 ngHoareTripleChecker]: Post: {292#(and (= c_ULTIMATE.start_SelectionSort_~rh~4 0) (= c_ULTIMATE.start_SelectionSort_~i~4 1) (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:01,723 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:04:01,724 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:04:01,724 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:04:01,725 WARN L270 ngHoareTripleChecker]: Pre: {291#(= ~n 5)} [2018-12-19 12:04:01,725 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-19 12:04:01,726 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-19 12:04:01,739 WARN L276 ngHoareTripleChecker]: Post: {292#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:01,739 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:04:01,739 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:04:01,739 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-19 12:04:01,740 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) (assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1;) [2018-12-19 12:04:01,740 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-19 12:04:01,740 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:04:02,382 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:04:02,382 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:04:02,382 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:04:02,382 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:04:02,383 WARN L224 ngHoareTripleChecker]: Pre: {293#(= c_~n 5)} [2018-12-19 12:04:02,383 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-19 12:04:02,383 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-19 12:04:02,383 WARN L230 ngHoareTripleChecker]: Post: {294#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:02,383 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:04:02,384 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:04:02,384 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:04:02,385 WARN L270 ngHoareTripleChecker]: Pre: {293#(= ~n 5)} [2018-12-19 12:04:02,386 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-19 12:04:02,386 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-19 12:04:02,390 WARN L276 ngHoareTripleChecker]: Post: {294#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:02,390 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:04:02,391 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:04:02,391 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-19 12:04:02,391 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) (assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1;) [2018-12-19 12:04:02,391 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-19 12:04:02,392 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:04:03,034 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-19 12:04:03,034 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-19 12:04:03,034 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:04:03,035 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:04:03,035 WARN L224 ngHoareTripleChecker]: Pre: {298#(= c_~n 5)} [2018-12-19 12:04:03,035 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-19 12:04:03,035 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-19 12:04:03,035 WARN L230 ngHoareTripleChecker]: Post: {299#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:03,035 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:04:03,036 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:04:03,036 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:04:03,037 WARN L270 ngHoareTripleChecker]: Pre: {298#(= ~n 5)} [2018-12-19 12:04:03,038 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-19 12:04:03,038 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-19 12:04:03,055 WARN L276 ngHoareTripleChecker]: Post: {299#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-19 12:04:03,056 WARN L620 ntHoareTripleChecker]: -- [2018-12-19 12:04:03,056 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-19 12:04:03,056 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-19 12:04:03,056 WARN L628 ntHoareTripleChecker]: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) (assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1;) [2018-12-19 12:04:03,056 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-19 12:04:03,057 WARN L630 ntHoareTripleChecker]: -- [2018-12-19 12:04:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:03,067 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-12-19 12:04:03,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-19 12:04:03,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-12-19 12:04:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:04:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-19 12:04:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-12-19 12:04:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-19 12:04:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-12-19 12:04:03,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2018-12-19 12:04:03,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:03,136 INFO L225 Difference]: With dead ends: 14 [2018-12-19 12:04:03,136 INFO L226 Difference]: Without dead ends: 10 [2018-12-19 12:04:03,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-19 12:04:03,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-19 12:04:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-12-19 12:04:03,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:04:03,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 9 states. [2018-12-19 12:04:03,161 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 9 states. [2018-12-19 12:04:03,161 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 9 states. [2018-12-19 12:04:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:03,162 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2018-12-19 12:04:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-12-19 12:04:03,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:03,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:03,163 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 10 states. [2018-12-19 12:04:03,163 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 10 states. [2018-12-19 12:04:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:03,164 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2018-12-19 12:04:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-12-19 12:04:03,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:03,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:03,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:04:03,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:04:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-19 12:04:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-19 12:04:03,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2018-12-19 12:04:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:04:03,166 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-19 12:04:03,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-19 12:04:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-12-19 12:04:03,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-19 12:04:03,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:04:03,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-19 12:04:03,167 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:04:03,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:04:03,167 INFO L82 PathProgramCache]: Analyzing trace with hash 266915571, now seen corresponding path program 1 times [2018-12-19 12:04:03,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:04:03,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:03,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:04:03,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:03,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:04:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:03,236 INFO L273 TraceCheckUtils]: 0: Hoare triple {338#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {340#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:03,237 INFO L273 TraceCheckUtils]: 1: Hoare triple {340#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {341#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:03,238 INFO L273 TraceCheckUtils]: 2: Hoare triple {341#(<= 3 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {339#false} is VALID [2018-12-19 12:04:03,238 INFO L273 TraceCheckUtils]: 3: Hoare triple {339#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {339#false} is VALID [2018-12-19 12:04:03,239 INFO L273 TraceCheckUtils]: 4: Hoare triple {339#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {339#false} is VALID [2018-12-19 12:04:03,239 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {339#false} is VALID [2018-12-19 12:04:03,239 INFO L273 TraceCheckUtils]: 6: Hoare triple {339#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {339#false} is VALID [2018-12-19 12:04:03,240 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#false} assume !false; {339#false} is VALID [2018-12-19 12:04:03,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-19 12:04:03,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:04:03,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:04:03,242 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-19 12:04:03,242 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22], [24] [2018-12-19 12:04:03,243 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:04:03,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:04:03,438 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:04:03,439 INFO L272 AbstractInterpreter]: Visited 8 different actions 32 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 299 root evaluator evaluations with a maximum evaluation depth of 4. Performed 299 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-19 12:04:03,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:04:03,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:04:03,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:04:03,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-12-19 12:04:03,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:04:03,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:04:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:03,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:04:03,644 INFO L273 TraceCheckUtils]: 0: Hoare triple {338#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {340#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:03,646 INFO L273 TraceCheckUtils]: 1: Hoare triple {340#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {341#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:03,646 INFO L273 TraceCheckUtils]: 2: Hoare triple {341#(<= 3 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {339#false} is VALID [2018-12-19 12:04:03,646 INFO L273 TraceCheckUtils]: 3: Hoare triple {339#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {339#false} is VALID [2018-12-19 12:04:03,647 INFO L273 TraceCheckUtils]: 4: Hoare triple {339#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {339#false} is VALID [2018-12-19 12:04:03,647 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {339#false} is VALID [2018-12-19 12:04:03,647 INFO L273 TraceCheckUtils]: 6: Hoare triple {339#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {339#false} is VALID [2018-12-19 12:04:03,647 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#false} assume !false; {339#false} is VALID [2018-12-19 12:04:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-19 12:04:03,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:04:03,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#false} assume !false; {339#false} is VALID [2018-12-19 12:04:03,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {339#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {339#false} is VALID [2018-12-19 12:04:03,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {339#false} is VALID [2018-12-19 12:04:03,731 INFO L273 TraceCheckUtils]: 4: Hoare triple {339#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {339#false} is VALID [2018-12-19 12:04:03,732 INFO L273 TraceCheckUtils]: 3: Hoare triple {339#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {339#false} is VALID [2018-12-19 12:04:03,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {381#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {339#false} is VALID [2018-12-19 12:04:03,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {385#(< 0 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {381#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:03,733 INFO L273 TraceCheckUtils]: 0: Hoare triple {338#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {385#(< 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-19 12:04:03,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:04:03,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-19 12:04:03,755 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:04:03,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-19 12:04:03,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:04:03,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 12:04:03,767 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:03,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 12:04:03,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 12:04:03,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-19 12:04:03,768 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2018-12-19 12:04:03,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:03,894 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2018-12-19 12:04:03,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 12:04:03,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-19 12:04:03,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:04:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:04:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-19 12:04:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:04:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-19 12:04:03,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2018-12-19 12:04:03,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:03,957 INFO L225 Difference]: With dead ends: 16 [2018-12-19 12:04:03,957 INFO L226 Difference]: Without dead ends: 10 [2018-12-19 12:04:03,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-12-19 12:04:03,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-19 12:04:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-19 12:04:04,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:04:04,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2018-12-19 12:04:04,032 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2018-12-19 12:04:04,032 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2018-12-19 12:04:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:04,033 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-12-19 12:04:04,034 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-19 12:04:04,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:04,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:04,034 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2018-12-19 12:04:04,034 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2018-12-19 12:04:04,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:04,036 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-12-19 12:04:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-19 12:04:04,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:04,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:04,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:04:04,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:04:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-19 12:04:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-19 12:04:04,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-12-19 12:04:04,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:04:04,038 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-19 12:04:04,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 12:04:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-19 12:04:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-19 12:04:04,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:04:04,039 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-19 12:04:04,039 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:04:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:04:04,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1192626986, now seen corresponding path program 2 times [2018-12-19 12:04:04,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:04:04,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:04,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:04:04,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:04,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:04:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:04,149 INFO L273 TraceCheckUtils]: 0: Hoare triple {455#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {457#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,151 INFO L273 TraceCheckUtils]: 1: Hoare triple {457#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {458#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,152 INFO L273 TraceCheckUtils]: 2: Hoare triple {458#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {459#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,153 INFO L273 TraceCheckUtils]: 3: Hoare triple {459#(<= 2 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {456#false} is VALID [2018-12-19 12:04:04,153 INFO L273 TraceCheckUtils]: 4: Hoare triple {456#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {456#false} is VALID [2018-12-19 12:04:04,153 INFO L273 TraceCheckUtils]: 5: Hoare triple {456#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {456#false} is VALID [2018-12-19 12:04:04,154 INFO L273 TraceCheckUtils]: 6: Hoare triple {456#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {456#false} is VALID [2018-12-19 12:04:04,154 INFO L273 TraceCheckUtils]: 7: Hoare triple {456#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {456#false} is VALID [2018-12-19 12:04:04,154 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#false} assume !false; {456#false} is VALID [2018-12-19 12:04:04,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-19 12:04:04,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:04:04,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:04:04,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-19 12:04:04,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-19 12:04:04,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:04:04,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-12-19 12:04:04,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-19 12:04:04,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-19 12:04:04,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-19 12:04:04,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-19 12:04:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:04,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:04:04,233 INFO L273 TraceCheckUtils]: 0: Hoare triple {455#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {457#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {457#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {458#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,237 INFO L273 TraceCheckUtils]: 2: Hoare triple {458#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {459#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,241 INFO L273 TraceCheckUtils]: 3: Hoare triple {459#(<= 2 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {456#false} is VALID [2018-12-19 12:04:04,242 INFO L273 TraceCheckUtils]: 4: Hoare triple {456#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {456#false} is VALID [2018-12-19 12:04:04,242 INFO L273 TraceCheckUtils]: 5: Hoare triple {456#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {456#false} is VALID [2018-12-19 12:04:04,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {456#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {456#false} is VALID [2018-12-19 12:04:04,242 INFO L273 TraceCheckUtils]: 7: Hoare triple {456#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {456#false} is VALID [2018-12-19 12:04:04,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#false} assume !false; {456#false} is VALID [2018-12-19 12:04:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-19 12:04:04,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:04:04,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#false} assume !false; {456#false} is VALID [2018-12-19 12:04:04,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {456#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {456#false} is VALID [2018-12-19 12:04:04,317 INFO L273 TraceCheckUtils]: 6: Hoare triple {456#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {456#false} is VALID [2018-12-19 12:04:04,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {456#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {456#false} is VALID [2018-12-19 12:04:04,317 INFO L273 TraceCheckUtils]: 4: Hoare triple {456#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {456#false} is VALID [2018-12-19 12:04:04,320 INFO L273 TraceCheckUtils]: 3: Hoare triple {502#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {456#false} is VALID [2018-12-19 12:04:04,322 INFO L273 TraceCheckUtils]: 2: Hoare triple {506#(< 0 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {502#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {459#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {506#(< 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,323 INFO L273 TraceCheckUtils]: 0: Hoare triple {455#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {459#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-19 12:04:04,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:04:04,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-19 12:04:04,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:04:04,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-19 12:04:04,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:04:04,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-12-19 12:04:04,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:04,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-19 12:04:04,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-19 12:04:04,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:04:04,356 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-12-19 12:04:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:04,464 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-19 12:04:04,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-19 12:04:04,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-19 12:04:04,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:04:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-19 12:04:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-12-19 12:04:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-19 12:04:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-12-19 12:04:04,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 17 transitions. [2018-12-19 12:04:04,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:04,489 INFO L225 Difference]: With dead ends: 17 [2018-12-19 12:04:04,489 INFO L226 Difference]: Without dead ends: 11 [2018-12-19 12:04:04,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:04:04,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-19 12:04:04,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-19 12:04:04,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:04:04,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2018-12-19 12:04:04,508 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2018-12-19 12:04:04,508 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2018-12-19 12:04:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:04,510 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-19 12:04:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-19 12:04:04,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:04,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:04,511 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2018-12-19 12:04:04,512 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2018-12-19 12:04:04,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:04,513 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-19 12:04:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-19 12:04:04,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:04,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:04,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:04:04,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:04:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-19 12:04:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-19 12:04:04,515 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-12-19 12:04:04,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:04:04,515 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-19 12:04:04,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-19 12:04:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-19 12:04:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-19 12:04:04,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:04:04,516 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-12-19 12:04:04,516 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:04:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:04:04,516 INFO L82 PathProgramCache]: Analyzing trace with hash -175090221, now seen corresponding path program 3 times [2018-12-19 12:04:04,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:04:04,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:04,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-19 12:04:04,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:04,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:04:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:04,619 INFO L273 TraceCheckUtils]: 0: Hoare triple {585#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {587#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {587#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {588#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,621 INFO L273 TraceCheckUtils]: 2: Hoare triple {588#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {589#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,623 INFO L273 TraceCheckUtils]: 3: Hoare triple {589#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {590#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,625 INFO L273 TraceCheckUtils]: 4: Hoare triple {590#(<= 1 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {586#false} is VALID [2018-12-19 12:04:04,625 INFO L273 TraceCheckUtils]: 5: Hoare triple {586#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {586#false} is VALID [2018-12-19 12:04:04,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {586#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {586#false} is VALID [2018-12-19 12:04:04,626 INFO L273 TraceCheckUtils]: 7: Hoare triple {586#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {586#false} is VALID [2018-12-19 12:04:04,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {586#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {586#false} is VALID [2018-12-19 12:04:04,627 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#false} assume !false; {586#false} is VALID [2018-12-19 12:04:04,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-19 12:04:04,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:04:04,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:04:04,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-19 12:04:04,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-19 12:04:04,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:04:04,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-12-19 12:04:04,636 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-19 12:04:04,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-19 12:04:04,662 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-19 12:04:04,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-19 12:04:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:04,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:04:04,722 INFO L273 TraceCheckUtils]: 0: Hoare triple {585#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {587#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,723 INFO L273 TraceCheckUtils]: 1: Hoare triple {587#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {588#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {588#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {589#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,724 INFO L273 TraceCheckUtils]: 3: Hoare triple {589#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {590#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,725 INFO L273 TraceCheckUtils]: 4: Hoare triple {590#(<= 1 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {586#false} is VALID [2018-12-19 12:04:04,726 INFO L273 TraceCheckUtils]: 5: Hoare triple {586#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {586#false} is VALID [2018-12-19 12:04:04,726 INFO L273 TraceCheckUtils]: 6: Hoare triple {586#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {586#false} is VALID [2018-12-19 12:04:04,726 INFO L273 TraceCheckUtils]: 7: Hoare triple {586#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {586#false} is VALID [2018-12-19 12:04:04,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {586#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {586#false} is VALID [2018-12-19 12:04:04,726 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#false} assume !false; {586#false} is VALID [2018-12-19 12:04:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-19 12:04:04,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:04:04,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#false} assume !false; {586#false} is VALID [2018-12-19 12:04:04,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {586#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {586#false} is VALID [2018-12-19 12:04:04,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {586#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {586#false} is VALID [2018-12-19 12:04:04,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {586#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {586#false} is VALID [2018-12-19 12:04:04,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {586#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {586#false} is VALID [2018-12-19 12:04:04,801 INFO L273 TraceCheckUtils]: 4: Hoare triple {636#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {586#false} is VALID [2018-12-19 12:04:04,801 INFO L273 TraceCheckUtils]: 3: Hoare triple {590#(<= 1 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {636#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,802 INFO L273 TraceCheckUtils]: 2: Hoare triple {589#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {590#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {588#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {589#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,804 INFO L273 TraceCheckUtils]: 0: Hoare triple {585#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {588#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:04,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-19 12:04:04,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:04:04,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2018-12-19 12:04:04,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:04:04,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-19 12:04:04,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:04:04,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-19 12:04:04,837 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:04,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-19 12:04:04,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-19 12:04:04,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:04:04,839 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2018-12-19 12:04:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:04,943 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2018-12-19 12:04:04,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-19 12:04:04,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-19 12:04:04,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:04:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:04:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-12-19 12:04:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:04:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-12-19 12:04:04,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2018-12-19 12:04:05,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:05,003 INFO L225 Difference]: With dead ends: 18 [2018-12-19 12:04:05,004 INFO L226 Difference]: Without dead ends: 12 [2018-12-19 12:04:05,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:04:05,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-19 12:04:05,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-19 12:04:05,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:04:05,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-12-19 12:04:05,023 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-12-19 12:04:05,023 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-12-19 12:04:05,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:05,025 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-12-19 12:04:05,025 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-19 12:04:05,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:05,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:05,026 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-12-19 12:04:05,026 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-12-19 12:04:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:05,027 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-12-19 12:04:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-19 12:04:05,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:05,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:05,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:04:05,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:04:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-19 12:04:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-19 12:04:05,030 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2018-12-19 12:04:05,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:04:05,030 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-19 12:04:05,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-19 12:04:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-19 12:04:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-19 12:04:05,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:04:05,031 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-12-19 12:04:05,031 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:04:05,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:04:05,031 INFO L82 PathProgramCache]: Analyzing trace with hash 375349322, now seen corresponding path program 4 times [2018-12-19 12:04:05,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:04:05,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:05,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-19 12:04:05,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:05,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:04:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:05,148 INFO L273 TraceCheckUtils]: 0: Hoare triple {727#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {729#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:05,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {729#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {730#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:05,151 INFO L273 TraceCheckUtils]: 2: Hoare triple {730#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {731#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:05,152 INFO L273 TraceCheckUtils]: 3: Hoare triple {731#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {732#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:05,153 INFO L273 TraceCheckUtils]: 4: Hoare triple {732#(<= 1 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {733#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:05,154 INFO L273 TraceCheckUtils]: 5: Hoare triple {733#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {728#false} is VALID [2018-12-19 12:04:05,154 INFO L273 TraceCheckUtils]: 6: Hoare triple {728#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {728#false} is VALID [2018-12-19 12:04:05,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {728#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {728#false} is VALID [2018-12-19 12:04:05,155 INFO L273 TraceCheckUtils]: 8: Hoare triple {728#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {728#false} is VALID [2018-12-19 12:04:05,155 INFO L273 TraceCheckUtils]: 9: Hoare triple {728#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {728#false} is VALID [2018-12-19 12:04:05,156 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#false} assume !false; {728#false} is VALID [2018-12-19 12:04:05,157 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-19 12:04:05,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:04:05,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:04:05,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-19 12:04:05,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-19 12:04:05,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:04:05,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-12-19 12:04:05,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:04:05,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:04:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:05,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:04:05,316 INFO L273 TraceCheckUtils]: 0: Hoare triple {727#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {729#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:05,317 INFO L273 TraceCheckUtils]: 1: Hoare triple {729#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {730#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:05,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {730#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {731#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:05,320 INFO L273 TraceCheckUtils]: 3: Hoare triple {731#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {732#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:05,321 INFO L273 TraceCheckUtils]: 4: Hoare triple {732#(<= 1 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {733#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:05,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {733#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {728#false} is VALID [2018-12-19 12:04:05,322 INFO L273 TraceCheckUtils]: 6: Hoare triple {728#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {728#false} is VALID [2018-12-19 12:04:05,323 INFO L273 TraceCheckUtils]: 7: Hoare triple {728#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {728#false} is VALID [2018-12-19 12:04:05,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {728#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {728#false} is VALID [2018-12-19 12:04:05,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {728#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {728#false} is VALID [2018-12-19 12:04:05,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#false} assume !false; {728#false} is VALID [2018-12-19 12:04:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-19 12:04:05,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:04:05,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#false} assume !false; {728#false} is VALID [2018-12-19 12:04:05,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {728#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {728#false} is VALID [2018-12-19 12:04:05,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {728#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {728#false} is VALID [2018-12-19 12:04:05,397 INFO L273 TraceCheckUtils]: 7: Hoare triple {728#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {728#false} is VALID [2018-12-19 12:04:05,397 INFO L273 TraceCheckUtils]: 6: Hoare triple {728#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {728#false} is VALID [2018-12-19 12:04:05,411 INFO L273 TraceCheckUtils]: 5: Hoare triple {733#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {728#false} is VALID [2018-12-19 12:04:05,413 INFO L273 TraceCheckUtils]: 4: Hoare triple {732#(<= 1 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {733#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:05,413 INFO L273 TraceCheckUtils]: 3: Hoare triple {731#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {732#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:05,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {730#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {731#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:05,417 INFO L273 TraceCheckUtils]: 1: Hoare triple {729#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {730#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:05,418 INFO L273 TraceCheckUtils]: 0: Hoare triple {727#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {729#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-19 12:04:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-19 12:04:05,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:04:05,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-19 12:04:05,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:04:05,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-19 12:04:05,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:04:05,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-12-19 12:04:05,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:05,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-19 12:04:05,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-19 12:04:05,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:04:05,451 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2018-12-19 12:04:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:05,631 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-12-19 12:04:05,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-19 12:04:05,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-19 12:04:05,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:04:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-19 12:04:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-12-19 12:04:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-19 12:04:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-12-19 12:04:05,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2018-12-19 12:04:05,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:05,658 INFO L225 Difference]: With dead ends: 19 [2018-12-19 12:04:05,658 INFO L226 Difference]: Without dead ends: 13 [2018-12-19 12:04:05,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:04:05,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-19 12:04:05,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-19 12:04:05,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:04:05,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-12-19 12:04:05,747 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-12-19 12:04:05,748 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-12-19 12:04:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:05,749 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-19 12:04:05,749 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-19 12:04:05,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:05,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:05,750 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-12-19 12:04:05,750 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-12-19 12:04:05,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:05,751 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-19 12:04:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-19 12:04:05,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:05,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:05,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:04:05,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:04:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-19 12:04:05,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-19 12:04:05,753 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2018-12-19 12:04:05,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:04:05,754 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-19 12:04:05,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-19 12:04:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-19 12:04:05,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-19 12:04:05,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:04:05,755 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-12-19 12:04:05,755 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:04:05,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:04:05,755 INFO L82 PathProgramCache]: Analyzing trace with hash 259105971, now seen corresponding path program 5 times [2018-12-19 12:04:05,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:04:05,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:05,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:04:05,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:05,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:04:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:05,848 INFO L273 TraceCheckUtils]: 0: Hoare triple {881#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {881#true} is VALID [2018-12-19 12:04:05,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {881#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {881#true} is VALID [2018-12-19 12:04:05,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {881#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {881#true} is VALID [2018-12-19 12:04:05,849 INFO L273 TraceCheckUtils]: 3: Hoare triple {881#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {881#true} is VALID [2018-12-19 12:04:05,850 INFO L273 TraceCheckUtils]: 4: Hoare triple {881#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {881#true} is VALID [2018-12-19 12:04:05,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {881#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {881#true} is VALID [2018-12-19 12:04:05,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {881#true} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {881#true} is VALID [2018-12-19 12:04:05,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {881#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {883#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ULTIMATE.start_SelectionSort_~i~4)} is VALID [2018-12-19 12:04:05,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {883#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ULTIMATE.start_SelectionSort_~i~4)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2018-12-19 12:04:05,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {885#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ~n)} is VALID [2018-12-19 12:04:05,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {885#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ~n)} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {882#false} is VALID [2018-12-19 12:04:05,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {882#false} assume !false; {882#false} is VALID [2018-12-19 12:04:05,854 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-19 12:04:05,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:04:05,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:04:05,855 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-19 12:04:05,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-19 12:04:05,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:04:05,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-12-19 12:04:05,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-19 12:04:05,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-19 12:04:05,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-19 12:04:05,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-19 12:04:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:05,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:04:06,016 INFO L273 TraceCheckUtils]: 0: Hoare triple {881#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {889#(<= 5 ~n)} is VALID [2018-12-19 12:04:06,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {889#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {889#(<= 5 ~n)} is VALID [2018-12-19 12:04:06,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {889#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {889#(<= 5 ~n)} is VALID [2018-12-19 12:04:06,023 INFO L273 TraceCheckUtils]: 3: Hoare triple {889#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {889#(<= 5 ~n)} is VALID [2018-12-19 12:04:06,023 INFO L273 TraceCheckUtils]: 4: Hoare triple {889#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {889#(<= 5 ~n)} is VALID [2018-12-19 12:04:06,024 INFO L273 TraceCheckUtils]: 5: Hoare triple {889#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {889#(<= 5 ~n)} is VALID [2018-12-19 12:04:06,024 INFO L273 TraceCheckUtils]: 6: Hoare triple {889#(<= 5 ~n)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {908#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2018-12-19 12:04:06,025 INFO L273 TraceCheckUtils]: 7: Hoare triple {908#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {908#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2018-12-19 12:04:06,026 INFO L273 TraceCheckUtils]: 8: Hoare triple {908#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {908#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2018-12-19 12:04:06,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {908#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {918#(and (<= ULTIMATE.start_SelectionSort_~lh~4 1) (<= 5 ~n))} is VALID [2018-12-19 12:04:06,050 INFO L273 TraceCheckUtils]: 10: Hoare triple {918#(and (<= ULTIMATE.start_SelectionSort_~lh~4 1) (<= 5 ~n))} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {882#false} is VALID [2018-12-19 12:04:06,050 INFO L273 TraceCheckUtils]: 11: Hoare triple {882#false} assume !false; {882#false} is VALID [2018-12-19 12:04:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-19 12:04:06,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:04:06,136 INFO L273 TraceCheckUtils]: 11: Hoare triple {882#false} assume !false; {882#false} is VALID [2018-12-19 12:04:06,137 INFO L273 TraceCheckUtils]: 10: Hoare triple {885#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ~n)} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {882#false} is VALID [2018-12-19 12:04:06,138 INFO L273 TraceCheckUtils]: 9: Hoare triple {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {885#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ~n)} is VALID [2018-12-19 12:04:06,138 INFO L273 TraceCheckUtils]: 8: Hoare triple {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2018-12-19 12:04:06,139 INFO L273 TraceCheckUtils]: 7: Hoare triple {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2018-12-19 12:04:06,139 INFO L273 TraceCheckUtils]: 6: Hoare triple {940#(< 1 ~n)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2018-12-19 12:04:06,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {940#(< 1 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {940#(< 1 ~n)} is VALID [2018-12-19 12:04:06,141 INFO L273 TraceCheckUtils]: 4: Hoare triple {940#(< 1 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {940#(< 1 ~n)} is VALID [2018-12-19 12:04:06,141 INFO L273 TraceCheckUtils]: 3: Hoare triple {940#(< 1 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {940#(< 1 ~n)} is VALID [2018-12-19 12:04:06,142 INFO L273 TraceCheckUtils]: 2: Hoare triple {940#(< 1 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {940#(< 1 ~n)} is VALID [2018-12-19 12:04:06,143 INFO L273 TraceCheckUtils]: 1: Hoare triple {940#(< 1 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {940#(< 1 ~n)} is VALID [2018-12-19 12:04:06,144 INFO L273 TraceCheckUtils]: 0: Hoare triple {881#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {940#(< 1 ~n)} is VALID [2018-12-19 12:04:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-19 12:04:06,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:04:06,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2018-12-19 12:04:06,166 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:04:06,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-19 12:04:06,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:04:06,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-19 12:04:06,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:06,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-19 12:04:06,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-19 12:04:06,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-19 12:04:06,226 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 8 states. [2018-12-19 12:04:06,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:06,537 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-12-19 12:04:06,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-19 12:04:06,538 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-19 12:04:06,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:04:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:04:06,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-12-19 12:04:06,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:04:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-12-19 12:04:06,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2018-12-19 12:04:06,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:06,578 INFO L225 Difference]: With dead ends: 21 [2018-12-19 12:04:06,578 INFO L226 Difference]: Without dead ends: 19 [2018-12-19 12:04:06,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2018-12-19 12:04:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-19 12:04:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-19 12:04:06,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:04:06,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-12-19 12:04:06,665 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-12-19 12:04:06,666 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-12-19 12:04:06,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:06,667 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-12-19 12:04:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2018-12-19 12:04:06,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:06,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:06,668 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-12-19 12:04:06,668 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-12-19 12:04:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:06,670 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-12-19 12:04:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2018-12-19 12:04:06,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:06,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:06,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:04:06,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:04:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-19 12:04:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-19 12:04:06,672 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2018-12-19 12:04:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:04:06,672 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-19 12:04:06,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-19 12:04:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2018-12-19 12:04:06,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-19 12:04:06,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:04:06,674 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2018-12-19 12:04:06,674 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:04:06,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:04:06,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1746247989, now seen corresponding path program 6 times [2018-12-19 12:04:06,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:04:06,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:06,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-19 12:04:06,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:06,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:04:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:06,757 INFO L273 TraceCheckUtils]: 0: Hoare triple {1079#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1079#true} is VALID [2018-12-19 12:04:06,758 INFO L273 TraceCheckUtils]: 1: Hoare triple {1079#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1079#true} is VALID [2018-12-19 12:04:06,758 INFO L273 TraceCheckUtils]: 2: Hoare triple {1079#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1079#true} is VALID [2018-12-19 12:04:06,758 INFO L273 TraceCheckUtils]: 3: Hoare triple {1079#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1079#true} is VALID [2018-12-19 12:04:06,759 INFO L273 TraceCheckUtils]: 4: Hoare triple {1079#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1079#true} is VALID [2018-12-19 12:04:06,759 INFO L273 TraceCheckUtils]: 5: Hoare triple {1079#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1079#true} is VALID [2018-12-19 12:04:06,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {1079#true} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1079#true} is VALID [2018-12-19 12:04:06,760 INFO L273 TraceCheckUtils]: 7: Hoare triple {1079#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1079#true} is VALID [2018-12-19 12:04:06,760 INFO L273 TraceCheckUtils]: 8: Hoare triple {1079#true} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1079#true} is VALID [2018-12-19 12:04:06,760 INFO L273 TraceCheckUtils]: 9: Hoare triple {1079#true} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1079#true} is VALID [2018-12-19 12:04:06,767 INFO L273 TraceCheckUtils]: 10: Hoare triple {1079#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1081#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2018-12-19 12:04:06,773 INFO L273 TraceCheckUtils]: 11: Hoare triple {1081#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1082#(<= ~n ULTIMATE.start_SelectionSort_~lh~4)} is VALID [2018-12-19 12:04:06,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {1082#(<= ~n ULTIMATE.start_SelectionSort_~lh~4)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1080#false} is VALID [2018-12-19 12:04:06,774 INFO L273 TraceCheckUtils]: 13: Hoare triple {1080#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1080#false} is VALID [2018-12-19 12:04:06,774 INFO L273 TraceCheckUtils]: 14: Hoare triple {1080#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1080#false} is VALID [2018-12-19 12:04:06,774 INFO L273 TraceCheckUtils]: 15: Hoare triple {1080#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1080#false} is VALID [2018-12-19 12:04:06,774 INFO L273 TraceCheckUtils]: 16: Hoare triple {1080#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1080#false} is VALID [2018-12-19 12:04:06,775 INFO L273 TraceCheckUtils]: 17: Hoare triple {1080#false} assume !false; {1080#false} is VALID [2018-12-19 12:04:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-19 12:04:06,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 12:04:06,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-19 12:04:06,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:04:06,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-19 12:04:06,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:04:06,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 12:04:06,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:06,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 12:04:06,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 12:04:06,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-19 12:04:06,799 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 4 states. [2018-12-19 12:04:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:06,944 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-12-19 12:04:06,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 12:04:06,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-19 12:04:06,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:04:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:04:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-19 12:04:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:04:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-19 12:04:06,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2018-12-19 12:04:07,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:07,006 INFO L225 Difference]: With dead ends: 29 [2018-12-19 12:04:07,007 INFO L226 Difference]: Without dead ends: 21 [2018-12-19 12:04:07,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-19 12:04:07,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-19 12:04:07,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-19 12:04:07,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:04:07,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-12-19 12:04:07,079 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-12-19 12:04:07,080 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-12-19 12:04:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:07,081 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-12-19 12:04:07,081 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-19 12:04:07,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:07,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:07,082 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-12-19 12:04:07,082 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-12-19 12:04:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:07,084 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-12-19 12:04:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-19 12:04:07,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:07,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:07,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:04:07,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:04:07,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-19 12:04:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-19 12:04:07,086 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2018-12-19 12:04:07,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:04:07,086 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-19 12:04:07,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 12:04:07,087 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-19 12:04:07,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-19 12:04:07,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:04:07,088 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2018-12-19 12:04:07,088 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:04:07,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:04:07,088 INFO L82 PathProgramCache]: Analyzing trace with hash 406829563, now seen corresponding path program 7 times [2018-12-19 12:04:07,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:04:07,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:07,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-19 12:04:07,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:07,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:04:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:07,217 INFO L273 TraceCheckUtils]: 0: Hoare triple {1225#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1225#true} is VALID [2018-12-19 12:04:07,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {1225#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1225#true} is VALID [2018-12-19 12:04:07,218 INFO L273 TraceCheckUtils]: 2: Hoare triple {1225#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1225#true} is VALID [2018-12-19 12:04:07,218 INFO L273 TraceCheckUtils]: 3: Hoare triple {1225#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1225#true} is VALID [2018-12-19 12:04:07,219 INFO L273 TraceCheckUtils]: 4: Hoare triple {1225#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1225#true} is VALID [2018-12-19 12:04:07,219 INFO L273 TraceCheckUtils]: 5: Hoare triple {1225#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1225#true} is VALID [2018-12-19 12:04:07,220 INFO L273 TraceCheckUtils]: 6: Hoare triple {1225#true} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1225#true} is VALID [2018-12-19 12:04:07,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {1225#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1227#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2018-12-19 12:04:07,238 INFO L273 TraceCheckUtils]: 8: Hoare triple {1227#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1228#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 2))} is VALID [2018-12-19 12:04:07,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {1228#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 2))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1229#(<= ~n (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2018-12-19 12:04:07,240 INFO L273 TraceCheckUtils]: 10: Hoare triple {1229#(<= ~n (+ ULTIMATE.start_SelectionSort_~lh~4 1))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1230#(<= ~n ULTIMATE.start_SelectionSort_~i~4)} is VALID [2018-12-19 12:04:07,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {1230#(<= ~n ULTIMATE.start_SelectionSort_~i~4)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1226#false} is VALID [2018-12-19 12:04:07,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-19 12:04:07,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-19 12:04:07,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1226#false} is VALID [2018-12-19 12:04:07,241 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-19 12:04:07,241 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-19 12:04:07,242 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-19 12:04:07,242 INFO L273 TraceCheckUtils]: 18: Hoare triple {1226#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1226#false} is VALID [2018-12-19 12:04:07,242 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2018-12-19 12:04:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-19 12:04:07,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:04:07,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:04:07,244 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-19 12:04:07,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-19 12:04:07,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:04:07,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-12-19 12:04:07,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:04:07,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:04:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:07,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:04:07,433 INFO L273 TraceCheckUtils]: 0: Hoare triple {1225#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1234#(<= 5 ~n)} is VALID [2018-12-19 12:04:07,441 INFO L273 TraceCheckUtils]: 1: Hoare triple {1234#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1234#(<= 5 ~n)} is VALID [2018-12-19 12:04:07,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {1234#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1234#(<= 5 ~n)} is VALID [2018-12-19 12:04:07,442 INFO L273 TraceCheckUtils]: 3: Hoare triple {1234#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1234#(<= 5 ~n)} is VALID [2018-12-19 12:04:07,442 INFO L273 TraceCheckUtils]: 4: Hoare triple {1234#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1234#(<= 5 ~n)} is VALID [2018-12-19 12:04:07,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {1234#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1234#(<= 5 ~n)} is VALID [2018-12-19 12:04:07,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {1234#(<= 5 ~n)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1253#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2018-12-19 12:04:07,445 INFO L273 TraceCheckUtils]: 7: Hoare triple {1253#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1257#(and (<= ULTIMATE.start_SelectionSort_~i~4 1) (<= 5 ~n))} is VALID [2018-12-19 12:04:07,446 INFO L273 TraceCheckUtils]: 8: Hoare triple {1257#(and (<= ULTIMATE.start_SelectionSort_~i~4 1) (<= 5 ~n))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1261#(and (<= ULTIMATE.start_SelectionSort_~i~4 2) (<= 5 ~n))} is VALID [2018-12-19 12:04:07,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {1261#(and (<= ULTIMATE.start_SelectionSort_~i~4 2) (<= 5 ~n))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-19 12:04:07,448 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-19 12:04:07,448 INFO L273 TraceCheckUtils]: 11: Hoare triple {1226#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1226#false} is VALID [2018-12-19 12:04:07,449 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-19 12:04:07,449 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-19 12:04:07,449 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1226#false} is VALID [2018-12-19 12:04:07,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-19 12:04:07,450 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-19 12:04:07,451 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-19 12:04:07,451 INFO L273 TraceCheckUtils]: 18: Hoare triple {1226#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1226#false} is VALID [2018-12-19 12:04:07,451 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2018-12-19 12:04:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-19 12:04:07,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:04:07,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2018-12-19 12:04:07,547 INFO L273 TraceCheckUtils]: 18: Hoare triple {1226#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1226#false} is VALID [2018-12-19 12:04:07,547 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-19 12:04:07,548 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-19 12:04:07,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-19 12:04:07,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1226#false} is VALID [2018-12-19 12:04:07,548 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-19 12:04:07,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-19 12:04:07,549 INFO L273 TraceCheckUtils]: 11: Hoare triple {1226#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1226#false} is VALID [2018-12-19 12:04:07,549 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-19 12:04:07,550 INFO L273 TraceCheckUtils]: 9: Hoare triple {1325#(< ULTIMATE.start_SelectionSort_~i~4 ~n)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-19 12:04:07,551 INFO L273 TraceCheckUtils]: 8: Hoare triple {1329#(< (+ ULTIMATE.start_SelectionSort_~i~4 1) ~n)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1325#(< ULTIMATE.start_SelectionSort_~i~4 ~n)} is VALID [2018-12-19 12:04:07,552 INFO L273 TraceCheckUtils]: 7: Hoare triple {1333#(< (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1329#(< (+ ULTIMATE.start_SelectionSort_~i~4 1) ~n)} is VALID [2018-12-19 12:04:07,552 INFO L273 TraceCheckUtils]: 6: Hoare triple {1337#(< 2 ~n)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1333#(< (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2018-12-19 12:04:07,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {1337#(< 2 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1337#(< 2 ~n)} is VALID [2018-12-19 12:04:07,554 INFO L273 TraceCheckUtils]: 4: Hoare triple {1337#(< 2 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1337#(< 2 ~n)} is VALID [2018-12-19 12:04:07,554 INFO L273 TraceCheckUtils]: 3: Hoare triple {1337#(< 2 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1337#(< 2 ~n)} is VALID [2018-12-19 12:04:07,555 INFO L273 TraceCheckUtils]: 2: Hoare triple {1337#(< 2 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1337#(< 2 ~n)} is VALID [2018-12-19 12:04:07,556 INFO L273 TraceCheckUtils]: 1: Hoare triple {1337#(< 2 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1337#(< 2 ~n)} is VALID [2018-12-19 12:04:07,557 INFO L273 TraceCheckUtils]: 0: Hoare triple {1225#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1337#(< 2 ~n)} is VALID [2018-12-19 12:04:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-19 12:04:07,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:04:07,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2018-12-19 12:04:07,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:04:07,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-12-19 12:04:07,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:04:07,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-12-19 12:04:07,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:07,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-19 12:04:07,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-19 12:04:07,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-19 12:04:07,639 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2018-12-19 12:04:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:08,235 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2018-12-19 12:04:08,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-19 12:04:08,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-12-19 12:04:08,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:04:08,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-19 12:04:08,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2018-12-19 12:04:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-19 12:04:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2018-12-19 12:04:08,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 26 transitions. [2018-12-19 12:04:08,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:08,338 INFO L225 Difference]: With dead ends: 39 [2018-12-19 12:04:08,338 INFO L226 Difference]: Without dead ends: 26 [2018-12-19 12:04:08,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-12-19 12:04:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-19 12:04:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-19 12:04:08,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:04:08,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-12-19 12:04:08,425 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-12-19 12:04:08,425 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-12-19 12:04:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:08,426 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-12-19 12:04:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-12-19 12:04:08,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:08,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:08,427 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-12-19 12:04:08,427 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-12-19 12:04:08,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:08,428 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-12-19 12:04:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-12-19 12:04:08,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:08,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:08,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:04:08,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:04:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-19 12:04:08,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-12-19 12:04:08,430 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 20 [2018-12-19 12:04:08,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:04:08,430 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-12-19 12:04:08,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-19 12:04:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-12-19 12:04:08,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-19 12:04:08,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:04:08,431 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-12-19 12:04:08,432 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:04:08,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:04:08,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1640374485, now seen corresponding path program 8 times [2018-12-19 12:04:08,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:04:08,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:08,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:04:08,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:04:08,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:04:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:08,844 INFO L273 TraceCheckUtils]: 0: Hoare triple {1544#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1544#true} is VALID [2018-12-19 12:04:08,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-19 12:04:08,845 INFO L273 TraceCheckUtils]: 2: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-19 12:04:08,845 INFO L273 TraceCheckUtils]: 3: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-19 12:04:08,845 INFO L273 TraceCheckUtils]: 4: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-19 12:04:08,845 INFO L273 TraceCheckUtils]: 5: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-19 12:04:08,845 INFO L273 TraceCheckUtils]: 6: Hoare triple {1544#true} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1544#true} is VALID [2018-12-19 12:04:08,846 INFO L273 TraceCheckUtils]: 7: Hoare triple {1544#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1546#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2018-12-19 12:04:08,848 INFO L273 TraceCheckUtils]: 8: Hoare triple {1546#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1547#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 2))} is VALID [2018-12-19 12:04:08,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {1547#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 2))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1548#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 3))} is VALID [2018-12-19 12:04:08,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {1548#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 3))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1549#(<= ~n (+ ULTIMATE.start_SelectionSort_~lh~4 2))} is VALID [2018-12-19 12:04:08,865 INFO L273 TraceCheckUtils]: 11: Hoare triple {1549#(<= ~n (+ ULTIMATE.start_SelectionSort_~lh~4 2))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1550#(<= ~n (+ ULTIMATE.start_SelectionSort_~i~4 1))} is VALID [2018-12-19 12:04:08,866 INFO L273 TraceCheckUtils]: 12: Hoare triple {1550#(<= ~n (+ ULTIMATE.start_SelectionSort_~i~4 1))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1551#(<= ~n ULTIMATE.start_SelectionSort_~i~4)} is VALID [2018-12-19 12:04:08,868 INFO L273 TraceCheckUtils]: 13: Hoare triple {1551#(<= ~n ULTIMATE.start_SelectionSort_~i~4)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1545#false} is VALID [2018-12-19 12:04:08,868 INFO L273 TraceCheckUtils]: 14: Hoare triple {1545#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1545#false} is VALID [2018-12-19 12:04:08,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {1545#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1545#false} is VALID [2018-12-19 12:04:08,868 INFO L273 TraceCheckUtils]: 16: Hoare triple {1545#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1545#false} is VALID [2018-12-19 12:04:08,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {1545#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1545#false} is VALID [2018-12-19 12:04:08,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {1545#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1545#false} is VALID [2018-12-19 12:04:08,869 INFO L273 TraceCheckUtils]: 19: Hoare triple {1545#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1545#false} is VALID [2018-12-19 12:04:08,869 INFO L273 TraceCheckUtils]: 20: Hoare triple {1545#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1545#false} is VALID [2018-12-19 12:04:08,869 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#false} assume !false; {1545#false} is VALID [2018-12-19 12:04:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-19 12:04:08,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:04:08,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:04:08,870 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-19 12:04:08,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-19 12:04:08,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:04:08,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-12-19 12:04:08,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-19 12:04:08,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-19 12:04:08,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-19 12:04:08,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-19 12:04:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:04:08,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:04:08,971 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 6 treesize of output 5 [2018-12-19 12:04:08,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:04:08,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-19 12:04:08,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-19 12:04:08,997 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:04:08,998 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~array~7_26, v_ULTIMATE.start_main_~i~7_44]. (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (store v_ULTIMATE.start_main_~array~7_26 v_ULTIMATE.start_main_~i~7_44 v_ULTIMATE.start_main_~i~7_44) ULTIMATE.start_main_~array~7) (<= 0 v_ULTIMATE.start_main_~i~7_44)) [2018-12-19 12:04:08,998 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_ULTIMATE.start_main_~i~7_44]. (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)) [2018-12-19 12:04:09,543 INFO L273 TraceCheckUtils]: 0: Hoare triple {1544#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1544#true} is VALID [2018-12-19 12:04:09,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-19 12:04:09,544 INFO L273 TraceCheckUtils]: 2: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-19 12:04:09,545 INFO L273 TraceCheckUtils]: 3: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-19 12:04:09,545 INFO L273 TraceCheckUtils]: 4: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-19 12:04:09,546 INFO L273 TraceCheckUtils]: 5: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1570#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-19 12:04:09,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {1570#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-19 12:04:09,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-19 12:04:09,548 INFO L273 TraceCheckUtils]: 8: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-19 12:04:09,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-19 12:04:09,549 INFO L273 TraceCheckUtils]: 10: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-19 12:04:09,550 INFO L273 TraceCheckUtils]: 11: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-19 12:04:09,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-19 12:04:09,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-19 12:04:09,554 INFO L273 TraceCheckUtils]: 14: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-19 12:04:09,562 INFO L273 TraceCheckUtils]: 15: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-19 12:04:09,563 INFO L273 TraceCheckUtils]: 16: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-19 12:04:09,563 INFO L273 TraceCheckUtils]: 17: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-19 12:04:09,581 INFO L273 TraceCheckUtils]: 18: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-19 12:04:09,590 INFO L273 TraceCheckUtils]: 19: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-19 12:04:09,604 INFO L273 TraceCheckUtils]: 20: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1545#false} is VALID [2018-12-19 12:04:09,604 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#false} assume !false; {1545#false} is VALID [2018-12-19 12:04:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-19 12:04:09,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:04:09,678 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#false} assume !false; {1545#false} is VALID [2018-12-19 12:04:09,679 INFO L273 TraceCheckUtils]: 20: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1545#false} is VALID [2018-12-19 12:04:09,679 INFO L273 TraceCheckUtils]: 19: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-19 12:04:09,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-19 12:04:09,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-19 12:04:09,681 INFO L273 TraceCheckUtils]: 16: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-19 12:04:09,682 INFO L273 TraceCheckUtils]: 15: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-19 12:04:09,682 INFO L273 TraceCheckUtils]: 14: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-19 12:04:09,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-19 12:04:09,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-19 12:04:09,684 INFO L273 TraceCheckUtils]: 11: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-19 12:04:09,684 INFO L273 TraceCheckUtils]: 10: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-19 12:04:09,685 INFO L273 TraceCheckUtils]: 9: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-19 12:04:09,686 INFO L273 TraceCheckUtils]: 8: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-19 12:04:09,686 INFO L273 TraceCheckUtils]: 7: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-19 12:04:09,687 INFO L273 TraceCheckUtils]: 6: Hoare triple {1666#(or (<= 0 ULTIMATE.start_main_~i~7) (= (select ULTIMATE.start_main_~array~7 0) 0))} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-19 12:04:09,688 INFO L273 TraceCheckUtils]: 5: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1666#(or (<= 0 ULTIMATE.start_main_~i~7) (= (select ULTIMATE.start_main_~array~7 0) 0))} is VALID [2018-12-19 12:04:09,688 INFO L273 TraceCheckUtils]: 4: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-19 12:04:09,689 INFO L273 TraceCheckUtils]: 3: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-19 12:04:09,689 INFO L273 TraceCheckUtils]: 2: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-19 12:04:09,689 INFO L273 TraceCheckUtils]: 1: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-19 12:04:09,689 INFO L273 TraceCheckUtils]: 0: Hoare triple {1544#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1544#true} is VALID [2018-12-19 12:04:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-19 12:04:09,717 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-19 12:04:09,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2018-12-19 12:04:09,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:04:09,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-19 12:04:09,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:04:09,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-19 12:04:09,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:09,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-19 12:04:09,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-19 12:04:09,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-19 12:04:09,733 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2018-12-19 12:04:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:10,110 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-12-19 12:04:10,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 12:04:10,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-19 12:04:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:04:10,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:04:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-19 12:04:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-19 12:04:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-19 12:04:10,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 9 transitions. [2018-12-19 12:04:10,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:04:10,126 INFO L225 Difference]: With dead ends: 26 [2018-12-19 12:04:10,127 INFO L226 Difference]: Without dead ends: 0 [2018-12-19 12:04:10,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-12-19 12:04:10,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-19 12:04:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-19 12:04:10,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:04:10,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-12-19 12:04:10,128 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 12:04:10,129 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 12:04:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:10,129 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 12:04:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:04:10,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:10,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:10,130 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 12:04:10,130 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 12:04:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:04:10,130 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 12:04:10,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:04:10,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:10,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:04:10,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:04:10,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:04:10,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-19 12:04:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-19 12:04:10,132 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-12-19 12:04:10,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:04:10,132 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-19 12:04:10,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-19 12:04:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:04:10,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:04:10,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-19 12:04:10,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-19 12:04:10,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-19 12:04:10,380 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2018-12-19 12:04:10,544 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-12-19 12:04:10,554 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2018-12-19 12:04:10,555 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2018-12-19 12:04:10,555 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2018-12-19 12:04:10,555 INFO L444 ceAbstractionStarter]: At program point L98(lines 74 98) the Hoare annotation is: (let ((.cse4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))) (let ((.cse0 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse1 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse2 (<= .cse4 ULTIMATE.start_SelectionSort_~i~4)) (.cse3 (= ~n 5))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_SelectionSort_~i~4 .cse4) (<= .cse4 ~n)) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n))))) [2018-12-19 12:04:10,555 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2018-12-19 12:04:10,556 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 5 99) no Hoare annotation was computed. [2018-12-19 12:04:10,556 INFO L444 ceAbstractionStarter]: At program point L90(lines 46 90) the Hoare annotation is: (let ((.cse0 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse1 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse2 (= ~n 5)) (.cse3 (+ ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse4 (<= ~n ULTIMATE.start_SelectionSort_~i~4))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_SelectionSort_~lh~4 0)) (and .cse0 .cse1 .cse2 (<= .cse3 ~n) .cse4) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_SelectionSort_~i~4 .cse3) .cse4))) [2018-12-19 12:04:10,556 INFO L444 ceAbstractionStarter]: At program point L53(lines 32 53) the Hoare annotation is: (let ((.cse0 (= ~n 5))) (or (and (<= 4 ULTIMATE.start_main_~i~7) .cse0) (and (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44))) .cse0))) [2018-12-19 12:04:10,558 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-19 12:04:10,565 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2018-12-19 12:04:10,568 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-19 12:04:10,580 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:04:10 BoogieIcfgContainer [2018-12-19 12:04:10,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-19 12:04:10,582 INFO L168 Benchmark]: Toolchain (without parser) took 17200.43 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 810.0 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -623.7 MB). Peak memory consumption was 186.3 MB. Max. memory is 7.1 GB. [2018-12-19 12:04:10,583 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-12-19 12:04:10,584 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.64 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-12-19 12:04:10,584 INFO L168 Benchmark]: Boogie Preprocessor took 24.35 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-12-19 12:04:10,585 INFO L168 Benchmark]: RCFGBuilder took 575.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-19 12:04:10,585 INFO L168 Benchmark]: TraceAbstraction took 16553.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 810.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -644.9 MB). Peak memory consumption was 165.2 MB. Max. memory is 7.1 GB. [2018-12-19 12:04:10,589 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: * Boogie PL CUP Parser took 0.22 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. * Boogie Procedure Inliner took 41.64 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. * Boogie Preprocessor took 24.35 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. * RCFGBuilder took 575.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16553.18 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 810.0 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -644.9 MB). Peak memory consumption was 165.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 76]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && ~n == 5) && SelectionSort_~lh~4 == 0) || (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && ~n == 5) && SelectionSort_~lh~4 + 1 <= ~n) && ~n <= SelectionSort_~i~4)) || (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && ~n == 5) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && ~n <= SelectionSort_~i~4) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (4 <= main_~i~7 && ~n == 5) || ((exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44) && ~n == 5) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && ~n == 5) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && SelectionSort_~lh~4 + 1 <= ~n) || (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && ~n == 5) && SelectionSort_~lh~4 + 2 <= ~n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 16.4s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 9.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 51 SDslu, 87 SDs, 0 SdLazy, 143 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 158 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, -0.7066666666666667 AbsIntWeakeningRatio, 2.4 AbsIntAvgWeakeningVarsNumRemoved, 0.4 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 30 NumberOfFragments, 234 HoareAnnotationTreeSize, 4 FomulaSimplifications, 859 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 312 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 218 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 285 ConstructedInterpolants, 15 QuantifiedInterpolants, 12611 SizeOfPredicates, 15 NumberOfNonLiveVariables, 369 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 415/494 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...