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-1377b90 [2019-01-07 14:11:57,658 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 14:11:57,660 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 14:11:57,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 14:11:57,673 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 14:11:57,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 14:11:57,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 14:11:57,679 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 14:11:57,681 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 14:11:57,682 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 14:11:57,683 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 14:11:57,683 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 14:11:57,684 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 14:11:57,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 14:11:57,686 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 14:11:57,687 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 14:11:57,688 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 14:11:57,690 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 14:11:57,695 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 14:11:57,699 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 14:11:57,701 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 14:11:57,704 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 14:11:57,708 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 14:11:57,708 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 14:11:57,709 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 14:11:57,712 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 14:11:57,714 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 14:11:57,716 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 14:11:57,716 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 14:11:57,718 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 14:11:57,719 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 14:11:57,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 14:11:57,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 14:11:57,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 14:11:57,722 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 14:11:57,722 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 14:11:57,723 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 [2019-01-07 14:11:57,746 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 14:11:57,746 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 14:11:57,747 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 14:11:57,747 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 14:11:57,747 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 14:11:57,748 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 14:11:57,748 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 14:11:57,748 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 14:11:57,748 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 14:11:57,749 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 14:11:57,749 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 14:11:57,749 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 14:11:57,749 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 14:11:57,750 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 14:11:57,750 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 14:11:57,752 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 14:11:57,752 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 14:11:57,752 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 14:11:57,753 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 14:11:57,753 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 14:11:57,753 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 14:11:57,753 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 14:11:57,753 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 14:11:57,753 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 14:11:57,755 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 14:11:57,755 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 14:11:57,755 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 14:11:57,755 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 14:11:57,756 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 14:11:57,756 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 14:11:57,756 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 14:11:57,756 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:11:57,756 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 14:11:57,757 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 14:11:57,758 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 14:11:57,758 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 14:11:57,758 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 14:11:57,758 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 14:11:57,758 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 14:11:57,759 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 14:11:57,792 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 14:11:57,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 14:11:57,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 14:11:57,812 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 14:11:57,812 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 14:11:57,813 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 [2019-01-07 14:11:57,813 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2019-01-07 14:11:57,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 14:11:57,869 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 14:11:57,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 14:11:57,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 14:11:57,870 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 14:11:57,889 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 07.01 02:11:57" (1/1) ... [2019-01-07 14:11:57,902 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 07.01 02:11:57" (1/1) ... [2019-01-07 14:11:57,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 14:11:57,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 14:11:57,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 14:11:57,913 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 14:11:57,926 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 07.01 02:11:57" (1/1) ... [2019-01-07 14:11:57,927 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 07.01 02:11:57" (1/1) ... [2019-01-07 14:11:57,929 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 07.01 02:11:57" (1/1) ... [2019-01-07 14:11:57,929 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 07.01 02:11:57" (1/1) ... [2019-01-07 14:11:57,937 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 07.01 02:11:57" (1/1) ... [2019-01-07 14:11:57,940 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 07.01 02:11:57" (1/1) ... [2019-01-07 14:11:57,941 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 07.01 02:11:57" (1/1) ... [2019-01-07 14:11:57,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 14:11:57,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 14:11:57,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 14:11:57,944 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 14:11:57,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:11:57" (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 [2019-01-07 14:11:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 14:11:58,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 14:11:58,622 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-01-07 14:11:58,624 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 14:11:58,624 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-07 14:11:58,626 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:11:58 BoogieIcfgContainer [2019-01-07 14:11:58,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 14:11:58,627 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 14:11:58,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 14:11:58,630 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 14:11:58,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:11:57" (1/2) ... [2019-01-07 14:11:58,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491177ca and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:11:58, skipping insertion in model container [2019-01-07 14:11:58,632 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 07.01 02:11:58" (2/2) ... [2019-01-07 14:11:58,634 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2019-01-07 14:11:58,645 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 14:11:58,654 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 14:11:58,674 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 14:11:58,709 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 14:11:58,710 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 14:11:58,710 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 14:11:58,710 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 14:11:58,710 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 14:11:58,710 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 14:11:58,710 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 14:11:58,711 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 14:11:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-07 14:11:58,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 14:11:58,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:11:58,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 14:11:58,737 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:11:58,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:11:58,744 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-07 14:11:58,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:11:58,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:11:58,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:11:58,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:11:58,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:11:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:11:58,954 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 [2019-01-07 14:11:58,957 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 [2019-01-07 14:11:58,958 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 [2019-01-07 14:11:58,959 INFO L273 TraceCheckUtils]: 3: Hoare triple {10#false} assume !false; {10#false} is VALID [2019-01-07 14:11:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:11:58,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:11:58,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 14:11:58,964 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:11:58,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-07 14:11:58,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:11:58,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 14:11:59,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:11:59,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 14:11:59,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 14:11:59,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:11:59,017 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-07 14:11:59,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:11:59,130 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-01-07 14:11:59,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 14:11:59,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-07 14:11:59,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:11:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:11:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-07 14:11:59,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:11:59,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-07 14:11:59,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2019-01-07 14:11:59,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:11:59,254 INFO L225 Difference]: With dead ends: 11 [2019-01-07 14:11:59,254 INFO L226 Difference]: Without dead ends: 7 [2019-01-07 14:11:59,258 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 [2019-01-07 14:11:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-07 14:11:59,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-07 14:11:59,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:11:59,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-01-07 14:11:59,354 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-07 14:11:59,355 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-07 14:11:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:11:59,357 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-01-07 14:11:59,357 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-01-07 14:11:59,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:11:59,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:11:59,358 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-07 14:11:59,359 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-07 14:11:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:11:59,361 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-01-07 14:11:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-01-07 14:11:59,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:11:59,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:11:59,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:11:59,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:11:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 14:11:59,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-07 14:11:59,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2019-01-07 14:11:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:11:59,366 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-07 14:11:59,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 14:11:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-01-07 14:11:59,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 14:11:59,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:11:59,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 14:11:59,368 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:11:59,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:11:59,368 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2019-01-07 14:11:59,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:11:59,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:11:59,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:11:59,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:11:59,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:11:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:11:59,624 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 [2019-01-07 14:11:59,630 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 [2019-01-07 14:11:59,632 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 [2019-01-07 14:11:59,632 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 [2019-01-07 14:11:59,633 INFO L273 TraceCheckUtils]: 4: Hoare triple {60#false} assume !false; {60#false} is VALID [2019-01-07 14:11:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:11:59,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:11:59,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:11:59,635 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-07 14:11:59,636 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2019-01-07 14:11:59,673 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 14:11:59,674 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:11:59,958 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-07 14:11:59,960 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. [2019-01-07 14:11:59,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:11:59,966 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-07 14:12:00,161 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 33.33% of their original sizes. [2019-01-07 14:12:00,192 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-07 14:12:00,326 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-07 14:12:00,381 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-07 14:12:00,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-07 14:12:00,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-01-07 14:12:00,383 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:12:00,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-07 14:12:00,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:00,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 14:12:00,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:00,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 14:12:00,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 14:12:00,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-07 14:12:00,423 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2019-01-07 14:12:01,062 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:01,063 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:01,064 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:01,065 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:01,065 WARN L224 ngHoareTripleChecker]: Pre: {103#true} [2019-01-07 14:12:01,065 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; [2019-01-07 14:12:01,066 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)) [2019-01-07 14:12:01,066 WARN L230 ngHoareTripleChecker]: Post: {104#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:01,066 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:01,069 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:01,069 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:01,071 WARN L270 ngHoareTripleChecker]: Pre: {103#true} [2019-01-07 14:12:01,072 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; [2019-01-07 14:12:01,073 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)) [2019-01-07 14:12:01,090 WARN L276 ngHoareTripleChecker]: Post: {104#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:01,091 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:01,091 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:01,092 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 , }} [2019-01-07 14:12:01,092 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;) [2019-01-07 14:12:01,093 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-01-07 14:12:01,093 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:01,123 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:01,123 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:01,123 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:01,124 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:01,124 WARN L224 ngHoareTripleChecker]: Pre: {113#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:01,124 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-07 14:12:01,125 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))) [2019-01-07 14:12:01,125 WARN L230 ngHoareTripleChecker]: Post: {114#false} [2019-01-07 14:12:01,126 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:01,127 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:01,127 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:01,220 WARN L270 ngHoareTripleChecker]: Pre: {113#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:01,220 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-07 14:12:01,220 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))) [2019-01-07 14:12:01,259 WARN L276 ngHoareTripleChecker]: Post: {114#false} [2019-01-07 14:12:01,259 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:01,259 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:01,260 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 , }} [2019-01-07 14:12:01,260 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;) [2019-01-07 14:12:01,261 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-07 14:12:01,261 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:01,324 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:01,324 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:01,324 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:01,325 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:01,325 WARN L224 ngHoareTripleChecker]: Pre: {118#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:01,325 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; [2019-01-07 14:12:01,326 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)) [2019-01-07 14:12:01,326 WARN L230 ngHoareTripleChecker]: Post: {119#false} [2019-01-07 14:12:01,326 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:01,330 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:01,330 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:01,413 WARN L270 ngHoareTripleChecker]: Pre: {118#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:01,413 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; [2019-01-07 14:12:01,414 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)) [2019-01-07 14:12:01,448 WARN L276 ngHoareTripleChecker]: Post: {119#false} [2019-01-07 14:12:01,448 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:01,448 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:01,449 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 , }} [2019-01-07 14:12:01,449 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;) [2019-01-07 14:12:01,449 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-07 14:12:01,450 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:01,504 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:01,504 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:01,504 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:01,505 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:01,505 WARN L224 ngHoareTripleChecker]: Pre: {126#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:01,505 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; [2019-01-07 14:12:01,505 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))) [2019-01-07 14:12:01,505 WARN L230 ngHoareTripleChecker]: Post: {127#false} [2019-01-07 14:12:01,506 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:01,506 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:01,506 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:01,518 WARN L270 ngHoareTripleChecker]: Pre: {126#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:01,518 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; [2019-01-07 14:12:01,518 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))) [2019-01-07 14:12:01,522 WARN L276 ngHoareTripleChecker]: Post: {127#false} [2019-01-07 14:12:01,522 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:01,522 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:01,523 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 , }} [2019-01-07 14:12:01,523 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;) [2019-01-07 14:12:01,523 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-07 14:12:01,524 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:01,552 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:01,552 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:01,553 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:01,553 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:01,553 WARN L224 ngHoareTripleChecker]: Pre: {128#(= c_~n 5)} [2019-01-07 14:12:01,553 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; [2019-01-07 14:12:01,553 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)) [2019-01-07 14:12:01,554 WARN L230 ngHoareTripleChecker]: Post: {129#false} [2019-01-07 14:12:01,554 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:01,554 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:01,554 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:01,573 WARN L270 ngHoareTripleChecker]: Pre: {128#(= ~n 5)} [2019-01-07 14:12:01,573 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; [2019-01-07 14:12:01,574 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)) [2019-01-07 14:12:01,576 WARN L276 ngHoareTripleChecker]: Post: {129#false} [2019-01-07 14:12:01,577 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:01,577 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:01,577 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 , }} [2019-01-07 14:12:01,578 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;) [2019-01-07 14:12:01,578 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-07 14:12:01,578 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:02,225 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:02,225 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:02,225 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:02,226 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:02,226 WARN L224 ngHoareTripleChecker]: Pre: {130#(= c_~n 5)} [2019-01-07 14:12:02,226 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; [2019-01-07 14:12:02,226 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)) [2019-01-07 14:12:02,227 WARN L230 ngHoareTripleChecker]: Post: {131#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:02,227 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:02,227 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:02,227 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:02,232 WARN L270 ngHoareTripleChecker]: Pre: {130#(= ~n 5)} [2019-01-07 14:12:02,232 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; [2019-01-07 14:12:02,232 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)) [2019-01-07 14:12:02,241 WARN L276 ngHoareTripleChecker]: Post: {131#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:02,241 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:02,242 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:02,242 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 , }} [2019-01-07 14:12:02,243 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;) [2019-01-07 14:12:02,243 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-01-07 14:12:02,243 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:02,924 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:02,925 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:02,925 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:02,925 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:02,925 WARN L224 ngHoareTripleChecker]: Pre: {134#(= c_~n 5)} [2019-01-07 14:12:02,926 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-07 14:12:02,926 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))) [2019-01-07 14:12:02,926 WARN L230 ngHoareTripleChecker]: Post: {135#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:02,926 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:02,927 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:02,927 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:02,932 WARN L270 ngHoareTripleChecker]: Pre: {134#(= ~n 5)} [2019-01-07 14:12:02,932 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-07 14:12:02,933 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))) [2019-01-07 14:12:02,937 WARN L276 ngHoareTripleChecker]: Post: {135#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:02,938 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:02,938 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:02,939 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 , }} [2019-01-07 14:12:02,939 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;) [2019-01-07 14:12:02,939 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-01-07 14:12:02,940 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:03,611 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:03,611 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:03,612 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:03,612 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:03,612 WARN L224 ngHoareTripleChecker]: Pre: {139#(= c_~n 5)} [2019-01-07 14:12:03,612 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; [2019-01-07 14:12:03,613 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))) [2019-01-07 14:12:03,613 WARN L230 ngHoareTripleChecker]: Post: {140#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:03,613 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:03,614 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:03,614 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:03,621 WARN L270 ngHoareTripleChecker]: Pre: {139#(= ~n 5)} [2019-01-07 14:12:03,621 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; [2019-01-07 14:12:03,622 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))) [2019-01-07 14:12:03,626 WARN L276 ngHoareTripleChecker]: Post: {140#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:03,627 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:03,627 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:03,627 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 , }} [2019-01-07 14:12:03,628 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;) [2019-01-07 14:12:03,628 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-01-07 14:12:03,629 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:03,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:03,637 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-01-07 14:12:03,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 14:12:03,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-07 14:12:03,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:03,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:12:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-07 14:12:03,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:12:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-07 14:12:03,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2019-01-07 14:12:03,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:03,731 INFO L225 Difference]: With dead ends: 11 [2019-01-07 14:12:03,731 INFO L226 Difference]: Without dead ends: 9 [2019-01-07 14:12:03,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-07 14:12:03,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-07 14:12:03,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-07 14:12:03,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:03,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 8 states. [2019-01-07 14:12:03,909 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 8 states. [2019-01-07 14:12:03,909 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 8 states. [2019-01-07 14:12:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:03,911 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-01-07 14:12:03,911 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-01-07 14:12:03,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:03,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:03,913 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states. [2019-01-07 14:12:03,913 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states. [2019-01-07 14:12:03,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:03,917 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-01-07 14:12:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-01-07 14:12:03,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:03,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:03,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:03,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 14:12:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-07 14:12:03,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-01-07 14:12:03,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:03,921 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-07 14:12:03,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 14:12:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-01-07 14:12:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 14:12:03,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:12:03,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-07 14:12:03,926 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:12:03,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:03,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1948270601, now seen corresponding path program 1 times [2019-01-07 14:12:03,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:12:03,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:03,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:12:03,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:03,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:12:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:04,104 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 [2019-01-07 14:12:04,118 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 [2019-01-07 14:12:04,131 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 [2019-01-07 14:12:04,132 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 [2019-01-07 14:12:04,132 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 [2019-01-07 14:12:04,132 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 [2019-01-07 14:12:04,133 INFO L273 TraceCheckUtils]: 6: Hoare triple {176#false} assume !false; {176#false} is VALID [2019-01-07 14:12:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 14:12:04,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:04,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:12:04,134 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-07 14:12:04,135 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22] [2019-01-07 14:12:04,139 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 14:12:04,139 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:12:04,333 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-07 14:12:04,333 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. [2019-01-07 14:12:04,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:04,334 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-07 14:12:04,534 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 28.89% of their original sizes. [2019-01-07 14:12:04,556 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-07 14:12:04,605 INFO L420 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2019-01-07 14:12:04,636 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-07 14:12:04,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-07 14:12:04,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2019-01-07 14:12:04,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:12:04,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-07 14:12:04,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:04,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-01-07 14:12:04,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:04,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-07 14:12:04,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-07 14:12:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-07 14:12:04,650 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-01-07 14:12:04,659 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:04,660 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:04,660 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:04,661 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:04,661 WARN L224 ngHoareTripleChecker]: Pre: {238#true} [2019-01-07 14:12:04,661 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; [2019-01-07 14:12:04,661 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)) [2019-01-07 14:12:04,661 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))} [2019-01-07 14:12:04,662 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:04,662 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:04,662 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:04,663 WARN L270 ngHoareTripleChecker]: Pre: {238#true} [2019-01-07 14:12:04,663 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; [2019-01-07 14:12:04,664 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)) [2019-01-07 14:12:04,769 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))} [2019-01-07 14:12:04,770 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:04,770 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:04,770 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 , }} [2019-01-07 14:12:04,771 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;) [2019-01-07 14:12:04,771 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; , }} [2019-01-07 14:12:04,771 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:05,426 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:05,426 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:05,427 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:05,427 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:05,427 WARN L224 ngHoareTripleChecker]: Pre: {240#true} [2019-01-07 14:12:05,427 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; [2019-01-07 14:12:05,427 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)) [2019-01-07 14:12:05,428 WARN L230 ngHoareTripleChecker]: Post: {241#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:05,428 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:05,428 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:05,428 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:05,429 WARN L270 ngHoareTripleChecker]: Pre: {240#true} [2019-01-07 14:12:05,429 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; [2019-01-07 14:12:05,429 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)) [2019-01-07 14:12:05,434 WARN L276 ngHoareTripleChecker]: Post: {241#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:05,434 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:05,434 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:05,435 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 , }} [2019-01-07 14:12:05,435 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;) [2019-01-07 14:12:05,435 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-01-07 14:12:05,436 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:05,488 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:05,488 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:05,488 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:05,489 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:05,489 WARN L224 ngHoareTripleChecker]: Pre: {246#(= c_~n 5)} [2019-01-07 14:12:05,489 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; [2019-01-07 14:12:05,489 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~lh~4_primed 0) (not (<= 0 c_ULTIMATE.start_main_~i~7))) [2019-01-07 14:12:05,490 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))} [2019-01-07 14:12:05,490 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:05,490 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:05,491 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:05,527 WARN L270 ngHoareTripleChecker]: Pre: {246#(= ~n 5)} [2019-01-07 14:12:05,527 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; [2019-01-07 14:12:05,527 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~lh~4_primed 0) (not (<= 0 c_ULTIMATE.start_main_~i~7))) [2019-01-07 14:12:05,540 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))} [2019-01-07 14:12:05,540 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:05,540 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:05,541 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 , }} [2019-01-07 14:12:05,541 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;) [2019-01-07 14:12:05,542 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; , }} [2019-01-07 14:12:05,542 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:05,561 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:05,562 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:05,562 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:05,562 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:05,563 WARN L224 ngHoareTripleChecker]: Pre: {250#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:05,563 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-07 14:12:05,563 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))) [2019-01-07 14:12:05,563 WARN L230 ngHoareTripleChecker]: Post: {251#false} [2019-01-07 14:12:05,563 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:05,564 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:05,564 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:05,571 WARN L270 ngHoareTripleChecker]: Pre: {250#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:05,572 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-07 14:12:05,572 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))) [2019-01-07 14:12:05,574 WARN L276 ngHoareTripleChecker]: Post: {251#false} [2019-01-07 14:12:05,575 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:05,575 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:05,575 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 , }} [2019-01-07 14:12:05,576 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;) [2019-01-07 14:12:05,576 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-07 14:12:05,576 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:05,594 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:05,594 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:05,594 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:05,595 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:05,595 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))} [2019-01-07 14:12:05,595 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; [2019-01-07 14:12:05,595 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))) [2019-01-07 14:12:05,595 WARN L230 ngHoareTripleChecker]: Post: {259#false} [2019-01-07 14:12:05,596 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:05,596 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:05,596 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:05,604 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))} [2019-01-07 14:12:05,605 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; [2019-01-07 14:12:05,605 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))) [2019-01-07 14:12:05,607 WARN L276 ngHoareTripleChecker]: Post: {259#false} [2019-01-07 14:12:05,607 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:05,607 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:05,607 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 , }} [2019-01-07 14:12:05,607 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;) [2019-01-07 14:12:05,608 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-07 14:12:05,608 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:05,656 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:05,656 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:05,657 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:05,657 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:05,657 WARN L224 ngHoareTripleChecker]: Pre: {272#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:05,657 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; [2019-01-07 14:12:05,657 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)) [2019-01-07 14:12:05,657 WARN L230 ngHoareTripleChecker]: Post: {273#false} [2019-01-07 14:12:05,658 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:05,658 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:05,658 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:05,665 WARN L270 ngHoareTripleChecker]: Pre: {272#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:05,666 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; [2019-01-07 14:12:05,666 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)) [2019-01-07 14:12:05,671 WARN L276 ngHoareTripleChecker]: Post: {273#false} [2019-01-07 14:12:05,671 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:05,671 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:05,671 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 , }} [2019-01-07 14:12:05,672 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;) [2019-01-07 14:12:05,672 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-07 14:12:05,672 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:05,828 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:05,828 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:05,829 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:05,829 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:05,829 WARN L224 ngHoareTripleChecker]: Pre: {283#(= c_~n 5)} [2019-01-07 14:12:05,829 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; [2019-01-07 14:12:05,830 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)) [2019-01-07 14:12:05,830 WARN L230 ngHoareTripleChecker]: Post: {284#false} [2019-01-07 14:12:05,830 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:05,831 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:05,831 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:05,837 WARN L270 ngHoareTripleChecker]: Pre: {283#(= ~n 5)} [2019-01-07 14:12:05,837 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; [2019-01-07 14:12:05,837 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)) [2019-01-07 14:12:05,838 WARN L276 ngHoareTripleChecker]: Post: {284#false} [2019-01-07 14:12:05,839 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:05,839 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:05,839 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 , }} [2019-01-07 14:12:05,839 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;) [2019-01-07 14:12:05,839 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-07 14:12:05,840 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:05,847 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:05,848 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:05,849 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:05,849 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:05,849 WARN L224 ngHoareTripleChecker]: Pre: {285#(= c_~n 5)} [2019-01-07 14:12:05,849 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; [2019-01-07 14:12:05,850 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)) [2019-01-07 14:12:05,850 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))} [2019-01-07 14:12:05,850 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:05,851 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:05,851 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:05,854 WARN L270 ngHoareTripleChecker]: Pre: {285#(= ~n 5)} [2019-01-07 14:12:05,855 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; [2019-01-07 14:12:05,855 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)) [2019-01-07 14:12:05,863 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))} [2019-01-07 14:12:05,863 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:05,864 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:05,864 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 , }} [2019-01-07 14:12:05,864 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;) [2019-01-07 14:12:05,865 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; , }} [2019-01-07 14:12:05,865 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:06,521 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:06,521 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:06,521 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:06,522 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:06,522 WARN L224 ngHoareTripleChecker]: Pre: {287#(= c_~n 5)} [2019-01-07 14:12:06,522 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; [2019-01-07 14:12:06,522 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)) [2019-01-07 14:12:06,523 WARN L230 ngHoareTripleChecker]: Post: {288#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:06,523 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:06,523 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:06,523 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:06,540 WARN L270 ngHoareTripleChecker]: Pre: {287#(= ~n 5)} [2019-01-07 14:12:06,541 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; [2019-01-07 14:12:06,541 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)) [2019-01-07 14:12:06,546 WARN L276 ngHoareTripleChecker]: Post: {288#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:06,546 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:06,546 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:06,546 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 , }} [2019-01-07 14:12:06,547 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;) [2019-01-07 14:12:06,547 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-01-07 14:12:06,548 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:06,565 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:06,565 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:06,566 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:06,566 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:06,566 WARN L224 ngHoareTripleChecker]: Pre: {291#(= c_~n 5)} [2019-01-07 14:12:06,566 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-07 14:12:06,566 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))) [2019-01-07 14:12:06,566 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))} [2019-01-07 14:12:06,567 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:06,567 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:06,567 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:06,569 WARN L270 ngHoareTripleChecker]: Pre: {291#(= ~n 5)} [2019-01-07 14:12:06,569 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-07 14:12:06,569 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))) [2019-01-07 14:12:06,581 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))} [2019-01-07 14:12:06,581 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:06,581 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:06,582 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 , }} [2019-01-07 14:12:06,582 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;) [2019-01-07 14:12:06,582 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; , }} [2019-01-07 14:12:06,582 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:07,219 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:07,220 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:07,221 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:07,221 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:07,221 WARN L224 ngHoareTripleChecker]: Pre: {293#(= c_~n 5)} [2019-01-07 14:12:07,221 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-07 14:12:07,222 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))) [2019-01-07 14:12:07,222 WARN L230 ngHoareTripleChecker]: Post: {294#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:07,222 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:07,223 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:07,223 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:07,224 WARN L270 ngHoareTripleChecker]: Pre: {293#(= ~n 5)} [2019-01-07 14:12:07,225 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-07 14:12:07,225 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))) [2019-01-07 14:12:07,230 WARN L276 ngHoareTripleChecker]: Post: {294#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:07,230 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:07,230 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:07,231 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 , }} [2019-01-07 14:12:07,231 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;) [2019-01-07 14:12:07,231 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-01-07 14:12:07,231 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:07,886 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-07 14:12:07,886 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-07 14:12:07,886 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:12:07,887 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:12:07,887 WARN L224 ngHoareTripleChecker]: Pre: {298#(= c_~n 5)} [2019-01-07 14:12:07,887 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; [2019-01-07 14:12:07,887 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))) [2019-01-07 14:12:07,887 WARN L230 ngHoareTripleChecker]: Post: {299#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:07,887 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:12:07,888 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:12:07,888 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:12:07,889 WARN L270 ngHoareTripleChecker]: Pre: {298#(= ~n 5)} [2019-01-07 14:12:07,889 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; [2019-01-07 14:12:07,890 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))) [2019-01-07 14:12:07,906 WARN L276 ngHoareTripleChecker]: Post: {299#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-07 14:12:07,906 WARN L620 ntHoareTripleChecker]: -- [2019-01-07 14:12:07,906 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-07 14:12:07,906 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 , }} [2019-01-07 14:12:07,906 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;) [2019-01-07 14:12:07,907 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2019-01-07 14:12:07,907 WARN L630 ntHoareTripleChecker]: -- [2019-01-07 14:12:07,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:07,910 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-01-07 14:12:07,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 14:12:07,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-07 14:12:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:07,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:12:07,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-01-07 14:12:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:12:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-01-07 14:12:07,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2019-01-07 14:12:07,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:07,991 INFO L225 Difference]: With dead ends: 14 [2019-01-07 14:12:07,991 INFO L226 Difference]: Without dead ends: 10 [2019-01-07 14:12:07,992 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 [2019-01-07 14:12:07,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-07 14:12:08,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-01-07 14:12:08,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:08,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 9 states. [2019-01-07 14:12:08,007 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 9 states. [2019-01-07 14:12:08,007 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 9 states. [2019-01-07 14:12:08,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:08,008 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-01-07 14:12:08,008 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-01-07 14:12:08,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:08,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:08,009 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 10 states. [2019-01-07 14:12:08,009 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 10 states. [2019-01-07 14:12:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:08,010 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-01-07 14:12:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-01-07 14:12:08,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:08,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:08,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:08,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-07 14:12:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-01-07 14:12:08,011 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2019-01-07 14:12:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:08,011 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-07 14:12:08,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-07 14:12:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-01-07 14:12:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 14:12:08,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:12:08,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 14:12:08,012 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:12:08,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:08,013 INFO L82 PathProgramCache]: Analyzing trace with hash 266915571, now seen corresponding path program 1 times [2019-01-07 14:12:08,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:12:08,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:08,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:12:08,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:08,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:12:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:08,117 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 [2019-01-07 14:12:08,118 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 [2019-01-07 14:12:08,119 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 [2019-01-07 14:12:08,120 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 [2019-01-07 14:12:08,120 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 [2019-01-07 14:12:08,121 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 [2019-01-07 14:12:08,121 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 [2019-01-07 14:12:08,121 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#false} assume !false; {339#false} is VALID [2019-01-07 14:12:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 14:12:08,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:08,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:12:08,123 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 14:12:08,124 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22], [24] [2019-01-07 14:12:08,125 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 14:12:08,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:12:08,344 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 14:12:08,344 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. [2019-01-07 14:12:08,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:08,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 14:12:08,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:08,347 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 [2019-01-07 14:12:08,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:12:08,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 14:12:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:08,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:12:08,552 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 [2019-01-07 14:12:08,553 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 [2019-01-07 14:12:08,554 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 [2019-01-07 14:12:08,554 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 [2019-01-07 14:12:08,554 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 [2019-01-07 14:12:08,554 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 [2019-01-07 14:12:08,555 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 [2019-01-07 14:12:08,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#false} assume !false; {339#false} is VALID [2019-01-07 14:12:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 14:12:08,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:12:08,618 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#false} assume !false; {339#false} is VALID [2019-01-07 14:12:08,618 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 [2019-01-07 14:12:08,618 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 [2019-01-07 14:12:08,618 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 [2019-01-07 14:12:08,619 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 [2019-01-07 14:12:08,619 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 [2019-01-07 14:12:08,620 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 [2019-01-07 14:12:08,620 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 [2019-01-07 14:12:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 14:12:08,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:12:08,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-07 14:12:08,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:12:08,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-07 14:12:08,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:08,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 14:12:08,652 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:08,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 14:12:08,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 14:12:08,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-07 14:12:08,653 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2019-01-07 14:12:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:08,766 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-01-07 14:12:08,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 14:12:08,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-07 14:12:08,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:12:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-07 14:12:08,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:12:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-07 14:12:08,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2019-01-07 14:12:08,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:08,821 INFO L225 Difference]: With dead ends: 16 [2019-01-07 14:12:08,821 INFO L226 Difference]: Without dead ends: 10 [2019-01-07 14:12:08,821 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 [2019-01-07 14:12:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-07 14:12:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-07 14:12:08,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:08,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2019-01-07 14:12:08,835 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-01-07 14:12:08,835 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-01-07 14:12:08,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:08,836 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-07 14:12:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-01-07 14:12:08,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:08,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:08,837 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-01-07 14:12:08,837 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-01-07 14:12:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:08,838 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-07 14:12:08,838 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-01-07 14:12:08,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:08,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:08,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:08,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 14:12:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-01-07 14:12:08,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2019-01-07 14:12:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:08,840 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-07 14:12:08,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 14:12:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-01-07 14:12:08,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 14:12:08,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:12:08,841 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 14:12:08,841 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:12:08,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:08,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1192626986, now seen corresponding path program 2 times [2019-01-07 14:12:08,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:12:08,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:08,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:12:08,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:08,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:12:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:08,936 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 [2019-01-07 14:12:08,938 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 [2019-01-07 14:12:08,939 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 [2019-01-07 14:12:08,940 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 [2019-01-07 14:12:08,940 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 [2019-01-07 14:12:08,940 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 [2019-01-07 14:12:08,941 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 [2019-01-07 14:12:08,941 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 [2019-01-07 14:12:08,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#false} assume !false; {456#false} is VALID [2019-01-07 14:12:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 14:12:08,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:08,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:12:08,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:12:08,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:12:08,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:08,943 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 [2019-01-07 14:12:08,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 14:12:08,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 14:12:08,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 14:12:08,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 14:12:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:08,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:12:09,103 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 [2019-01-07 14:12:09,104 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 [2019-01-07 14:12:09,105 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 [2019-01-07 14:12:09,108 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 [2019-01-07 14:12:09,109 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 [2019-01-07 14:12:09,109 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 [2019-01-07 14:12:09,109 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 [2019-01-07 14:12:09,109 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 [2019-01-07 14:12:09,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#false} assume !false; {456#false} is VALID [2019-01-07 14:12:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 14:12:09,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:12:09,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#false} assume !false; {456#false} is VALID [2019-01-07 14:12:09,171 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 [2019-01-07 14:12:09,171 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 [2019-01-07 14:12:09,172 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 [2019-01-07 14:12:09,172 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 [2019-01-07 14:12:09,174 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 [2019-01-07 14:12:09,175 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 [2019-01-07 14:12:09,175 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 [2019-01-07 14:12:09,176 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 [2019-01-07 14:12:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 14:12:09,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:12:09,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-01-07 14:12:09,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:12:09,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-07 14:12:09,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:09,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-01-07 14:12:09,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:09,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-07 14:12:09,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-07 14:12:09,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-07 14:12:09,209 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2019-01-07 14:12:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:09,312 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-07 14:12:09,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 14:12:09,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-07 14:12:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:12:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-01-07 14:12:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:12:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-01-07 14:12:09,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 17 transitions. [2019-01-07 14:12:09,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:09,378 INFO L225 Difference]: With dead ends: 17 [2019-01-07 14:12:09,378 INFO L226 Difference]: Without dead ends: 11 [2019-01-07 14:12:09,379 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 [2019-01-07 14:12:09,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-07 14:12:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-07 14:12:09,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:09,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-01-07 14:12:09,400 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-01-07 14:12:09,400 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-01-07 14:12:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:09,402 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-07 14:12:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-07 14:12:09,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:09,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:09,403 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-01-07 14:12:09,403 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-01-07 14:12:09,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:09,404 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-07 14:12:09,404 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-07 14:12:09,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:09,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:09,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:09,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 14:12:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-07 14:12:09,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2019-01-07 14:12:09,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:09,407 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-07 14:12:09,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-07 14:12:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-07 14:12:09,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 14:12:09,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:12:09,407 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 14:12:09,408 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:12:09,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:09,408 INFO L82 PathProgramCache]: Analyzing trace with hash -175090221, now seen corresponding path program 3 times [2019-01-07 14:12:09,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:12:09,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:09,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 14:12:09,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:09,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:12:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:09,520 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 [2019-01-07 14:12:09,523 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 [2019-01-07 14:12:09,525 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 [2019-01-07 14:12:09,526 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 [2019-01-07 14:12:09,526 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 [2019-01-07 14:12:09,527 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 [2019-01-07 14:12:09,527 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 [2019-01-07 14:12:09,527 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 [2019-01-07 14:12:09,527 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 [2019-01-07 14:12:09,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#false} assume !false; {586#false} is VALID [2019-01-07 14:12:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 14:12:09,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:09,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:12:09,529 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:12:09,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:12:09,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:09,529 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 [2019-01-07 14:12:09,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 14:12:09,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 14:12:09,561 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 14:12:09,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 14:12:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:09,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:12:09,644 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 [2019-01-07 14:12:09,645 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 [2019-01-07 14:12:09,646 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 [2019-01-07 14:12:09,647 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 [2019-01-07 14:12:09,648 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 [2019-01-07 14:12:09,649 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 [2019-01-07 14:12:09,649 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 [2019-01-07 14:12:09,649 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 [2019-01-07 14:12:09,650 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 [2019-01-07 14:12:09,650 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#false} assume !false; {586#false} is VALID [2019-01-07 14:12:09,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 14:12:09,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:12:09,728 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#false} assume !false; {586#false} is VALID [2019-01-07 14:12:09,728 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 [2019-01-07 14:12:09,729 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 [2019-01-07 14:12:09,729 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 [2019-01-07 14:12:09,729 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 [2019-01-07 14:12:09,730 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 [2019-01-07 14:12:09,731 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 [2019-01-07 14:12:09,731 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 [2019-01-07 14:12:09,732 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 [2019-01-07 14:12:09,732 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 [2019-01-07 14:12:09,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 14:12:09,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:12:09,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2019-01-07 14:12:09,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:12:09,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-07 14:12:09,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:09,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-07 14:12:09,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:09,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 14:12:09,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 14:12:09,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-07 14:12:09,767 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2019-01-07 14:12:09,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:09,866 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-01-07 14:12:09,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 14:12:09,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-07 14:12:09,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:09,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 14:12:09,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-01-07 14:12:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 14:12:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-01-07 14:12:09,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2019-01-07 14:12:09,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:09,931 INFO L225 Difference]: With dead ends: 18 [2019-01-07 14:12:09,931 INFO L226 Difference]: Without dead ends: 12 [2019-01-07 14:12:09,932 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 [2019-01-07 14:12:09,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-07 14:12:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-07 14:12:09,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:09,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-01-07 14:12:09,952 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-07 14:12:09,952 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-07 14:12:09,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:09,954 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-07 14:12:09,954 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-07 14:12:09,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:09,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:09,956 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-07 14:12:09,957 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-07 14:12:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:09,958 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-07 14:12:09,959 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-07 14:12:09,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:09,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:09,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:09,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 14:12:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-07 14:12:09,961 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2019-01-07 14:12:09,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:09,961 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-07 14:12:09,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 14:12:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-07 14:12:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-07 14:12:09,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:12:09,962 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 14:12:09,962 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:12:09,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:09,963 INFO L82 PathProgramCache]: Analyzing trace with hash 375349322, now seen corresponding path program 4 times [2019-01-07 14:12:09,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:12:09,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:09,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 14:12:09,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:09,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:12:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:10,109 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 [2019-01-07 14:12:10,111 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 [2019-01-07 14:12:10,114 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 [2019-01-07 14:12:10,115 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 [2019-01-07 14:12:10,124 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 [2019-01-07 14:12:10,124 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 [2019-01-07 14:12:10,125 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 [2019-01-07 14:12:10,125 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 [2019-01-07 14:12:10,125 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 [2019-01-07 14:12:10,125 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 [2019-01-07 14:12:10,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#false} assume !false; {728#false} is VALID [2019-01-07 14:12:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 14:12:10,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:10,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:12:10,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:12:10,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:12:10,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:10,127 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 [2019-01-07 14:12:10,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:12:10,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 14:12:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:10,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:12:10,291 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 [2019-01-07 14:12:10,293 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 [2019-01-07 14:12:10,294 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 [2019-01-07 14:12:10,300 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 [2019-01-07 14:12:10,303 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 [2019-01-07 14:12:10,306 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 [2019-01-07 14:12:10,306 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 [2019-01-07 14:12:10,306 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 [2019-01-07 14:12:10,306 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 [2019-01-07 14:12:10,307 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 [2019-01-07 14:12:10,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#false} assume !false; {728#false} is VALID [2019-01-07 14:12:10,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 14:12:10,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:12:10,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#false} assume !false; {728#false} is VALID [2019-01-07 14:12:10,425 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 [2019-01-07 14:12:10,425 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 [2019-01-07 14:12:10,425 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 [2019-01-07 14:12:10,425 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 [2019-01-07 14:12:10,440 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 [2019-01-07 14:12:10,441 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 [2019-01-07 14:12:10,442 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 [2019-01-07 14:12:10,443 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 [2019-01-07 14:12:10,445 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 [2019-01-07 14:12:10,446 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 [2019-01-07 14:12:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-07 14:12:10,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:12:10,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-01-07 14:12:10,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:12:10,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-07 14:12:10,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:10,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-01-07 14:12:10,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:10,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 14:12:10,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 14:12:10,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-07 14:12:10,490 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-01-07 14:12:10,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:10,689 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-01-07 14:12:10,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 14:12:10,689 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-07 14:12:10,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:10,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 14:12:10,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-01-07 14:12:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 14:12:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-01-07 14:12:10,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2019-01-07 14:12:10,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:10,728 INFO L225 Difference]: With dead ends: 19 [2019-01-07 14:12:10,728 INFO L226 Difference]: Without dead ends: 13 [2019-01-07 14:12:10,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-07 14:12:10,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-07 14:12:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-07 14:12:10,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:10,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2019-01-07 14:12:10,829 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-01-07 14:12:10,829 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-01-07 14:12:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:10,831 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-07 14:12:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-01-07 14:12:10,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:10,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:10,832 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-01-07 14:12:10,833 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-01-07 14:12:10,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:10,834 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-07 14:12:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-01-07 14:12:10,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:10,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:10,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:10,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:10,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-07 14:12:10,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-01-07 14:12:10,836 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2019-01-07 14:12:10,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:10,836 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-07 14:12:10,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 14:12:10,837 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-01-07 14:12:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-07 14:12:10,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:12:10,837 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 14:12:10,838 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:12:10,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:10,838 INFO L82 PathProgramCache]: Analyzing trace with hash 259105971, now seen corresponding path program 5 times [2019-01-07 14:12:10,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:12:10,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:10,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:12:10,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:10,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:12:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:10,949 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 [2019-01-07 14:12:10,949 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 [2019-01-07 14:12:10,949 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 [2019-01-07 14:12:10,950 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 [2019-01-07 14:12:10,950 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 [2019-01-07 14:12:10,950 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 [2019-01-07 14:12:10,951 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 [2019-01-07 14:12:10,952 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 [2019-01-07 14:12:10,952 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 [2019-01-07 14:12:10,953 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 [2019-01-07 14:12:10,954 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 [2019-01-07 14:12:10,954 INFO L273 TraceCheckUtils]: 11: Hoare triple {882#false} assume !false; {882#false} is VALID [2019-01-07 14:12:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-07 14:12:10,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:10,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:12:10,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:12:10,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:12:10,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:10,956 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 [2019-01-07 14:12:10,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 14:12:10,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 14:12:10,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 14:12:10,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 14:12:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:11,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:12:11,087 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 [2019-01-07 14:12:11,087 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 [2019-01-07 14:12:11,092 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 [2019-01-07 14:12:11,092 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 [2019-01-07 14:12:11,093 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 [2019-01-07 14:12:11,093 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 [2019-01-07 14:12:11,094 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 [2019-01-07 14:12:11,095 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 [2019-01-07 14:12:11,095 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 [2019-01-07 14:12:11,098 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 [2019-01-07 14:12:11,115 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 [2019-01-07 14:12:11,115 INFO L273 TraceCheckUtils]: 11: Hoare triple {882#false} assume !false; {882#false} is VALID [2019-01-07 14:12:11,116 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-07 14:12:11,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:12:11,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {882#false} assume !false; {882#false} is VALID [2019-01-07 14:12:11,340 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 [2019-01-07 14:12:11,341 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 [2019-01-07 14:12:11,341 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 [2019-01-07 14:12:11,342 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 [2019-01-07 14:12:11,343 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 [2019-01-07 14:12:11,344 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 [2019-01-07 14:12:11,345 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 [2019-01-07 14:12:11,346 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 [2019-01-07 14:12:11,346 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 [2019-01-07 14:12:11,347 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 [2019-01-07 14:12:11,348 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 [2019-01-07 14:12:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-07 14:12:11,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:12:11,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-01-07 14:12:11,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:12:11,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-01-07 14:12:11,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:11,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-07 14:12:11,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:11,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 14:12:11,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 14:12:11,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-07 14:12:11,409 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 8 states. [2019-01-07 14:12:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:11,721 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-01-07 14:12:11,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 14:12:11,721 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-01-07 14:12:11,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 14:12:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2019-01-07 14:12:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 14:12:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2019-01-07 14:12:11,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2019-01-07 14:12:11,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:11,759 INFO L225 Difference]: With dead ends: 21 [2019-01-07 14:12:11,759 INFO L226 Difference]: Without dead ends: 19 [2019-01-07 14:12:11,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-07 14:12:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-07 14:12:11,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-07 14:12:11,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:11,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2019-01-07 14:12:11,835 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-01-07 14:12:11,835 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-01-07 14:12:11,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:11,838 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-01-07 14:12:11,838 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-01-07 14:12:11,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:11,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:11,839 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-01-07 14:12:11,839 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-01-07 14:12:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:11,841 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-01-07 14:12:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-01-07 14:12:11,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:11,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:11,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:11,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-07 14:12:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-01-07 14:12:11,843 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2019-01-07 14:12:11,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:11,843 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-07 14:12:11,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 14:12:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-01-07 14:12:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-07 14:12:11,844 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:12:11,844 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2019-01-07 14:12:11,845 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:12:11,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:11,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1746247989, now seen corresponding path program 6 times [2019-01-07 14:12:11,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:12:11,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:11,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 14:12:11,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:11,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:12:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:11,950 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 [2019-01-07 14:12:11,950 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 [2019-01-07 14:12:11,951 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 [2019-01-07 14:12:11,951 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 [2019-01-07 14:12:11,951 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 [2019-01-07 14:12:11,951 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 [2019-01-07 14:12:11,951 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 [2019-01-07 14:12:11,952 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 [2019-01-07 14:12:11,952 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 [2019-01-07 14:12:11,952 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 [2019-01-07 14:12:11,953 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 [2019-01-07 14:12:11,954 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 [2019-01-07 14:12:11,954 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 [2019-01-07 14:12:11,954 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 [2019-01-07 14:12:11,955 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 [2019-01-07 14:12:11,955 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 [2019-01-07 14:12:11,955 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 [2019-01-07 14:12:11,956 INFO L273 TraceCheckUtils]: 17: Hoare triple {1080#false} assume !false; {1080#false} is VALID [2019-01-07 14:12:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-07 14:12:11,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:12:11,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-07 14:12:11,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:12:11,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-07 14:12:11,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:11,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 14:12:11,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:11,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 14:12:11,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 14:12:11,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 14:12:11,977 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 4 states. [2019-01-07 14:12:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:12,134 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-01-07 14:12:12,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 14:12:12,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-07 14:12:12,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:12:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-07 14:12:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:12:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-07 14:12:12,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2019-01-07 14:12:12,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:12,195 INFO L225 Difference]: With dead ends: 29 [2019-01-07 14:12:12,195 INFO L226 Difference]: Without dead ends: 21 [2019-01-07 14:12:12,196 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 [2019-01-07 14:12:12,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-07 14:12:12,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-07 14:12:12,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:12,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2019-01-07 14:12:12,271 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-01-07 14:12:12,271 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-01-07 14:12:12,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:12,273 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-01-07 14:12:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-01-07 14:12:12,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:12,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:12,274 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-01-07 14:12:12,274 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-01-07 14:12:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:12,276 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-01-07 14:12:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-01-07 14:12:12,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:12,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:12,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:12,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-07 14:12:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-01-07 14:12:12,278 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2019-01-07 14:12:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:12,278 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-01-07 14:12:12,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 14:12:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-01-07 14:12:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-07 14:12:12,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:12:12,279 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2019-01-07 14:12:12,280 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:12:12,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:12,280 INFO L82 PathProgramCache]: Analyzing trace with hash 406829563, now seen corresponding path program 7 times [2019-01-07 14:12:12,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:12:12,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:12,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 14:12:12,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:12,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:12:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:12,408 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 [2019-01-07 14:12:12,408 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 [2019-01-07 14:12:12,409 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 [2019-01-07 14:12:12,409 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 [2019-01-07 14:12:12,410 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 [2019-01-07 14:12:12,410 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 [2019-01-07 14:12:12,411 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 [2019-01-07 14:12:12,420 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 [2019-01-07 14:12:12,421 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 [2019-01-07 14:12:12,422 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 [2019-01-07 14:12:12,423 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 [2019-01-07 14:12:12,424 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 [2019-01-07 14:12:12,424 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 [2019-01-07 14:12:12,425 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 [2019-01-07 14:12:12,425 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 [2019-01-07 14:12:12,425 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 [2019-01-07 14:12:12,426 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 [2019-01-07 14:12:12,426 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 [2019-01-07 14:12:12,426 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 [2019-01-07 14:12:12,427 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2019-01-07 14:12:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-07 14:12:12,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:12,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:12:12,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:12:12,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:12:12,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:12,428 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 [2019-01-07 14:12:12,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:12:12,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 14:12:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:12,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:12:12,633 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 [2019-01-07 14:12:12,642 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 [2019-01-07 14:12:12,642 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 [2019-01-07 14:12:12,643 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 [2019-01-07 14:12:12,643 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 [2019-01-07 14:12:12,644 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 [2019-01-07 14:12:12,644 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 [2019-01-07 14:12:12,645 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 [2019-01-07 14:12:12,646 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 [2019-01-07 14:12:12,647 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 [2019-01-07 14:12:12,648 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 [2019-01-07 14:12:12,648 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 [2019-01-07 14:12:12,649 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 [2019-01-07 14:12:12,649 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 [2019-01-07 14:12:12,650 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 [2019-01-07 14:12:12,650 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 [2019-01-07 14:12:12,650 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 [2019-01-07 14:12:12,651 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 [2019-01-07 14:12:12,651 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 [2019-01-07 14:12:12,651 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2019-01-07 14:12:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-07 14:12:12,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:12:12,748 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2019-01-07 14:12:12,748 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 [2019-01-07 14:12:12,748 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 [2019-01-07 14:12:12,749 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 [2019-01-07 14:12:12,749 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 [2019-01-07 14:12:12,749 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 [2019-01-07 14:12:12,749 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 [2019-01-07 14:12:12,749 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 [2019-01-07 14:12:12,750 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 [2019-01-07 14:12:12,750 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 [2019-01-07 14:12:12,750 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 [2019-01-07 14:12:12,751 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 [2019-01-07 14:12:12,752 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 [2019-01-07 14:12:12,753 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 [2019-01-07 14:12:12,754 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 [2019-01-07 14:12:12,754 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 [2019-01-07 14:12:12,755 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 [2019-01-07 14:12:12,755 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 [2019-01-07 14:12:12,756 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 [2019-01-07 14:12:12,757 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 [2019-01-07 14:12:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-07 14:12:12,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:12:12,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2019-01-07 14:12:12,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:12:12,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-01-07 14:12:12,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:12,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-01-07 14:12:12,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:12,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 14:12:12,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 14:12:12,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-01-07 14:12:12,837 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2019-01-07 14:12:13,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:13,435 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-01-07 14:12:13,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 14:12:13,435 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-01-07 14:12:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 14:12:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2019-01-07 14:12:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 14:12:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2019-01-07 14:12:13,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 26 transitions. [2019-01-07 14:12:13,530 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:13,531 INFO L225 Difference]: With dead ends: 39 [2019-01-07 14:12:13,531 INFO L226 Difference]: Without dead ends: 26 [2019-01-07 14:12:13,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-01-07 14:12:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-07 14:12:13,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-07 14:12:13,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:13,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2019-01-07 14:12:13,711 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2019-01-07 14:12:13,711 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2019-01-07 14:12:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:13,712 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-01-07 14:12:13,712 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-01-07 14:12:13,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:13,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:13,712 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2019-01-07 14:12:13,712 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2019-01-07 14:12:13,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:13,713 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-01-07 14:12:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-01-07 14:12:13,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:13,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:13,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:13,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-07 14:12:13,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-01-07 14:12:13,715 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 20 [2019-01-07 14:12:13,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:13,716 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-01-07 14:12:13,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 14:12:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-01-07 14:12:13,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-07 14:12:13,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:12:13,717 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2019-01-07 14:12:13,717 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:12:13,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:13,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1640374485, now seen corresponding path program 8 times [2019-01-07 14:12:13,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:12:13,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:13,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:12:13,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:13,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:12:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:14,215 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 [2019-01-07 14:12:14,216 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 [2019-01-07 14:12:14,216 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 [2019-01-07 14:12:14,216 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 [2019-01-07 14:12:14,217 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 [2019-01-07 14:12:14,217 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 [2019-01-07 14:12:14,217 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 [2019-01-07 14:12:14,218 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 [2019-01-07 14:12:14,220 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 [2019-01-07 14:12:14,223 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 [2019-01-07 14:12:14,237 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 [2019-01-07 14:12:14,246 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 [2019-01-07 14:12:14,248 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 [2019-01-07 14:12:14,248 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 [2019-01-07 14:12:14,248 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 [2019-01-07 14:12:14,249 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 [2019-01-07 14:12:14,249 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 [2019-01-07 14:12:14,249 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 [2019-01-07 14:12:14,249 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 [2019-01-07 14:12:14,249 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 [2019-01-07 14:12:14,249 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 [2019-01-07 14:12:14,250 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#false} assume !false; {1545#false} is VALID [2019-01-07 14:12:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-07 14:12:14,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:14,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:12:14,251 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:12:14,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:12:14,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:14,251 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 [2019-01-07 14:12:14,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 14:12:14,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 14:12:14,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 14:12:14,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 14:12:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:14,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:12:14,379 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 [2019-01-07 14:12:14,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 14:12:14,397 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. [2019-01-07 14:12:14,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-07 14:12:14,400 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:12:14,400 WARN L385 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)) [2019-01-07 14:12:14,401 WARN L386 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)) [2019-01-07 14:12:14,719 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 [2019-01-07 14:12:14,719 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 [2019-01-07 14:12:14,719 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 [2019-01-07 14:12:14,720 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 [2019-01-07 14:12:14,720 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 [2019-01-07 14:12:14,721 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 [2019-01-07 14:12:14,722 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 [2019-01-07 14:12:14,723 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 [2019-01-07 14:12:14,723 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 [2019-01-07 14:12:14,724 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 [2019-01-07 14:12:14,724 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 [2019-01-07 14:12:14,725 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 [2019-01-07 14:12:14,727 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 [2019-01-07 14:12:14,728 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 [2019-01-07 14:12:14,728 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 [2019-01-07 14:12:14,729 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 [2019-01-07 14:12:14,748 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 [2019-01-07 14:12:14,757 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 [2019-01-07 14:12:14,770 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 [2019-01-07 14:12:14,779 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 [2019-01-07 14:12:14,794 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 [2019-01-07 14:12:14,794 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#false} assume !false; {1545#false} is VALID [2019-01-07 14:12:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-01-07 14:12:14,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:12:14,867 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#false} assume !false; {1545#false} is VALID [2019-01-07 14:12:14,868 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 [2019-01-07 14:12:14,869 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 [2019-01-07 14:12:14,870 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 [2019-01-07 14:12:14,870 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 [2019-01-07 14:12:14,871 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 [2019-01-07 14:12:14,872 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 [2019-01-07 14:12:14,872 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 [2019-01-07 14:12:14,873 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 [2019-01-07 14:12:14,873 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 [2019-01-07 14:12:14,874 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 [2019-01-07 14:12:14,874 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 [2019-01-07 14:12:14,875 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 [2019-01-07 14:12:14,876 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 [2019-01-07 14:12:14,876 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 [2019-01-07 14:12:14,877 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 [2019-01-07 14:12:14,878 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 [2019-01-07 14:12:14,878 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 [2019-01-07 14:12:14,879 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 [2019-01-07 14:12:14,879 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 [2019-01-07 14:12:14,879 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 [2019-01-07 14:12:14,879 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 [2019-01-07 14:12:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-01-07 14:12:14,908 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-01-07 14:12:14,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2019-01-07 14:12:14,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:12:14,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-01-07 14:12:14,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:14,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 14:12:14,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:14,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 14:12:14,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 14:12:14,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-01-07 14:12:14,923 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2019-01-07 14:12:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:15,334 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-01-07 14:12:15,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 14:12:15,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-01-07 14:12:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:15,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:12:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-07 14:12:15,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:12:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-07 14:12:15,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 9 transitions. [2019-01-07 14:12:15,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:15,360 INFO L225 Difference]: With dead ends: 26 [2019-01-07 14:12:15,360 INFO L226 Difference]: Without dead ends: 0 [2019-01-07 14:12:15,361 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 [2019-01-07 14:12:15,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-07 14:12:15,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-07 14:12:15,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:15,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-07 14:12:15,361 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 14:12:15,361 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 14:12:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:15,362 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 14:12:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:12:15,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:15,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:15,362 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 14:12:15,362 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 14:12:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:15,362 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 14:12:15,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:12:15,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:15,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:15,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:15,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-07 14:12:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-07 14:12:15,363 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-01-07 14:12:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:15,363 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-07 14:12:15,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 14:12:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:12:15,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:15,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-07 14:12:15,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 14:12:15,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-07 14:12:15,614 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-01-07 14:12:15,780 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-01-07 14:12:15,790 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2019-01-07 14:12:15,791 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2019-01-07 14:12:15,791 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2019-01-07 14:12:15,791 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))))) [2019-01-07 14:12:15,791 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2019-01-07 14:12:15,792 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))) [2019-01-07 14:12:15,792 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))) [2019-01-07 14:12:15,793 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-01-07 14:12:15,799 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-01-07 14:12:15,802 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. [2019-01-07 14:12:15,813 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 02:12:15 BoogieIcfgContainer [2019-01-07 14:12:15,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-07 14:12:15,815 INFO L168 Benchmark]: Toolchain (without parser) took 17947.85 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 809.0 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -614.1 MB). Peak memory consumption was 194.9 MB. Max. memory is 7.1 GB. [2019-01-07 14:12:15,816 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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. [2019-01-07 14:12:15,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.21 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. [2019-01-07 14:12:15,817 INFO L168 Benchmark]: Boogie Preprocessor took 30.80 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. [2019-01-07 14:12:15,818 INFO L168 Benchmark]: RCFGBuilder took 681.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 14:12:15,818 INFO L168 Benchmark]: TraceAbstraction took 17186.80 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 809.0 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -635.3 MB). Peak memory consumption was 173.7 MB. Max. memory is 7.1 GB. [2019-01-07 14:12:15,822 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.23 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 43.21 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 30.80 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 681.81 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17186.80 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 809.0 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -635.3 MB). Peak memory consumption was 173.7 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, 7 locations, 1 error locations. SAFE Result, 17.0s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 9.3s 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.6s 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.8s 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.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s 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...