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-fa1c628-m [2019-01-31 14:30:58,644 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:30:58,645 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:30:58,657 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:30:58,657 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:30:58,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:30:58,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:30:58,661 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:30:58,663 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:30:58,664 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:30:58,665 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:30:58,665 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:30:58,666 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:30:58,667 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:30:58,668 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:30:58,669 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:30:58,670 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:30:58,672 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:30:58,674 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:30:58,675 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:30:58,677 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:30:58,678 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:30:58,680 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:30:58,681 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:30:58,681 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:30:58,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:30:58,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:30:58,684 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:30:58,685 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:30:58,689 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:30:58,689 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:30:58,690 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:30:58,690 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:30:58,690 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:30:58,694 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:30:58,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:30:58,696 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-31 14:30:58,712 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:30:58,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:30:58,714 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:30:58,714 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:30:58,714 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:30:58,714 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:30:58,714 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:30:58,715 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:30:58,715 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:30:58,715 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:30:58,715 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:30:58,715 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:30:58,716 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:30:58,716 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:30:58,717 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:30:58,717 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:30:58,717 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:30:58,718 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:30:58,718 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:30:58,718 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:30:58,718 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:30:58,718 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:30:58,719 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:30:58,721 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:30:58,721 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:30:58,721 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:30:58,721 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:30:58,721 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:30:58,722 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:30:58,722 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:30:58,722 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:30:58,723 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:30:58,723 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:30:58,723 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:30:58,723 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:30:58,724 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:30:58,724 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:30:58,724 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:30:58,724 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:30:58,724 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:30:58,768 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:30:58,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:30:58,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:30:58,790 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:30:58,791 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:30:58,791 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-31 14:30:58,792 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2019-01-31 14:30:58,838 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:30:58,840 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:30:58,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:30:58,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:30:58,841 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:30:58,859 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,872 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:30:58,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:30:58,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:30:58,883 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:30:58,896 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,897 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,899 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,900 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,905 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,908 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,909 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 31.01 02:30:58" (1/1) ... [2019-01-31 14:30:58,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:30:58,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:30:58,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:30:58,918 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:30:58,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:30:58,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 14:30:58,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 14:30:59,551 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-01-31 14:30:59,553 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 14:30:59,553 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-31 14:30:59,555 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:30:59 BoogieIcfgContainer [2019-01-31 14:30:59,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:30:59,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:30:59,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:30:59,559 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:30:59,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:30:58" (1/2) ... [2019-01-31 14:30:59,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40096010 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:30:59, skipping insertion in model container [2019-01-31 14:30:59,561 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 31.01 02:30:59" (2/2) ... [2019-01-31 14:30:59,562 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2019-01-31 14:30:59,572 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:30:59,580 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 14:30:59,597 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 14:30:59,627 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:30:59,628 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:30:59,628 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:30:59,628 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:30:59,628 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:30:59,629 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:30:59,629 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:30:59,629 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:30:59,641 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-31 14:30:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 14:30:59,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:30:59,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 14:30:59,651 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:30:59,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:30:59,656 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-31 14:30:59,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:30:59,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:30:59,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:30:59,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:30:59,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:30:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:30:59,849 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-31 14:30:59,860 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-31 14:30:59,860 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-31 14:30:59,861 INFO L273 TraceCheckUtils]: 3: Hoare triple {10#false} assume !false; {10#false} is VALID [2019-01-31 14:30:59,863 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-31 14:30:59,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:30:59,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 14:30:59,866 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:30:59,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 14:30:59,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:30:59,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:30:59,915 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-31 14:30:59,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:30:59,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:30:59,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:30:59,928 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-31 14:31:00,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:00,066 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-01-31 14:31:00,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:31:00,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 14:31:00,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-31 14:31:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:31:00,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-01-31 14:31:00,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2019-01-31 14:31:00,191 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-31 14:31:00,201 INFO L225 Difference]: With dead ends: 11 [2019-01-31 14:31:00,202 INFO L226 Difference]: Without dead ends: 7 [2019-01-31 14:31:00,205 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-31 14:31:00,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-31 14:31:00,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-31 14:31:00,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:00,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:00,313 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:00,314 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:00,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:00,318 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-01-31 14:31:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-01-31 14:31:00,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:00,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:00,320 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:00,320 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-31 14:31:00,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:00,322 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-01-31 14:31:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-01-31 14:31:00,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:00,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:00,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:00,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-31 14:31:00,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2019-01-31 14:31:00,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:00,347 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-31 14:31:00,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:31:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-01-31 14:31:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 14:31:00,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:00,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 14:31:00,350 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:00,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:00,351 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2019-01-31 14:31:00,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:00,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:00,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:00,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:00,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:00,665 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-31 14:31:00,682 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-31 14:31:00,689 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-31 14:31:00,689 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-31 14:31:00,690 INFO L273 TraceCheckUtils]: 4: Hoare triple {60#false} assume !false; {60#false} is VALID [2019-01-31 14:31:00,690 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-31 14:31:00,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:00,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:00,692 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 14:31:00,694 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2019-01-31 14:31:00,732 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:31:00,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:31:00,908 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 14:31:00,909 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-31 14:31:00,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:00,913 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 14:31:01,001 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 33.33% of their original sizes. [2019-01-31 14:31:01,009 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 14:31:01,043 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-31 14:31:01,099 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 14:31:01,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 14:31:01,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-01-31 14:31:01,101 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:01,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 14:31:01,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:01,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:01,178 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-31 14:31:01,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:01,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:01,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:31:01,179 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2019-01-31 14:31:01,776 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:01,776 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:01,777 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:01,778 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:01,778 WARN L224 ngHoareTripleChecker]: Pre: {103#true} [2019-01-31 14:31:01,778 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-31 14:31:01,779 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-31 14:31:01,779 WARN L230 ngHoareTripleChecker]: Post: {104#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:01,780 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:01,780 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:01,781 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:01,783 WARN L270 ngHoareTripleChecker]: Pre: {103#true} [2019-01-31 14:31:01,783 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-31 14:31:01,784 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-31 14:31:01,793 WARN L276 ngHoareTripleChecker]: Post: {104#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:01,794 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:01,794 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:01,795 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-31 14:31:01,795 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-31 14:31:01,795 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-31 14:31:01,795 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:01,818 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:01,818 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:01,819 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:01,819 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:01,819 WARN L224 ngHoareTripleChecker]: Pre: {113#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:01,819 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-31 14:31:01,819 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-31 14:31:01,820 WARN L230 ngHoareTripleChecker]: Post: {114#false} [2019-01-31 14:31:01,820 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:01,820 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:01,820 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:01,866 WARN L270 ngHoareTripleChecker]: Pre: {113#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:01,867 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-31 14:31:01,867 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-31 14:31:01,870 WARN L276 ngHoareTripleChecker]: Post: {114#false} [2019-01-31 14:31:01,870 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:01,870 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:01,871 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-31 14:31:01,871 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-31 14:31:01,871 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-31 14:31:01,872 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:01,900 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:01,901 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:01,901 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:01,901 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:01,902 WARN L224 ngHoareTripleChecker]: Pre: {118#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:01,902 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-31 14:31:01,902 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-31 14:31:01,903 WARN L230 ngHoareTripleChecker]: Post: {119#false} [2019-01-31 14:31:01,903 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:01,903 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:01,904 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:01,951 WARN L270 ngHoareTripleChecker]: Pre: {118#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:01,952 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-31 14:31:01,952 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-31 14:31:01,989 WARN L276 ngHoareTripleChecker]: Post: {119#false} [2019-01-31 14:31:01,990 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:01,990 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:01,990 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-31 14:31:01,991 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-31 14:31:01,991 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-31 14:31:01,991 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:02,039 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:02,039 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:02,039 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:02,039 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:02,040 WARN L224 ngHoareTripleChecker]: Pre: {126#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:02,040 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-31 14:31:02,040 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-31 14:31:02,040 WARN L230 ngHoareTripleChecker]: Post: {127#false} [2019-01-31 14:31:02,040 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:02,041 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:02,041 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:02,053 WARN L270 ngHoareTripleChecker]: Pre: {126#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:02,053 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-31 14:31:02,053 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-31 14:31:02,054 WARN L276 ngHoareTripleChecker]: Post: {127#false} [2019-01-31 14:31:02,055 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:02,055 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:02,055 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-31 14:31:02,055 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-31 14:31:02,056 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-31 14:31:02,056 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:02,088 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:02,088 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:02,088 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:02,089 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:02,089 WARN L224 ngHoareTripleChecker]: Pre: {128#(= c_~n 5)} [2019-01-31 14:31:02,089 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-31 14:31:02,089 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-31 14:31:02,089 WARN L230 ngHoareTripleChecker]: Post: {129#false} [2019-01-31 14:31:02,089 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:02,090 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:02,090 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:02,096 WARN L270 ngHoareTripleChecker]: Pre: {128#(= ~n 5)} [2019-01-31 14:31:02,096 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-31 14:31:02,097 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-31 14:31:02,098 WARN L276 ngHoareTripleChecker]: Post: {129#false} [2019-01-31 14:31:02,098 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:02,098 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:02,099 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-31 14:31:02,099 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-31 14:31:02,099 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-31 14:31:02,099 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:02,655 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:02,656 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:02,656 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:02,656 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:02,657 WARN L224 ngHoareTripleChecker]: Pre: {130#(= c_~n 5)} [2019-01-31 14:31:02,657 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-31 14:31:02,657 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-31 14:31:02,658 WARN L230 ngHoareTripleChecker]: Post: {131#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:02,658 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:02,658 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:02,659 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:02,660 WARN L270 ngHoareTripleChecker]: Pre: {130#(= ~n 5)} [2019-01-31 14:31:02,660 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-31 14:31:02,661 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-31 14:31:02,678 WARN L276 ngHoareTripleChecker]: Post: {131#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:02,679 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:02,679 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:02,679 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-31 14:31:02,680 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-31 14:31:02,680 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-31 14:31:02,680 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:03,284 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:03,284 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:03,284 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:03,285 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:03,285 WARN L224 ngHoareTripleChecker]: Pre: {134#(= c_~n 5)} [2019-01-31 14:31:03,285 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-31 14:31:03,285 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-31 14:31:03,285 WARN L230 ngHoareTripleChecker]: Post: {135#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:03,285 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:03,286 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:03,286 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:03,291 WARN L270 ngHoareTripleChecker]: Pre: {134#(= ~n 5)} [2019-01-31 14:31:03,291 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-31 14:31:03,291 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-31 14:31:03,302 WARN L276 ngHoareTripleChecker]: Post: {135#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:03,302 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:03,303 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:03,303 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-31 14:31:03,304 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-31 14:31:03,304 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-31 14:31:03,304 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:03,891 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:03,891 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:03,892 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:03,892 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:03,892 WARN L224 ngHoareTripleChecker]: Pre: {139#(= c_~n 5)} [2019-01-31 14:31:03,892 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-31 14:31:03,892 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-31 14:31:03,893 WARN L230 ngHoareTripleChecker]: Post: {140#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:03,893 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:03,893 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:03,893 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:03,934 WARN L270 ngHoareTripleChecker]: Pre: {139#(= ~n 5)} [2019-01-31 14:31:03,934 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-31 14:31:03,934 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-31 14:31:03,938 WARN L276 ngHoareTripleChecker]: Post: {140#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:03,938 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:03,939 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:03,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-31 14:31:03,939 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-31 14:31:03,940 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-31 14:31:03,940 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:03,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:03,943 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-01-31 14:31:03,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:03,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 14:31:03,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:03,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-31 14:31:03,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:03,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-01-31 14:31:03,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2019-01-31 14:31:04,032 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-31 14:31:04,081 INFO L225 Difference]: With dead ends: 11 [2019-01-31 14:31:04,081 INFO L226 Difference]: Without dead ends: 9 [2019-01-31 14:31:04,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:31:04,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-31 14:31:04,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-31 14:31:04,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:04,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 8 states. [2019-01-31 14:31:04,111 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 8 states. [2019-01-31 14:31:04,111 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 8 states. [2019-01-31 14:31:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:04,112 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-01-31 14:31:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-01-31 14:31:04,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:04,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:04,113 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states. [2019-01-31 14:31:04,113 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states. [2019-01-31 14:31:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:04,115 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-01-31 14:31:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-01-31 14:31:04,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:04,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:04,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:04,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:04,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 14:31:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-31 14:31:04,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-01-31 14:31:04,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:04,117 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-31 14:31:04,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-01-31 14:31:04,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 14:31:04,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:04,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 14:31:04,118 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:04,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:04,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1948270601, now seen corresponding path program 1 times [2019-01-31 14:31:04,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:04,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:04,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:04,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:04,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:04,171 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-31 14:31:04,172 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-31 14:31:04,173 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-31 14:31:04,173 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-31 14:31:04,174 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-31 14:31:04,174 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-31 14:31:04,174 INFO L273 TraceCheckUtils]: 6: Hoare triple {176#false} assume !false; {176#false} is VALID [2019-01-31 14:31:04,175 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-31 14:31:04,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:04,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:04,176 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 14:31:04,176 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22] [2019-01-31 14:31:04,178 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:31:04,178 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:31:04,319 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 14:31:04,320 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-31 14:31:04,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:04,321 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 14:31:04,594 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 28.89% of their original sizes. [2019-01-31 14:31:04,617 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 14:31:04,662 INFO L420 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2019-01-31 14:31:04,694 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 14:31:04,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 14:31:04,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2019-01-31 14:31:04,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:04,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-31 14:31:04,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:04,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-01-31 14:31:04,703 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-31 14:31:04,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 14:31:04,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 14:31:04,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 14:31:04,704 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-01-31 14:31:04,715 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:04,716 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:04,716 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:04,716 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:04,717 WARN L224 ngHoareTripleChecker]: Pre: {238#true} [2019-01-31 14:31:04,717 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-31 14:31:04,717 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-31 14:31:04,717 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-31 14:31:04,718 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:04,718 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:04,718 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:04,729 WARN L270 ngHoareTripleChecker]: Pre: {238#true} [2019-01-31 14:31:04,729 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-31 14:31:04,729 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-31 14:31:04,744 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-31 14:31:04,745 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:04,745 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:04,745 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-31 14:31:04,746 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-31 14:31:04,746 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-31 14:31:04,746 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:05,329 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:05,330 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:05,330 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:05,330 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:05,330 WARN L224 ngHoareTripleChecker]: Pre: {240#true} [2019-01-31 14:31:05,330 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-31 14:31:05,331 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-31 14:31:05,331 WARN L230 ngHoareTripleChecker]: Post: {241#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:05,331 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:05,331 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:05,331 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:05,332 WARN L270 ngHoareTripleChecker]: Pre: {240#true} [2019-01-31 14:31:05,332 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-31 14:31:05,333 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-31 14:31:05,341 WARN L276 ngHoareTripleChecker]: Post: {241#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:05,341 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:05,341 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:05,341 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-31 14:31:05,342 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-31 14:31:05,342 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-31 14:31:05,342 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:05,359 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:05,359 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:05,359 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:05,360 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:05,360 WARN L224 ngHoareTripleChecker]: Pre: {246#(= c_~n 5)} [2019-01-31 14:31:05,360 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-31 14:31:05,360 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-31 14:31:05,361 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-31 14:31:05,361 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:05,361 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:05,362 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:05,363 WARN L270 ngHoareTripleChecker]: Pre: {246#(= ~n 5)} [2019-01-31 14:31:05,363 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-31 14:31:05,364 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-31 14:31:05,373 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-31 14:31:05,373 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:05,373 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:05,374 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-31 14:31:05,374 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-31 14:31:05,374 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-31 14:31:05,375 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:05,384 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:05,385 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:05,385 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:05,385 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:05,385 WARN L224 ngHoareTripleChecker]: Pre: {250#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:05,386 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-31 14:31:05,386 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2019-01-31 14:31:05,386 WARN L230 ngHoareTripleChecker]: Post: {251#false} [2019-01-31 14:31:05,386 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:05,386 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:05,387 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:05,400 WARN L270 ngHoareTripleChecker]: Pre: {250#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:05,400 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-31 14:31:05,401 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-31 14:31:05,402 WARN L276 ngHoareTripleChecker]: Post: {251#false} [2019-01-31 14:31:05,402 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:05,402 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:05,402 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-31 14:31:05,402 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-31 14:31:05,402 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-31 14:31:05,403 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:05,490 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:05,490 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:05,490 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:05,490 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:05,491 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-31 14:31:05,491 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-31 14:31:05,491 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-31 14:31:05,491 WARN L230 ngHoareTripleChecker]: Post: {259#false} [2019-01-31 14:31:05,491 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:05,492 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:05,492 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:05,504 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-31 14:31:05,504 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-31 14:31:05,504 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-31 14:31:05,506 WARN L276 ngHoareTripleChecker]: Post: {259#false} [2019-01-31 14:31:05,506 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:05,507 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:05,507 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-31 14:31:05,507 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-31 14:31:05,507 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-31 14:31:05,508 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:05,539 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:05,540 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:05,540 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:05,540 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:05,540 WARN L224 ngHoareTripleChecker]: Pre: {272#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:05,540 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-31 14:31:05,541 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-31 14:31:05,541 WARN L230 ngHoareTripleChecker]: Post: {273#false} [2019-01-31 14:31:05,541 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:05,542 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:05,542 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:05,555 WARN L270 ngHoareTripleChecker]: Pre: {272#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:05,555 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-31 14:31:05,555 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-31 14:31:05,558 WARN L276 ngHoareTripleChecker]: Post: {273#false} [2019-01-31 14:31:05,558 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:05,558 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:05,559 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-31 14:31:05,559 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-31 14:31:05,559 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-31 14:31:05,559 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:05,692 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:05,692 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:05,692 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:05,692 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:05,693 WARN L224 ngHoareTripleChecker]: Pre: {283#(= c_~n 5)} [2019-01-31 14:31:05,693 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2019-01-31 14:31:05,693 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2019-01-31 14:31:05,693 WARN L230 ngHoareTripleChecker]: Post: {284#false} [2019-01-31 14:31:05,693 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:05,694 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:05,694 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:05,700 WARN L270 ngHoareTripleChecker]: Pre: {283#(= ~n 5)} [2019-01-31 14:31:05,700 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-31 14:31:05,700 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-31 14:31:05,709 WARN L276 ngHoareTripleChecker]: Post: {284#false} [2019-01-31 14:31:05,709 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:05,709 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:05,709 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-31 14:31:05,710 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-31 14:31:05,710 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2019-01-31 14:31:05,710 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:05,734 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:05,734 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:05,734 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:05,734 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:05,735 WARN L224 ngHoareTripleChecker]: Pre: {285#(= c_~n 5)} [2019-01-31 14:31:05,735 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-31 14:31:05,735 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-31 14:31:05,735 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-31 14:31:05,735 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:05,736 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:05,736 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:05,738 WARN L270 ngHoareTripleChecker]: Pre: {285#(= ~n 5)} [2019-01-31 14:31:05,738 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-31 14:31:05,738 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-31 14:31:05,747 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-31 14:31:05,747 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:05,748 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:05,748 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-31 14:31:05,748 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-31 14:31:05,749 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-31 14:31:05,749 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:06,388 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:06,388 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:06,388 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:06,388 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:06,389 WARN L224 ngHoareTripleChecker]: Pre: {287#(= c_~n 5)} [2019-01-31 14:31:06,389 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-31 14:31:06,389 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-31 14:31:06,389 WARN L230 ngHoareTripleChecker]: Post: {288#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:06,389 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:06,390 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:06,390 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:06,391 WARN L270 ngHoareTripleChecker]: Pre: {287#(= ~n 5)} [2019-01-31 14:31:06,391 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-31 14:31:06,392 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-31 14:31:06,396 WARN L276 ngHoareTripleChecker]: Post: {288#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:06,396 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:06,396 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:06,396 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-31 14:31:06,397 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-31 14:31:06,397 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-31 14:31:06,397 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:06,403 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:06,403 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:06,408 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:06,408 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:06,408 WARN L224 ngHoareTripleChecker]: Pre: {291#(= c_~n 5)} [2019-01-31 14:31:06,408 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-31 14:31:06,409 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-31 14:31:06,409 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-31 14:31:06,409 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:06,411 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:06,411 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:06,413 WARN L270 ngHoareTripleChecker]: Pre: {291#(= ~n 5)} [2019-01-31 14:31:06,413 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-31 14:31:06,414 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-31 14:31:06,424 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-31 14:31:06,424 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:06,425 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:06,425 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-31 14:31:06,425 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-31 14:31:06,425 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-31 14:31:06,425 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:07,002 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:07,002 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:07,003 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:07,003 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:07,003 WARN L224 ngHoareTripleChecker]: Pre: {293#(= c_~n 5)} [2019-01-31 14:31:07,003 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-31 14:31:07,003 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-31 14:31:07,004 WARN L230 ngHoareTripleChecker]: Post: {294#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:07,004 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:07,004 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:07,004 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:07,006 WARN L270 ngHoareTripleChecker]: Pre: {293#(= ~n 5)} [2019-01-31 14:31:07,006 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2019-01-31 14:31:07,006 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-31 14:31:07,011 WARN L276 ngHoareTripleChecker]: Post: {294#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:07,011 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:07,012 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:07,012 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-31 14:31:07,012 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-31 14:31:07,013 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-31 14:31:07,013 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:07,587 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 14:31:07,587 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 14:31:07,587 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 14:31:07,588 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 14:31:07,588 WARN L224 ngHoareTripleChecker]: Pre: {298#(= c_~n 5)} [2019-01-31 14:31:07,588 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-31 14:31:07,588 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-31 14:31:07,588 WARN L230 ngHoareTripleChecker]: Post: {299#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:07,588 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 14:31:07,589 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 14:31:07,589 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 14:31:07,591 WARN L270 ngHoareTripleChecker]: Pre: {298#(= ~n 5)} [2019-01-31 14:31:07,591 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-31 14:31:07,591 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-31 14:31:07,606 WARN L276 ngHoareTripleChecker]: Post: {299#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2019-01-31 14:31:07,606 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 14:31:07,606 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 14:31:07,607 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-31 14:31:07,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-31 14:31:07,607 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-31 14:31:07,608 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 14:31:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:07,617 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-01-31 14:31:07,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 14:31:07,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-31 14:31:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:07,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:31:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-01-31 14:31:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:31:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2019-01-31 14:31:07,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2019-01-31 14:31:07,683 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-31 14:31:07,684 INFO L225 Difference]: With dead ends: 14 [2019-01-31 14:31:07,685 INFO L226 Difference]: Without dead ends: 10 [2019-01-31 14:31:07,685 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-31 14:31:07,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-31 14:31:07,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-01-31 14:31:07,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:07,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 9 states. [2019-01-31 14:31:07,709 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 9 states. [2019-01-31 14:31:07,710 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 9 states. [2019-01-31 14:31:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:07,711 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-01-31 14:31:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-01-31 14:31:07,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:07,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:07,712 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 10 states. [2019-01-31 14:31:07,712 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 10 states. [2019-01-31 14:31:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:07,714 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2019-01-31 14:31:07,714 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-01-31 14:31:07,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:07,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:07,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:07,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-31 14:31:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-01-31 14:31:07,716 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2019-01-31 14:31:07,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:07,716 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-31 14:31:07,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 14:31:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-01-31 14:31:07,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 14:31:07,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:07,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 14:31:07,717 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:07,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:07,718 INFO L82 PathProgramCache]: Analyzing trace with hash 266915571, now seen corresponding path program 1 times [2019-01-31 14:31:07,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:07,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:07,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:07,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:07,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:07,783 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-31 14:31:07,784 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-31 14:31:07,785 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-31 14:31:07,785 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-31 14:31:07,785 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-31 14:31:07,786 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-31 14:31:07,786 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-31 14:31:07,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#false} assume !false; {339#false} is VALID [2019-01-31 14:31:07,788 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-31 14:31:07,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:07,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:07,788 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 14:31:07,789 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22], [24] [2019-01-31 14:31:07,790 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:31:07,791 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:31:07,981 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:31:07,981 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-31 14:31:07,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:07,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:31:07,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:07,984 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-31 14:31:08,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:08,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:31:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:08,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:08,153 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-31 14:31:08,166 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-31 14:31:08,181 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-31 14:31:08,182 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-31 14:31:08,182 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-31 14:31:08,182 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-31 14:31:08,183 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-31 14:31:08,183 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#false} assume !false; {339#false} is VALID [2019-01-31 14:31:08,183 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-31 14:31:08,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:08,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#false} assume !false; {339#false} is VALID [2019-01-31 14:31:08,270 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-31 14:31:08,270 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-31 14:31:08,271 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-31 14:31:08,271 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-31 14:31:08,272 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-31 14:31:08,273 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-31 14:31:08,273 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-31 14:31:08,274 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-31 14:31:08,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:08,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-31 14:31:08,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:08,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-31 14:31:08,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:08,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:08,305 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-31 14:31:08,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:08,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:08,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 14:31:08,306 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2019-01-31 14:31:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:08,355 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-01-31 14:31:08,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:08,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-31 14:31:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-31 14:31:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-31 14:31:08,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2019-01-31 14:31:08,442 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-31 14:31:08,443 INFO L225 Difference]: With dead ends: 16 [2019-01-31 14:31:08,443 INFO L226 Difference]: Without dead ends: 10 [2019-01-31 14:31:08,444 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-31 14:31:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-31 14:31:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-31 14:31:08,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:08,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2019-01-31 14:31:08,458 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-01-31 14:31:08,458 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-01-31 14:31:08,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:08,459 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-31 14:31:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-01-31 14:31:08,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:08,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:08,460 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2019-01-31 14:31:08,460 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2019-01-31 14:31:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:08,461 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-31 14:31:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-01-31 14:31:08,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:08,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:08,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:08,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 14:31:08,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2019-01-31 14:31:08,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2019-01-31 14:31:08,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:08,464 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2019-01-31 14:31:08,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2019-01-31 14:31:08,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 14:31:08,464 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:08,464 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 14:31:08,465 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:08,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:08,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1192626986, now seen corresponding path program 2 times [2019-01-31 14:31:08,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:08,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:08,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:08,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:08,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:08,550 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-31 14:31:08,551 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-31 14:31:08,552 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-31 14:31:08,553 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-31 14:31:08,554 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-31 14:31:08,554 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-31 14:31:08,554 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-31 14:31:08,555 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-31 14:31:08,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#false} assume !false; {456#false} is VALID [2019-01-31 14:31:08,556 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-31 14:31:08,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:08,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:08,556 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:08,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:08,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:08,557 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-31 14:31:08,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 14:31:08,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 14:31:08,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 14:31:08,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 14:31:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:08,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:08,646 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-31 14:31:08,648 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-31 14:31:08,649 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-31 14:31:08,653 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-31 14:31:08,653 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-31 14:31:08,653 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-31 14:31:08,653 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-31 14:31:08,654 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-31 14:31:08,654 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#false} assume !false; {456#false} is VALID [2019-01-31 14:31:08,654 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-31 14:31:08,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:08,712 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#false} assume !false; {456#false} is VALID [2019-01-31 14:31:08,712 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-31 14:31:08,713 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-31 14:31:08,713 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-31 14:31:08,714 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-31 14:31:08,715 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-31 14:31:08,716 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-31 14:31:08,717 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-31 14:31:08,717 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-31 14:31:08,718 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-31 14:31:08,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:08,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-01-31 14:31:08,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:08,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-31 14:31:08,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:08,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-01-31 14:31:08,747 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-31 14:31:08,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 14:31:08,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 14:31:08,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-31 14:31:08,748 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2019-01-31 14:31:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:08,850 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-31 14:31:08,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 14:31:08,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-31 14:31:08,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:31:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-01-31 14:31:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-31 14:31:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-01-31 14:31:08,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 17 transitions. [2019-01-31 14:31:08,875 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-31 14:31:08,875 INFO L225 Difference]: With dead ends: 17 [2019-01-31 14:31:08,876 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 14:31:08,876 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-31 14:31:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 14:31:08,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-31 14:31:08,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:08,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-01-31 14:31:08,896 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-01-31 14:31:08,896 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-01-31 14:31:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:08,898 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-31 14:31:08,898 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-31 14:31:08,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:08,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:08,899 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-01-31 14:31:08,899 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-01-31 14:31:08,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:08,900 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-31 14:31:08,900 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-31 14:31:08,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:08,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:08,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:08,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:08,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 14:31:08,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-31 14:31:08,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2019-01-31 14:31:08,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:08,902 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-31 14:31:08,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 14:31:08,902 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-31 14:31:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 14:31:08,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:08,902 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 14:31:08,903 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:08,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:08,903 INFO L82 PathProgramCache]: Analyzing trace with hash -175090221, now seen corresponding path program 3 times [2019-01-31 14:31:08,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:08,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:08,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 14:31:08,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:08,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:09,016 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-31 14:31:09,017 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-31 14:31:09,018 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-31 14:31:09,019 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-31 14:31:09,020 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-31 14:31:09,020 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-31 14:31:09,020 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-31 14:31:09,021 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-31 14:31:09,021 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-31 14:31:09,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#false} assume !false; {586#false} is VALID [2019-01-31 14:31:09,022 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-31 14:31:09,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:09,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:09,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:09,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:09,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:09,023 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-31 14:31:09,032 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 14:31:09,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 14:31:09,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 14:31:09,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 14:31:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:09,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:09,115 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-31 14:31:09,116 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-31 14:31:09,119 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-31 14:31:09,119 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-31 14:31:09,121 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-31 14:31:09,121 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-31 14:31:09,121 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-31 14:31:09,121 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-31 14:31:09,121 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-31 14:31:09,122 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#false} assume !false; {586#false} is VALID [2019-01-31 14:31:09,122 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-31 14:31:09,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:09,193 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#false} assume !false; {586#false} is VALID [2019-01-31 14:31:09,194 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-31 14:31:09,194 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-31 14:31:09,195 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-31 14:31:09,195 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-31 14:31:09,195 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-31 14:31:09,196 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-31 14:31:09,196 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-31 14:31:09,197 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-31 14:31:09,198 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-31 14:31:09,198 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-31 14:31:09,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:09,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2019-01-31 14:31:09,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:09,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-31 14:31:09,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:09,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-31 14:31:09,240 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-31 14:31:09,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 14:31:09,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 14:31:09,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-31 14:31:09,241 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2019-01-31 14:31:09,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:09,341 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2019-01-31 14:31:09,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 14:31:09,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-31 14:31:09,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:31:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-01-31 14:31:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:31:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-01-31 14:31:09,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2019-01-31 14:31:09,482 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-31 14:31:09,483 INFO L225 Difference]: With dead ends: 18 [2019-01-31 14:31:09,484 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 14:31:09,484 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-31 14:31:09,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 14:31:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-31 14:31:09,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:09,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-01-31 14:31:09,502 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-31 14:31:09,503 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-31 14:31:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:09,504 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-31 14:31:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-31 14:31:09,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:09,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:09,505 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-31 14:31:09,505 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-31 14:31:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:09,507 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-31 14:31:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-31 14:31:09,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:09,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:09,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:09,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:09,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 14:31:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-31 14:31:09,509 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2019-01-31 14:31:09,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:09,509 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-31 14:31:09,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 14:31:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-31 14:31:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-31 14:31:09,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:09,510 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 14:31:09,510 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:09,510 INFO L82 PathProgramCache]: Analyzing trace with hash 375349322, now seen corresponding path program 4 times [2019-01-31 14:31:09,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:09,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:09,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 14:31:09,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:09,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:09,619 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-31 14:31:09,620 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-31 14:31:09,622 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-31 14:31:09,623 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-31 14:31:09,624 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-31 14:31:09,625 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-31 14:31:09,625 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-31 14:31:09,625 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-31 14:31:09,626 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-31 14:31:09,626 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-31 14:31:09,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#false} assume !false; {728#false} is VALID [2019-01-31 14:31:09,627 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-31 14:31:09,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:09,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:09,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:09,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:09,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:09,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 14:31:09,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:09,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:31:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:09,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:09,778 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-31 14:31:09,779 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-31 14:31:09,780 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-31 14:31:09,781 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-31 14:31:09,783 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-31 14:31:09,783 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-31 14:31:09,784 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-31 14:31:09,784 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-31 14:31:09,784 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-31 14:31:09,785 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-31 14:31:09,785 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#false} assume !false; {728#false} is VALID [2019-01-31 14:31:09,786 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-31 14:31:09,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:09,840 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#false} assume !false; {728#false} is VALID [2019-01-31 14:31:09,841 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-31 14:31:09,842 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-31 14:31:09,842 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-31 14:31:09,842 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-31 14:31:09,855 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-31 14:31:09,856 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-31 14:31:09,857 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-31 14:31:09,858 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-31 14:31:09,860 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-31 14:31:09,860 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-31 14:31:09,861 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-31 14:31:09,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:09,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-01-31 14:31:09,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:09,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-31 14:31:09,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:09,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-01-31 14:31:09,893 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-31 14:31:09,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 14:31:09,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 14:31:09,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-31 14:31:09,894 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-01-31 14:31:10,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:10,054 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2019-01-31 14:31:10,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 14:31:10,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-31 14:31:10,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-01-31 14:31:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-31 14:31:10,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-01-31 14:31:10,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2019-01-31 14:31:10,081 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-31 14:31:10,082 INFO L225 Difference]: With dead ends: 19 [2019-01-31 14:31:10,083 INFO L226 Difference]: Without dead ends: 13 [2019-01-31 14:31:10,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-31 14:31:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-31 14:31:10,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-31 14:31:10,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:10,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2019-01-31 14:31:10,214 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-01-31 14:31:10,214 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-01-31 14:31:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:10,215 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-31 14:31:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-01-31 14:31:10,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:10,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:10,216 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-01-31 14:31:10,216 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-01-31 14:31:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:10,217 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-31 14:31:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-01-31 14:31:10,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:10,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:10,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:10,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 14:31:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-01-31 14:31:10,219 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2019-01-31 14:31:10,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:10,219 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-01-31 14:31:10,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 14:31:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-01-31 14:31:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-31 14:31:10,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:10,220 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 14:31:10,220 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:10,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:10,221 INFO L82 PathProgramCache]: Analyzing trace with hash 259105971, now seen corresponding path program 5 times [2019-01-31 14:31:10,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:10,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:10,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:10,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:10,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:10,306 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-31 14:31:10,306 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-31 14:31:10,306 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-31 14:31:10,307 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-31 14:31:10,307 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-31 14:31:10,307 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-31 14:31:10,308 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-31 14:31:10,308 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-31 14:31:10,309 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-31 14:31:10,310 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-31 14:31:10,310 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-31 14:31:10,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {882#false} assume !false; {882#false} is VALID [2019-01-31 14:31:10,311 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-31 14:31:10,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:10,312 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:10,312 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:10,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:10,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:10,312 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-31 14:31:10,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 14:31:10,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 14:31:10,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 14:31:10,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 14:31:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:10,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:10,568 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-31 14:31:10,568 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-31 14:31:10,572 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-31 14:31:10,593 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-31 14:31:10,608 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-31 14:31:10,623 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-31 14:31:10,639 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-31 14:31:10,653 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-31 14:31:10,662 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-31 14:31:10,675 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-31 14:31:10,688 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-31 14:31:10,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {882#false} assume !false; {882#false} is VALID [2019-01-31 14:31:10,689 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-31 14:31:10,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:11,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {882#false} assume !false; {882#false} is VALID [2019-01-31 14:31:11,122 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-31 14:31:11,123 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-31 14:31:11,124 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-31 14:31:11,124 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-31 14:31:11,126 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-31 14:31:11,126 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-31 14:31:11,128 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-31 14:31:11,128 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-31 14:31:11,130 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-31 14:31:11,130 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-31 14:31:11,131 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-31 14:31:11,132 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-31 14:31:11,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:11,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2019-01-31 14:31:11,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:11,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-01-31 14:31:11,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:11,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-31 14:31:11,195 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-31 14:31:11,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 14:31:11,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 14:31:11,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-31 14:31:11,196 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 8 states. [2019-01-31 14:31:11,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:11,576 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-01-31 14:31:11,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 14:31:11,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-01-31 14:31:11,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 14:31:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2019-01-31 14:31:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 14:31:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2019-01-31 14:31:11,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2019-01-31 14:31:11,642 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-31 14:31:11,643 INFO L225 Difference]: With dead ends: 21 [2019-01-31 14:31:11,643 INFO L226 Difference]: Without dead ends: 19 [2019-01-31 14:31:11,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 14:31:11,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-31 14:31:11,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-31 14:31:11,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:11,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2019-01-31 14:31:11,715 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-01-31 14:31:11,715 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-01-31 14:31:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:11,717 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-01-31 14:31:11,717 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-01-31 14:31:11,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:11,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:11,718 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-01-31 14:31:11,718 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-01-31 14:31:11,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:11,719 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-01-31 14:31:11,719 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-01-31 14:31:11,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:11,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:11,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:11,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:11,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-31 14:31:11,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-01-31 14:31:11,721 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2019-01-31 14:31:11,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:11,721 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-01-31 14:31:11,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 14:31:11,722 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-01-31 14:31:11,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-31 14:31:11,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:11,722 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2019-01-31 14:31:11,722 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:11,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:11,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1746247989, now seen corresponding path program 6 times [2019-01-31 14:31:11,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:11,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:11,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 14:31:11,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:11,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:11,812 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-31 14:31:11,812 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-31 14:31:11,813 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-31 14:31:11,813 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-31 14:31:11,813 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-31 14:31:11,813 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-31 14:31:11,813 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-31 14:31:11,813 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-31 14:31:11,814 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-31 14:31:11,814 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-31 14:31:11,814 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-31 14:31:11,815 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-31 14:31:11,816 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-31 14:31:11,816 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-31 14:31:11,816 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-31 14:31:11,816 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-31 14:31:11,816 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-31 14:31:11,816 INFO L273 TraceCheckUtils]: 17: Hoare triple {1080#false} assume !false; {1080#false} is VALID [2019-01-31 14:31:11,817 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-31 14:31:11,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:31:11,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-31 14:31:11,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:11,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-31 14:31:11,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:11,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:11,829 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-31 14:31:11,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:11,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:11,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 14:31:11,831 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 4 states. [2019-01-31 14:31:11,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:11,963 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-01-31 14:31:11,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:11,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-31 14:31:11,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-31 14:31:11,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-31 14:31:11,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2019-01-31 14:31:11,982 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-31 14:31:11,983 INFO L225 Difference]: With dead ends: 29 [2019-01-31 14:31:11,983 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 14:31:11,984 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-31 14:31:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 14:31:12,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-31 14:31:12,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:12,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2019-01-31 14:31:12,078 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-01-31 14:31:12,079 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-01-31 14:31:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:12,080 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-01-31 14:31:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-01-31 14:31:12,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:12,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:12,082 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-01-31 14:31:12,082 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-01-31 14:31:12,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:12,083 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-01-31 14:31:12,083 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-01-31 14:31:12,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:12,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:12,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:12,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:12,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-31 14:31:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-01-31 14:31:12,085 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2019-01-31 14:31:12,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:12,085 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-01-31 14:31:12,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:12,086 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-01-31 14:31:12,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-31 14:31:12,086 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:12,086 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2019-01-31 14:31:12,087 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:12,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:12,087 INFO L82 PathProgramCache]: Analyzing trace with hash 406829563, now seen corresponding path program 7 times [2019-01-31 14:31:12,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:12,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:12,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 14:31:12,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:12,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:12,429 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-31 14:31:12,430 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-31 14:31:12,430 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-31 14:31:12,430 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-31 14:31:12,431 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-31 14:31:12,431 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-31 14:31:12,431 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-31 14:31:12,441 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-31 14:31:12,442 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-31 14:31:12,443 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-31 14:31:12,443 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-31 14:31:12,444 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-31 14:31:12,444 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-31 14:31:12,445 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-31 14:31:12,445 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-31 14:31:12,445 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-31 14:31:12,446 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-31 14:31:12,446 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-31 14:31:12,446 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-31 14:31:12,446 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2019-01-31 14:31:12,447 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-31 14:31:12,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:12,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:12,447 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:12,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:12,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:12,448 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-31 14:31:12,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:12,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:31:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:12,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31: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-31 14:31:12,641 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-31 14:31:12,641 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-31 14:31:12,642 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-31 14:31:12,642 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-31 14:31:12,643 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-31 14:31:12,643 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-31 14:31:12,644 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-31 14:31:12,644 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-31 14:31:12,645 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-31 14:31:12,646 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-31 14:31:12,646 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-31 14:31:12,646 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-31 14:31:12,647 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-31 14:31:12,647 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-31 14:31:12,647 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-31 14:31:12,648 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-31 14:31:12,648 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-31 14:31:12,648 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-31 14:31:12,649 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2019-01-31 14:31:12,650 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-31 14:31:12,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:12,746 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2019-01-31 14:31:12,747 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-31 14:31:12,747 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-31 14:31:12,747 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-31 14:31:12,748 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-31 14:31:12,748 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-31 14:31:12,748 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-31 14:31: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-31 14:31:12,749 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-31 14:31:12,749 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-31 14:31: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-31 14:31: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-31 14:31: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-31 14:31:12,752 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-31 14:31:12,753 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-31 14:31:12,753 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-31 14:31:12,754 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-31 14:31:12,754 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-31 14:31:12,755 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-31 14:31:12,756 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-31 14:31:12,757 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-31 14:31:12,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:31:12,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2019-01-31 14:31:12,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:31:12,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-01-31 14:31:12,784 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:12,784 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-01-31 14:31:12,821 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-31 14:31:12,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 14:31:12,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 14:31:12,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-01-31 14:31:12,822 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2019-01-31 14:31:13,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:13,318 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-01-31 14:31:13,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 14:31:13,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-01-31 14:31:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:13,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 14:31:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2019-01-31 14:31:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 14:31:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2019-01-31 14:31:13,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 26 transitions. [2019-01-31 14:31:13,365 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-31 14:31:13,366 INFO L225 Difference]: With dead ends: 39 [2019-01-31 14:31:13,366 INFO L226 Difference]: Without dead ends: 26 [2019-01-31 14:31:13,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-01-31 14:31:13,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-31 14:31:13,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-31 14:31:13,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:13,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2019-01-31 14:31:13,447 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2019-01-31 14:31:13,447 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2019-01-31 14:31:13,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:13,448 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-01-31 14:31:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-01-31 14:31:13,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:13,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:13,449 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2019-01-31 14:31:13,449 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2019-01-31 14:31:13,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:13,450 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-01-31 14:31:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-01-31 14:31:13,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:13,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:13,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:13,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 14:31:13,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-01-31 14:31:13,452 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 20 [2019-01-31 14:31:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:13,452 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-01-31 14:31:13,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 14:31:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-01-31 14:31:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-31 14:31:13,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:31:13,453 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2019-01-31 14:31:13,453 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:31:13,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:31:13,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1640374485, now seen corresponding path program 8 times [2019-01-31 14:31:13,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:31:13,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:13,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:31:13,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:31:13,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:31:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:13,591 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-31 14:31:13,591 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-31 14:31:13,591 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-31 14:31:13,592 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-31 14:31:13,592 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-31 14:31:13,592 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-31 14:31:13,592 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-31 14:31:13,594 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-31 14:31:13,599 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-31 14:31:13,602 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-31 14:31:13,616 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-31 14:31:13,620 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-31 14:31:13,622 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-31 14:31:13,622 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-31 14:31:13,623 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-31 14:31:13,623 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-31 14:31:13,623 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-31 14:31:13,623 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-31 14:31:13,623 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-31 14:31:13,623 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-31 14:31:13,624 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-31 14:31:13,624 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#false} assume !false; {1545#false} is VALID [2019-01-31 14:31:13,624 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-31 14:31:13,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:13,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:31:13,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 14:31:13,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 14:31:13,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:31:13,626 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-31 14:31:13,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 14:31:13,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 14:31:13,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 14:31:13,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 14:31:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:31:13,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:31:13,822 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-31 14:31:13,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:31:13,843 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-31 14:31:13,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-31 14:31:13,847 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:31:13,847 WARN L398 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-31 14:31:13,847 WARN L399 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-31 14:31:14,167 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-31 14:31:14,167 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-31 14:31:14,168 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-31 14:31:14,168 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-31 14:31:14,168 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-31 14:31:14,170 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-31 14:31:14,171 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-31 14:31:14,172 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-31 14:31:14,173 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-31 14:31:14,173 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-31 14:31:14,174 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-31 14:31:14,175 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-31 14:31:14,177 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-31 14:31:14,178 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-31 14:31:14,179 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-31 14:31:14,180 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-31 14:31:14,180 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-31 14:31:14,181 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-31 14:31:14,181 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-31 14:31:14,181 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-31 14:31:14,183 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-31 14:31:14,183 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#false} assume !false; {1545#false} is VALID [2019-01-31 14:31:14,188 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-31 14:31:14,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:31:14,300 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#false} assume !false; {1545#false} is VALID [2019-01-31 14:31:14,301 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-31 14:31:14,302 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-31 14:31:14,303 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-31 14:31:14,303 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-31 14:31:14,304 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-31 14:31:14,305 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-31 14:31:14,306 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-31 14:31:14,306 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-31 14:31:14,307 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-31 14:31:14,308 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-31 14:31:14,308 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-31 14:31:14,309 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-31 14:31:14,310 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-31 14:31:14,310 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-31 14:31:14,311 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-31 14:31:14,312 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-31 14:31:14,313 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-31 14:31:14,313 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-31 14:31:14,313 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-31 14:31:14,314 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-31 14:31:14,314 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-31 14:31:14,316 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-31 14:31:14,343 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-01-31 14:31:14,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2019-01-31 14:31:14,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:31:14,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-01-31 14:31:14,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:31:14,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-31 14:31:14,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-31 14:31:14,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 14:31:14,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 14:31:14,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-01-31 14:31:14,361 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2019-01-31 14:31:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:14,652 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2019-01-31 14:31:14,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:31:14,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-01-31 14:31:14,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:31:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-31 14:31:14,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 14:31:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-31 14:31:14,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 9 transitions. [2019-01-31 14:31:14,668 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-31 14:31:14,668 INFO L225 Difference]: With dead ends: 26 [2019-01-31 14:31:14,669 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 14:31:14,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-01-31 14:31:14,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 14:31:14,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 14:31:14,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:31:14,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:14,671 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:14,671 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:14,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:14,671 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:14,671 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:14,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:14,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:14,672 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:14,672 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 14:31:14,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:31:14,672 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 14:31:14,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:14,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:14,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:31:14,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:31:14,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:31:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 14:31:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 14:31:14,673 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-01-31 14:31:14,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:31:14,673 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 14:31:14,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 14:31:14,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 14:31:14,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:31:14,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 14:31:14,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 14:31:14,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 14:31:14,952 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-01-31 14:31:15,119 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-01-31 14:31:15,127 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2019-01-31 14:31:15,128 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2019-01-31 14:31:15,128 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2019-01-31 14:31:15,129 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-31 14:31:15,129 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2019-01-31 14:31:15,129 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-31 14:31:15,129 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-31 14:31:15,131 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-01-31 14:31:15,136 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-01-31 14:31:15,140 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-31 14:31:15,151 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 02:31:15 BoogieIcfgContainer [2019-01-31 14:31:15,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 14:31:15,152 INFO L168 Benchmark]: Toolchain (without parser) took 16313.77 ms. Allocated memory was 130.5 MB in the beginning and 367.5 MB in the end (delta: 237.0 MB). Free memory was 102.3 MB in the beginning and 311.7 MB in the end (delta: -209.4 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:15,153 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.13 ms. Allocated memory is still 130.5 MB. Free memory is still 103.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:31:15,154 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.45 ms. Allocated memory is still 130.5 MB. Free memory was 102.1 MB in the beginning and 100.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:15,155 INFO L168 Benchmark]: Boogie Preprocessor took 34.55 ms. Allocated memory is still 130.5 MB. Free memory was 100.4 MB in the beginning and 99.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:15,155 INFO L168 Benchmark]: RCFGBuilder took 636.98 ms. Allocated memory is still 130.5 MB. Free memory was 99.2 MB in the beginning and 86.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:15,156 INFO L168 Benchmark]: TraceAbstraction took 15595.32 ms. Allocated memory was 130.5 MB in the beginning and 367.5 MB in the end (delta: 237.0 MB). Free memory was 85.8 MB in the beginning and 311.7 MB in the end (delta: -225.9 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-01-31 14:31:15,160 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.13 ms. Allocated memory is still 130.5 MB. Free memory is still 103.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.45 ms. Allocated memory is still 130.5 MB. Free memory was 102.1 MB in the beginning and 100.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.55 ms. Allocated memory is still 130.5 MB. Free memory was 100.4 MB in the beginning and 99.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 636.98 ms. Allocated memory is still 130.5 MB. Free memory was 99.2 MB in the beginning and 86.0 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15595.32 ms. Allocated memory was 130.5 MB in the beginning and 367.5 MB in the end (delta: 237.0 MB). Free memory was 85.8 MB in the beginning and 311.7 MB in the end (delta: -225.9 MB). Peak memory consumption was 11.1 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, 15.5s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 8.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, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 158 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.3s 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.5s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, -0.7066666666666667 AbsIntWeakeningRatio, 2.4 AbsIntAvgWeakeningVarsNumRemoved, 0.4 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 30 NumberOfFragments, 234 HoareAnnotationTreeSize, 4 FomulaSimplifications, 859 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 312 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s 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...