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-4b9831f [2018-12-23 14:06:27,407 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-23 14:06:27,410 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-23 14:06:27,424 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-23 14:06:27,424 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-23 14:06:27,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-23 14:06:27,429 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-23 14:06:27,432 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-23 14:06:27,434 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-23 14:06:27,435 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-23 14:06:27,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-23 14:06:27,436 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-23 14:06:27,438 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-23 14:06:27,439 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-23 14:06:27,442 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-23 14:06:27,444 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-23 14:06:27,445 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-23 14:06:27,453 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-23 14:06:27,455 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-23 14:06:27,457 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-23 14:06:27,458 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-23 14:06:27,459 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-23 14:06:27,461 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-23 14:06:27,462 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-23 14:06:27,462 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-23 14:06:27,463 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-23 14:06:27,464 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-23 14:06:27,464 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-23 14:06:27,465 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-23 14:06:27,466 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-23 14:06:27,466 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-23 14:06:27,467 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-23 14:06:27,467 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-23 14:06:27,468 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-23 14:06:27,469 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-23 14:06:27,469 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-23 14:06:27,470 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-23 14:06:27,496 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-23 14:06:27,496 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-23 14:06:27,498 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-23 14:06:27,498 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-23 14:06:27,498 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-23 14:06:27,498 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-23 14:06:27,499 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-23 14:06:27,499 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-23 14:06:27,499 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-23 14:06:27,499 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-23 14:06:27,499 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-23 14:06:27,500 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-23 14:06:27,500 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-23 14:06:27,500 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-23 14:06:27,501 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-23 14:06:27,501 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-23 14:06:27,501 INFO L133 SettingsManager]: * Use SBE=true [2018-12-23 14:06:27,501 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-23 14:06:27,503 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-23 14:06:27,503 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-23 14:06:27,503 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-23 14:06:27,503 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-23 14:06:27,504 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-23 14:06:27,504 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-23 14:06:27,504 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-23 14:06:27,504 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-23 14:06:27,504 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-23 14:06:27,504 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-23 14:06:27,506 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-23 14:06:27,506 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-23 14:06:27,506 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-23 14:06:27,507 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-23 14:06:27,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-23 14:06:27,507 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-23 14:06:27,507 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-23 14:06:27,507 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-23 14:06:27,508 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-23 14:06:27,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-23 14:06:27,508 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-23 14:06:27,508 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-23 14:06:27,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-23 14:06:27,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-23 14:06:27,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-23 14:06:27,583 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-23 14:06:27,583 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-23 14:06:27,584 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2018-12-23 14:06:27,584 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2018-12-23 14:06:27,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-23 14:06:27,635 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-23 14:06:27,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-23 14:06:27,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-23 14:06:27,636 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-23 14:06:27,657 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 23.12 02:06:27" (1/1) ... [2018-12-23 14:06:27,671 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 23.12 02:06:27" (1/1) ... [2018-12-23 14:06:27,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-23 14:06:27,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-23 14:06:27,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-23 14:06:27,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-23 14:06:27,698 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 23.12 02:06:27" (1/1) ... [2018-12-23 14:06:27,698 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 23.12 02:06:27" (1/1) ... [2018-12-23 14:06:27,700 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 23.12 02:06:27" (1/1) ... [2018-12-23 14:06:27,700 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 23.12 02:06:27" (1/1) ... [2018-12-23 14:06:27,707 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 23.12 02:06:27" (1/1) ... [2018-12-23 14:06:27,715 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 23.12 02:06:27" (1/1) ... [2018-12-23 14:06:27,716 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 23.12 02:06:27" (1/1) ... [2018-12-23 14:06:27,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-23 14:06:27,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-23 14:06:27,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-23 14:06:27,724 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-23 14:06:27,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:06:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-23 14:06:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-23 14:06:27,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-23 14:06:28,312 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-23 14:06:28,312 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-23 14:06:28,313 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 02:06:28 BoogieIcfgContainer [2018-12-23 14:06:28,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-23 14:06:28,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-23 14:06:28,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-23 14:06:28,318 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-23 14:06:28,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.12 02:06:27" (1/2) ... [2018-12-23 14:06:28,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4575a14b and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 02:06:28, skipping insertion in model container [2018-12-23 14:06:28,320 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 23.12 02:06:28" (2/2) ... [2018-12-23 14:06:28,322 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2018-12-23 14:06:28,335 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-23 14:06:28,344 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-23 14:06:28,363 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-23 14:06:28,398 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-23 14:06:28,398 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-23 14:06:28,399 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-23 14:06:28,399 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-23 14:06:28,399 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-23 14:06:28,399 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-23 14:06:28,399 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-23 14:06:28,400 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-23 14:06:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-23 14:06:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-23 14:06:28,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:06:28,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-23 14:06:28,425 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:06:28,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:06:28,430 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-23 14:06:28,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:06:28,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:28,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:06:28,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:28,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:06:28,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:28,630 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {11#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:28,649 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(<= 4 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {10#false} is VALID [2018-12-23 14:06:28,650 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10#false} is VALID [2018-12-23 14:06:28,650 INFO L273 TraceCheckUtils]: 3: Hoare triple {10#false} assume !false; {10#false} is VALID [2018-12-23 14:06:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:06:28,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-23 14:06:28,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-23 14:06:28,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:06:28,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-23 14:06:28,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:06:28,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-23 14:06:28,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:28,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-23 14:06:28,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-23 14:06:28,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-23 14:06:28,710 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-23 14:06:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:28,835 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-23 14:06:28,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-23 14:06:28,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-23 14:06:28,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:06:28,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:06:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-23 14:06:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-23 14:06:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2018-12-23 14:06:28,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2018-12-23 14:06:28,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:28,961 INFO L225 Difference]: With dead ends: 11 [2018-12-23 14:06:28,961 INFO L226 Difference]: Without dead ends: 7 [2018-12-23 14:06:28,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-23 14:06:28,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-23 14:06:29,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-23 14:06:29,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:06:29,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2018-12-23 14:06:29,008 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-23 14:06:29,008 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-23 14:06:29,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:29,010 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2018-12-23 14:06:29,011 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-23 14:06:29,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:29,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:29,011 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-23 14:06:29,012 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-23 14:06:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:29,013 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2018-12-23 14:06:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-23 14:06:29,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:29,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:29,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:06:29,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:06:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-23 14:06:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-23 14:06:29,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2018-12-23 14:06:29,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:06:29,018 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-23 14:06:29,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-23 14:06:29,018 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-23 14:06:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-23 14:06:29,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:06:29,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-23 14:06:29,019 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:06:29,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:06:29,020 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2018-12-23 14:06:29,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:06:29,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:29,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:06:29,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:29,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:06:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:29,156 INFO L273 TraceCheckUtils]: 0: Hoare triple {59#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {61#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:29,161 INFO L273 TraceCheckUtils]: 1: Hoare triple {61#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {62#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:29,162 INFO L273 TraceCheckUtils]: 2: Hoare triple {62#(<= 3 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {60#false} is VALID [2018-12-23 14:06:29,163 INFO L273 TraceCheckUtils]: 3: Hoare triple {60#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {60#false} is VALID [2018-12-23 14:06:29,163 INFO L273 TraceCheckUtils]: 4: Hoare triple {60#false} assume !false; {60#false} is VALID [2018-12-23 14:06:29,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-23 14:06:29,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:29,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:06:29,165 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-23 14:06:29,169 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2018-12-23 14:06:29,222 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-23 14:06:29,222 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-23 14:06:29,473 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-23 14:06:29,475 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 75 root evaluator evaluations with a maximum evaluation depth of 3. Performed 75 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-23 14:06:29,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:06:29,481 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-23 14:06:29,675 INFO L227 lantSequenceWeakener]: Weakened 1 states. On average, predicates are now at 33.33% of their original sizes. [2018-12-23 14:06:29,682 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2018-12-23 14:06:29,739 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2018-12-23 14:06:29,774 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-23 14:06:29,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-23 14:06:29,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-12-23 14:06:29,776 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:06:29,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-23 14:06:29,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:06:29,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-23 14:06:29,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:29,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-23 14:06:29,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-23 14:06:29,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-23 14:06:29,795 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2018-12-23 14:06:30,435 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:30,435 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:30,436 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:30,437 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:30,438 WARN L224 ngHoareTripleChecker]: Pre: {103#true} [2018-12-23 14:06:30,438 WARN L228 ngHoareTripleChecker]: Action: ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; [2018-12-23 14:06:30,439 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2018-12-23 14:06:30,439 WARN L230 ngHoareTripleChecker]: Post: {104#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:30,439 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:30,440 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:30,440 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:30,443 WARN L270 ngHoareTripleChecker]: Pre: {103#true} [2018-12-23 14:06:30,444 WARN L274 ngHoareTripleChecker]: Action: ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; [2018-12-23 14:06:30,445 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2018-12-23 14:06:30,516 WARN L276 ngHoareTripleChecker]: Post: {104#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:30,517 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:30,517 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:30,518 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, ~n, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, ~n, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-23 14:06:30,518 WARN L628 ntHoareTripleChecker]: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) (~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4;) [2018-12-23 14:06:30,519 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-23 14:06:30,519 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:30,590 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:30,591 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:30,591 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:30,592 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:30,592 WARN L224 ngHoareTripleChecker]: Pre: {113#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:30,592 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-23 14:06:30,593 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-23 14:06:30,593 WARN L230 ngHoareTripleChecker]: Post: {114#false} [2018-12-23 14:06:30,593 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:30,594 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:30,594 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:30,685 WARN L270 ngHoareTripleChecker]: Pre: {113#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:30,685 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-23 14:06:30,686 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-23 14:06:30,692 WARN L276 ngHoareTripleChecker]: Post: {114#false} [2018-12-23 14:06:30,693 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:30,693 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:30,693 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2018-12-23 14:06:30,693 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) (assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1;) [2018-12-23 14:06:30,694 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-23 14:06:30,694 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:30,711 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:30,712 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:30,712 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:30,712 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:30,712 WARN L224 ngHoareTripleChecker]: Pre: {118#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:30,713 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; [2018-12-23 14:06:30,713 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) [2018-12-23 14:06:30,713 WARN L230 ngHoareTripleChecker]: Post: {119#false} [2018-12-23 14:06:30,713 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:30,714 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:30,714 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:30,724 WARN L270 ngHoareTripleChecker]: Pre: {118#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:30,724 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; [2018-12-23 14:06:30,724 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) [2018-12-23 14:06:30,729 WARN L276 ngHoareTripleChecker]: Post: {119#false} [2018-12-23 14:06:30,729 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:30,729 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:30,730 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2018-12-23 14:06:30,730 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) (assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0;) [2018-12-23 14:06:30,730 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-23 14:06:30,730 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:30,799 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:30,800 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:30,800 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:30,800 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:30,800 WARN L224 ngHoareTripleChecker]: Pre: {126#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:30,801 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-23 14:06:30,801 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-23 14:06:30,801 WARN L230 ngHoareTripleChecker]: Post: {127#false} [2018-12-23 14:06:30,801 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:30,802 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:30,802 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:30,836 WARN L270 ngHoareTripleChecker]: Pre: {126#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:30,837 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-23 14:06:30,837 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-23 14:06:30,874 WARN L276 ngHoareTripleChecker]: Post: {127#false} [2018-12-23 14:06:30,874 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:30,874 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:30,875 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2018-12-23 14:06:30,875 WARN L628 ntHoareTripleChecker]: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) (assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1;) [2018-12-23 14:06:30,876 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-23 14:06:30,876 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:30,941 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:30,941 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:30,942 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:30,942 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:30,942 WARN L224 ngHoareTripleChecker]: Pre: {128#(= c_~n 5)} [2018-12-23 14:06:30,943 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-23 14:06:30,943 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-23 14:06:30,943 WARN L230 ngHoareTripleChecker]: Post: {129#false} [2018-12-23 14:06:30,943 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:30,944 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:30,944 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:30,979 WARN L270 ngHoareTripleChecker]: Pre: {128#(= ~n 5)} [2018-12-23 14:06:30,979 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-23 14:06:30,980 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-23 14:06:31,016 WARN L276 ngHoareTripleChecker]: Post: {129#false} [2018-12-23 14:06:31,016 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:31,016 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:31,017 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-23 14:06:31,017 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) (assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false;) [2018-12-23 14:06:31,018 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-23 14:06:31,018 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:31,681 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:31,681 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:31,682 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:31,682 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:31,682 WARN L224 ngHoareTripleChecker]: Pre: {130#(= c_~n 5)} [2018-12-23 14:06:31,682 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-23 14:06:31,682 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-23 14:06:31,683 WARN L230 ngHoareTripleChecker]: Post: {131#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:31,683 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:31,683 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:31,683 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:31,685 WARN L270 ngHoareTripleChecker]: Pre: {130#(= ~n 5)} [2018-12-23 14:06:31,685 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-23 14:06:31,686 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-23 14:06:31,698 WARN L276 ngHoareTripleChecker]: Post: {131#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:31,698 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:31,698 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:31,699 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-23 14:06:31,699 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) (assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false;) [2018-12-23 14:06:31,699 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-23 14:06:31,699 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:32,393 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:32,394 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:32,395 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:32,395 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:32,395 WARN L224 ngHoareTripleChecker]: Pre: {134#(= c_~n 5)} [2018-12-23 14:06:32,396 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-23 14:06:32,396 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-23 14:06:32,396 WARN L230 ngHoareTripleChecker]: Post: {135#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:32,397 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:32,397 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:32,398 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:32,404 WARN L270 ngHoareTripleChecker]: Pre: {134#(= ~n 5)} [2018-12-23 14:06:32,405 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-23 14:06:32,405 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-23 14:06:32,409 WARN L276 ngHoareTripleChecker]: Post: {135#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:32,410 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:32,410 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:32,411 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-23 14:06:32,411 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) (assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1;) [2018-12-23 14:06:32,412 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-23 14:06:32,412 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:33,069 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:33,070 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:33,071 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:33,071 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:33,071 WARN L224 ngHoareTripleChecker]: Pre: {139#(= c_~n 5)} [2018-12-23 14:06:33,071 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-23 14:06:33,071 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-23 14:06:33,072 WARN L230 ngHoareTripleChecker]: Post: {140#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:33,072 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:33,073 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:33,073 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:33,076 WARN L270 ngHoareTripleChecker]: Pre: {139#(= ~n 5)} [2018-12-23 14:06:33,076 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-23 14:06:33,077 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-23 14:06:33,086 WARN L276 ngHoareTripleChecker]: Post: {140#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:33,087 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:33,087 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:33,087 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-23 14:06:33,088 WARN L628 ntHoareTripleChecker]: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) (assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1;) [2018-12-23 14:06:33,088 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-23 14:06:33,088 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:33,092 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-12-23 14:06:33,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-23 14:06:33,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-23 14:06:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:06:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:06:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-23 14:06:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:06:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-12-23 14:06:33,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2018-12-23 14:06:33,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:33,211 INFO L225 Difference]: With dead ends: 11 [2018-12-23 14:06:33,211 INFO L226 Difference]: Without dead ends: 9 [2018-12-23 14:06:33,212 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 [2018-12-23 14:06:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-23 14:06:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-23 14:06:33,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:06:33,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 8 states. [2018-12-23 14:06:33,231 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 8 states. [2018-12-23 14:06:33,232 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 8 states. [2018-12-23 14:06:33,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:33,233 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2018-12-23 14:06:33,233 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2018-12-23 14:06:33,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:33,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:33,234 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 9 states. [2018-12-23 14:06:33,234 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 9 states. [2018-12-23 14:06:33,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:33,235 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2018-12-23 14:06:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2018-12-23 14:06:33,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:33,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:33,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:06:33,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:06:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-23 14:06:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-23 14:06:33,238 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2018-12-23 14:06:33,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:06:33,238 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-23 14:06:33,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-23 14:06:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-23 14:06:33,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-23 14:06:33,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:06:33,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-23 14:06:33,240 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:06:33,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:06:33,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1948270601, now seen corresponding path program 1 times [2018-12-23 14:06:33,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:06:33,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:33,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:06:33,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:33,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:06:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:33,324 INFO L273 TraceCheckUtils]: 0: Hoare triple {175#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {177#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:33,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {177#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {178#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:33,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {178#(<= 3 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {176#false} is VALID [2018-12-23 14:06:33,327 INFO L273 TraceCheckUtils]: 3: Hoare triple {176#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {176#false} is VALID [2018-12-23 14:06:33,328 INFO L273 TraceCheckUtils]: 4: Hoare triple {176#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {176#false} is VALID [2018-12-23 14:06:33,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {176#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {176#false} is VALID [2018-12-23 14:06:33,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {176#false} assume !false; {176#false} is VALID [2018-12-23 14:06:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-23 14:06:33,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:33,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:06:33,330 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-23 14:06:33,331 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22] [2018-12-23 14:06:33,334 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-23 14:06:33,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-23 14:06:33,487 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-23 14:06:33,487 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 1 different actions 3 times. Never widened. Performed 82 root evaluator evaluations with a maximum evaluation depth of 4. Performed 82 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-23 14:06:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:06:33,488 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-23 14:06:33,785 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 28.89% of their original sizes. [2018-12-23 14:06:33,809 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2018-12-23 14:06:33,878 INFO L420 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2018-12-23 14:06:33,908 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-23 14:06:33,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-23 14:06:33,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2018-12-23 14:06:33,909 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:06:33,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-12-23 14:06:33,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:06:33,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-12-23 14:06:33,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:33,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-23 14:06:33,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-23 14:06:33,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-23 14:06:33,927 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2018-12-23 14:06:33,941 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:33,941 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:33,941 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:33,942 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:33,942 WARN L224 ngHoareTripleChecker]: Pre: {238#true} [2018-12-23 14:06:33,942 WARN L228 ngHoareTripleChecker]: Action: ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; [2018-12-23 14:06:33,942 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2018-12-23 14:06:33,943 WARN L230 ngHoareTripleChecker]: Post: {239#(and (= c_ULTIMATE.start_SelectionSort_~rh~4 0) (= c_ULTIMATE.start_SelectionSort_~i~4 1) (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:33,943 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:33,943 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:33,943 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:33,951 WARN L270 ngHoareTripleChecker]: Pre: {238#true} [2018-12-23 14:06:33,951 WARN L274 ngHoareTripleChecker]: Action: ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; [2018-12-23 14:06:33,951 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2018-12-23 14:06:33,965 WARN L276 ngHoareTripleChecker]: Post: {239#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:33,966 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:33,966 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:33,967 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, ~n, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, ~n, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-23 14:06:33,968 WARN L628 ntHoareTripleChecker]: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) (~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4;) [2018-12-23 14:06:33,968 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-23 14:06:33,968 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:34,688 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:34,688 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:34,688 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:34,689 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:34,689 WARN L224 ngHoareTripleChecker]: Pre: {240#true} [2018-12-23 14:06:34,689 WARN L228 ngHoareTripleChecker]: Action: ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; [2018-12-23 14:06:34,689 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2018-12-23 14:06:34,689 WARN L230 ngHoareTripleChecker]: Post: {241#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:34,689 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:34,690 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:34,690 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:34,696 WARN L270 ngHoareTripleChecker]: Pre: {240#true} [2018-12-23 14:06:34,697 WARN L274 ngHoareTripleChecker]: Action: ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; [2018-12-23 14:06:34,697 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) [2018-12-23 14:06:34,701 WARN L276 ngHoareTripleChecker]: Post: {241#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:34,701 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:34,701 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:34,702 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, ~n, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, ~n, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-23 14:06:34,702 WARN L628 ntHoareTripleChecker]: (and (= (store (store (store (store (store c_~array 0 0) 1 0) 2 0) 3 0) 4 0) c_~array_primed) (= c_ULTIMATE.start_main_~i~7_primed 4) (= c_~n_primed 5)) (~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4;) [2018-12-23 14:06:34,702 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-23 14:06:34,703 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:34,723 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:34,724 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:34,724 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:34,724 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:34,724 WARN L224 ngHoareTripleChecker]: Pre: {246#(= c_~n 5)} [2018-12-23 14:06:34,725 WARN L228 ngHoareTripleChecker]: Action: assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; [2018-12-23 14:06:34,725 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~lh~4_primed 0) (not (<= 0 c_ULTIMATE.start_main_~i~7))) [2018-12-23 14:06:34,725 WARN L230 ngHoareTripleChecker]: Post: {247#(and (= c_ULTIMATE.start_SelectionSort_~rh~4 0) (= c_ULTIMATE.start_SelectionSort_~i~4 1) (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:34,725 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:34,726 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:34,726 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:34,728 WARN L270 ngHoareTripleChecker]: Pre: {246#(= ~n 5)} [2018-12-23 14:06:34,729 WARN L274 ngHoareTripleChecker]: Action: assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; [2018-12-23 14:06:34,729 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~lh~4_primed 0) (not (<= 0 c_ULTIMATE.start_main_~i~7))) [2018-12-23 14:06:34,742 WARN L276 ngHoareTripleChecker]: Post: {247#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:34,742 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:34,742 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:34,743 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-23 14:06:34,743 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start_SelectionSort_~lh~4_primed 0) (not (<= 0 c_ULTIMATE.start_main_~i~7))) (assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0;) [2018-12-23 14:06:34,744 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-23 14:06:34,744 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:34,754 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:34,754 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:34,755 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:34,755 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:34,755 WARN L224 ngHoareTripleChecker]: Pre: {250#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:34,755 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-23 14:06:34,755 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-23 14:06:34,755 WARN L230 ngHoareTripleChecker]: Post: {251#false} [2018-12-23 14:06:34,755 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:34,756 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:34,756 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:34,761 WARN L270 ngHoareTripleChecker]: Pre: {250#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:34,761 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-23 14:06:34,762 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-23 14:06:34,763 WARN L276 ngHoareTripleChecker]: Post: {251#false} [2018-12-23 14:06:34,763 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:34,763 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:34,764 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2018-12-23 14:06:34,764 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) (assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1;) [2018-12-23 14:06:34,764 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-23 14:06:34,764 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:34,792 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:34,793 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:34,793 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:34,793 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:34,794 WARN L224 ngHoareTripleChecker]: Pre: {258#(and (= c_ULTIMATE.start_SelectionSort_~rh~4 0) (= c_ULTIMATE.start_SelectionSort_~i~4 1) (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:34,794 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-23 14:06:34,794 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-23 14:06:34,795 WARN L230 ngHoareTripleChecker]: Post: {259#false} [2018-12-23 14:06:34,795 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:34,795 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:34,796 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:34,808 WARN L270 ngHoareTripleChecker]: Pre: {258#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:34,809 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-23 14:06:34,809 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-23 14:06:34,810 WARN L276 ngHoareTripleChecker]: Post: {259#false} [2018-12-23 14:06:34,810 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:34,810 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:34,810 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ULTIMATE.start_SelectionSort_~i~4 = 1; ~n = 5; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ULTIMATE.start_SelectionSort_~i~4 = 1; ~n = 5; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2018-12-23 14:06:34,811 WARN L628 ntHoareTripleChecker]: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) (assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1;) [2018-12-23 14:06:34,811 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-23 14:06:34,811 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:34,849 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:34,849 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:34,849 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:34,850 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:34,850 WARN L224 ngHoareTripleChecker]: Pre: {272#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:34,850 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; [2018-12-23 14:06:34,851 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) [2018-12-23 14:06:34,851 WARN L230 ngHoareTripleChecker]: Post: {273#false} [2018-12-23 14:06:34,851 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:34,852 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:34,852 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:34,860 WARN L270 ngHoareTripleChecker]: Pre: {272#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:34,860 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; [2018-12-23 14:06:34,860 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) [2018-12-23 14:06:34,868 WARN L276 ngHoareTripleChecker]: Post: {273#false} [2018-12-23 14:06:34,868 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:34,868 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:34,868 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0 , }} [2018-12-23 14:06:34,869 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start_SelectionSort_~temp~4_primed (select c_~array c_ULTIMATE.start_SelectionSort_~lh~4)) (not (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n)) (= c_ULTIMATE.start_SelectionSort_~lh~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1)) (= (store (store c_~array c_ULTIMATE.start_SelectionSort_~lh~4 (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) c_ULTIMATE.start_SelectionSort_~rh~4 c_ULTIMATE.start_SelectionSort_~temp~4_primed) c_~array_primed)) (assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0;) [2018-12-23 14:06:34,869 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-23 14:06:34,869 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:35,068 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:35,068 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:35,068 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:35,069 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:35,069 WARN L224 ngHoareTripleChecker]: Pre: {283#(= c_~n 5)} [2018-12-23 14:06:35,069 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-23 14:06:35,069 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-23 14:06:35,069 WARN L230 ngHoareTripleChecker]: Post: {284#false} [2018-12-23 14:06:35,069 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:35,070 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:35,070 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:35,072 WARN L270 ngHoareTripleChecker]: Pre: {283#(= ~n 5)} [2018-12-23 14:06:35,072 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-23 14:06:35,072 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-23 14:06:35,081 WARN L276 ngHoareTripleChecker]: Post: {284#false} [2018-12-23 14:06:35,081 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:35,081 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:35,082 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-23 14:06:35,082 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) (assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false;) [2018-12-23 14:06:35,082 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: BOTTOM (FIXED) , Exp: BOTTOM (FIXED) , }} [2018-12-23 14:06:35,082 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:35,113 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:35,113 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:35,113 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:35,114 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:35,114 WARN L224 ngHoareTripleChecker]: Pre: {285#(= c_~n 5)} [2018-12-23 14:06:35,114 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-23 14:06:35,114 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-23 14:06:35,115 WARN L230 ngHoareTripleChecker]: Post: {286#(and (= c_ULTIMATE.start_SelectionSort_~rh~4 0) (= c_ULTIMATE.start_SelectionSort_~i~4 1) (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:35,115 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:35,116 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:35,116 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:35,121 WARN L270 ngHoareTripleChecker]: Pre: {285#(= ~n 5)} [2018-12-23 14:06:35,121 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-23 14:06:35,122 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-23 14:06:35,130 WARN L276 ngHoareTripleChecker]: Post: {286#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:35,131 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:35,131 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:35,132 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-23 14:06:35,132 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) (assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false;) [2018-12-23 14:06:35,132 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-23 14:06:35,133 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:35,792 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:35,792 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:35,792 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:35,793 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:35,793 WARN L224 ngHoareTripleChecker]: Pre: {287#(= c_~n 5)} [2018-12-23 14:06:35,793 WARN L228 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-23 14:06:35,793 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-23 14:06:35,794 WARN L230 ngHoareTripleChecker]: Post: {288#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:35,794 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:35,794 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:35,794 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:35,834 WARN L270 ngHoareTripleChecker]: Pre: {287#(= ~n 5)} [2018-12-23 14:06:35,834 WARN L274 ngHoareTripleChecker]: Action: assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; [2018-12-23 14:06:35,834 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) [2018-12-23 14:06:35,894 WARN L276 ngHoareTripleChecker]: Post: {288#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:35,895 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:35,895 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:35,895 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-23 14:06:35,895 WARN L628 ntHoareTripleChecker]: (and (= c_ULTIMATE.start___VERIFIER_assert_~cond_primed |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed|) (= c_ULTIMATE.start_main_~i~7_primed 0) (= |c_ULTIMATE.start___VERIFIER_assert_#in~cond_primed| (ite (= (select c_ULTIMATE.start_main_~array~7 c_ULTIMATE.start_main_~i~7_primed) c_ULTIMATE.start_main_~i~7_primed) 1 0)) (= 0 c_ULTIMATE.start___VERIFIER_assert_~cond_primed) (not (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n)) (< c_ULTIMATE.start_main_~i~7_primed 5)) (assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false;) [2018-12-23 14:06:35,895 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-23 14:06:35,896 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:35,910 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:35,910 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:35,910 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:35,911 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:35,911 WARN L224 ngHoareTripleChecker]: Pre: {291#(= c_~n 5)} [2018-12-23 14:06:35,911 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-23 14:06:35,911 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-23 14:06:35,911 WARN L230 ngHoareTripleChecker]: Post: {292#(and (= c_ULTIMATE.start_SelectionSort_~rh~4 0) (= c_ULTIMATE.start_SelectionSort_~i~4 1) (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:35,911 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:35,912 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:35,912 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:35,913 WARN L270 ngHoareTripleChecker]: Pre: {291#(= ~n 5)} [2018-12-23 14:06:35,913 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-23 14:06:35,913 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-23 14:06:35,926 WARN L276 ngHoareTripleChecker]: Post: {292#(and (= ULTIMATE.start_SelectionSort_~rh~4 0) (= ULTIMATE.start_SelectionSort_~i~4 1) (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:35,926 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:35,927 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:35,927 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-23 14:06:35,927 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) (assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1;) [2018-12-23 14:06:35,927 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~i~4 = 1; ULTIMATE.start_SelectionSort_~rh~4 = 0; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-23 14:06:35,927 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:36,565 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:36,565 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:36,565 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:36,566 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:36,566 WARN L224 ngHoareTripleChecker]: Pre: {293#(= c_~n 5)} [2018-12-23 14:06:36,566 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-23 14:06:36,567 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-23 14:06:36,567 WARN L230 ngHoareTripleChecker]: Post: {294#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:36,567 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:36,568 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:36,568 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:36,569 WARN L270 ngHoareTripleChecker]: Pre: {293#(= ~n 5)} [2018-12-23 14:06:36,569 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; [2018-12-23 14:06:36,570 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) [2018-12-23 14:06:36,575 WARN L276 ngHoareTripleChecker]: Post: {294#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:36,575 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:36,575 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:36,576 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-23 14:06:36,576 WARN L628 ntHoareTripleChecker]: (and (< c_ULTIMATE.start_SelectionSort_~lh~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~lh~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~lh~4 1))) (assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1;) [2018-12-23 14:06:36,576 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-23 14:06:36,576 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:37,229 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2018-12-23 14:06:37,229 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2018-12-23 14:06:37,230 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-23 14:06:37,230 WARN L223 ngHoareTripleChecker]: -- [2018-12-23 14:06:37,230 WARN L224 ngHoareTripleChecker]: Pre: {298#(= c_~n 5)} [2018-12-23 14:06:37,230 WARN L228 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-23 14:06:37,230 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-23 14:06:37,230 WARN L230 ngHoareTripleChecker]: Post: {299#(and (= c_~n 5) (= c_ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:37,230 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-23 14:06:37,231 WARN L268 ngHoareTripleChecker]: -- [2018-12-23 14:06:37,231 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-23 14:06:37,232 WARN L270 ngHoareTripleChecker]: Pre: {298#(= ~n 5)} [2018-12-23 14:06:37,233 WARN L274 ngHoareTripleChecker]: Action: assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; [2018-12-23 14:06:37,233 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) [2018-12-23 14:06:37,249 WARN L276 ngHoareTripleChecker]: Post: {299#(and (= ~n 5) (= ULTIMATE.start_SelectionSort_~lh~4 0))} [2018-12-23 14:06:37,250 WARN L620 ntHoareTripleChecker]: -- [2018-12-23 14:06:37,250 WARN L621 ntHoareTripleChecker]: Abstract states [2018-12-23 14:06:37,250 WARN L623 ntHoareTripleChecker]: PreS: {#1{Con: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , Exp: ~n = 5; TOP: ULTIMATE.start_main_~i~7, ULTIMATE.start_SelectionSort_~i~4, ULTIMATE.start_main_~array~7, ULTIMATE.start___VERIFIER_assert_~cond, ULTIMATE.start_main_#t~post3, ULTIMATE.start_main_#t~post2, ULTIMATE.start_SelectionSort_~temp~4, old(~n), ULTIMATE.start_SelectionSort_#t~post1, ~array, old(~array), ULTIMATE.start_main_#res, ULTIMATE.start_SelectionSort_~rh~4, ULTIMATE.start___VERIFIER_assert_#in~cond, ULTIMATE.start_SelectionSort_#t~post0, ULTIMATE.start_SelectionSort_~lh~4 , }} [2018-12-23 14:06:37,250 WARN L628 ntHoareTripleChecker]: (and (< (select c_~array c_ULTIMATE.start_SelectionSort_~i~4) (select c_~array c_ULTIMATE.start_SelectionSort_~rh~4)) (< c_ULTIMATE.start_SelectionSort_~i~4 c_~n) (= c_ULTIMATE.start_SelectionSort_~rh~4_primed c_ULTIMATE.start_SelectionSort_~i~4) (= c_ULTIMATE.start_SelectionSort_~i~4_primed (+ c_ULTIMATE.start_SelectionSort_~i~4 1))) (assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1;) [2018-12-23 14:06:37,250 WARN L629 ntHoareTripleChecker]: Post: {#1{Con: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , Exp: ~n = 5; ULTIMATE.start_SelectionSort_~lh~4 = 0; , }} [2018-12-23 14:06:37,251 WARN L630 ntHoareTripleChecker]: -- [2018-12-23 14:06:37,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:37,253 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2018-12-23 14:06:37,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-23 14:06:37,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-12-23 14:06:37,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:06:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-23 14:06:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-12-23 14:06:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-23 14:06:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-12-23 14:06:37,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 18 transitions. [2018-12-23 14:06:37,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:37,321 INFO L225 Difference]: With dead ends: 14 [2018-12-23 14:06:37,322 INFO L226 Difference]: Without dead ends: 10 [2018-12-23 14:06:37,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-23 14:06:37,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-23 14:06:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-12-23 14:06:37,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:06:37,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 9 states. [2018-12-23 14:06:37,353 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 9 states. [2018-12-23 14:06:37,353 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 9 states. [2018-12-23 14:06:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:37,354 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2018-12-23 14:06:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-12-23 14:06:37,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:37,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:37,355 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 10 states. [2018-12-23 14:06:37,355 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 10 states. [2018-12-23 14:06:37,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:37,356 INFO L93 Difference]: Finished difference Result 10 states and 13 transitions. [2018-12-23 14:06:37,356 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-12-23 14:06:37,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:37,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:37,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:06:37,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:06:37,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-23 14:06:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-23 14:06:37,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 7 [2018-12-23 14:06:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:06:37,358 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-23 14:06:37,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-23 14:06:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-12-23 14:06:37,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-23 14:06:37,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:06:37,358 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-23 14:06:37,359 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:06:37,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:06:37,359 INFO L82 PathProgramCache]: Analyzing trace with hash 266915571, now seen corresponding path program 1 times [2018-12-23 14:06:37,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:06:37,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:37,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:06:37,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:37,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:06:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:37,423 INFO L273 TraceCheckUtils]: 0: Hoare triple {338#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {340#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:37,425 INFO L273 TraceCheckUtils]: 1: Hoare triple {340#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {341#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:37,426 INFO L273 TraceCheckUtils]: 2: Hoare triple {341#(<= 3 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {339#false} is VALID [2018-12-23 14:06:37,426 INFO L273 TraceCheckUtils]: 3: Hoare triple {339#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {339#false} is VALID [2018-12-23 14:06:37,427 INFO L273 TraceCheckUtils]: 4: Hoare triple {339#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {339#false} is VALID [2018-12-23 14:06:37,427 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {339#false} is VALID [2018-12-23 14:06:37,427 INFO L273 TraceCheckUtils]: 6: Hoare triple {339#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {339#false} is VALID [2018-12-23 14:06:37,428 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#false} assume !false; {339#false} is VALID [2018-12-23 14:06:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-23 14:06:37,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:37,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:06:37,429 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-23 14:06:37,430 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22], [24] [2018-12-23 14:06:37,431 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-23 14:06:37,431 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-23 14:06:37,672 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-23 14:06:37,672 INFO L272 AbstractInterpreter]: Visited 8 different actions 32 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 299 root evaluator evaluations with a maximum evaluation depth of 4. Performed 299 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-23 14:06:37,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:06:37,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-23 14:06:37,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:37,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-23 14:06:37,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:06:37,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-23 14:06:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:37,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-23 14:06:37,858 INFO L273 TraceCheckUtils]: 0: Hoare triple {338#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {340#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:37,873 INFO L273 TraceCheckUtils]: 1: Hoare triple {340#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {341#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:37,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {341#(<= 3 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {339#false} is VALID [2018-12-23 14:06:37,883 INFO L273 TraceCheckUtils]: 3: Hoare triple {339#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {339#false} is VALID [2018-12-23 14:06:37,883 INFO L273 TraceCheckUtils]: 4: Hoare triple {339#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {339#false} is VALID [2018-12-23 14:06:37,883 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {339#false} is VALID [2018-12-23 14:06:37,883 INFO L273 TraceCheckUtils]: 6: Hoare triple {339#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {339#false} is VALID [2018-12-23 14:06:37,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#false} assume !false; {339#false} is VALID [2018-12-23 14:06:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-23 14:06:37,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-23 14:06:38,017 INFO L273 TraceCheckUtils]: 7: Hoare triple {339#false} assume !false; {339#false} is VALID [2018-12-23 14:06:38,017 INFO L273 TraceCheckUtils]: 6: Hoare triple {339#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {339#false} is VALID [2018-12-23 14:06:38,017 INFO L273 TraceCheckUtils]: 5: Hoare triple {339#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {339#false} is VALID [2018-12-23 14:06:38,018 INFO L273 TraceCheckUtils]: 4: Hoare triple {339#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {339#false} is VALID [2018-12-23 14:06:38,018 INFO L273 TraceCheckUtils]: 3: Hoare triple {339#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {339#false} is VALID [2018-12-23 14:06:38,019 INFO L273 TraceCheckUtils]: 2: Hoare triple {381#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {339#false} is VALID [2018-12-23 14:06:38,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {385#(< 0 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {381#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,020 INFO L273 TraceCheckUtils]: 0: Hoare triple {338#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {385#(< 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-23 14:06:38,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-23 14:06:38,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-23 14:06:38,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-23 14:06:38,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-23 14:06:38,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:06:38,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-23 14:06:38,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:38,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-23 14:06:38,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-23 14:06:38,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-23 14:06:38,055 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 4 states. [2018-12-23 14:06:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:38,112 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2018-12-23 14:06:38,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-23 14:06:38,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-23 14:06:38,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:06:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:06:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-23 14:06:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:06:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-23 14:06:38,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2018-12-23 14:06:38,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:38,232 INFO L225 Difference]: With dead ends: 16 [2018-12-23 14:06:38,233 INFO L226 Difference]: Without dead ends: 10 [2018-12-23 14:06:38,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-23 14:06:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-23 14:06:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-23 14:06:38,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:06:38,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2018-12-23 14:06:38,250 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2018-12-23 14:06:38,251 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2018-12-23 14:06:38,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:38,252 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-12-23 14:06:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-23 14:06:38,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:38,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:38,254 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2018-12-23 14:06:38,254 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2018-12-23 14:06:38,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:38,255 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-12-23 14:06:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-23 14:06:38,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:38,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:38,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:06:38,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:06:38,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-23 14:06:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-23 14:06:38,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-12-23 14:06:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:06:38,257 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-23 14:06:38,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-23 14:06:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-23 14:06:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-23 14:06:38,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:06:38,258 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-23 14:06:38,258 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:06:38,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:06:38,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1192626986, now seen corresponding path program 2 times [2018-12-23 14:06:38,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:06:38,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:38,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:06:38,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:38,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:06:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:38,339 INFO L273 TraceCheckUtils]: 0: Hoare triple {455#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {457#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {457#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {458#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,342 INFO L273 TraceCheckUtils]: 2: Hoare triple {458#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {459#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,343 INFO L273 TraceCheckUtils]: 3: Hoare triple {459#(<= 2 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {456#false} is VALID [2018-12-23 14:06:38,343 INFO L273 TraceCheckUtils]: 4: Hoare triple {456#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {456#false} is VALID [2018-12-23 14:06:38,344 INFO L273 TraceCheckUtils]: 5: Hoare triple {456#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {456#false} is VALID [2018-12-23 14:06:38,344 INFO L273 TraceCheckUtils]: 6: Hoare triple {456#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {456#false} is VALID [2018-12-23 14:06:38,344 INFO L273 TraceCheckUtils]: 7: Hoare triple {456#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {456#false} is VALID [2018-12-23 14:06:38,345 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#false} assume !false; {456#false} is VALID [2018-12-23 14:06:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-23 14:06:38,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:38,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:06:38,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-23 14:06:38,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-23 14:06:38,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:38,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-23 14:06:38,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-23 14:06:38,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-23 14:06:38,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-23 14:06:38,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-23 14:06:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:38,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-23 14:06:38,452 INFO L273 TraceCheckUtils]: 0: Hoare triple {455#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {457#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,453 INFO L273 TraceCheckUtils]: 1: Hoare triple {457#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {458#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,454 INFO L273 TraceCheckUtils]: 2: Hoare triple {458#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {459#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,459 INFO L273 TraceCheckUtils]: 3: Hoare triple {459#(<= 2 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {456#false} is VALID [2018-12-23 14:06:38,459 INFO L273 TraceCheckUtils]: 4: Hoare triple {456#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {456#false} is VALID [2018-12-23 14:06:38,459 INFO L273 TraceCheckUtils]: 5: Hoare triple {456#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {456#false} is VALID [2018-12-23 14:06:38,460 INFO L273 TraceCheckUtils]: 6: Hoare triple {456#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {456#false} is VALID [2018-12-23 14:06:38,460 INFO L273 TraceCheckUtils]: 7: Hoare triple {456#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {456#false} is VALID [2018-12-23 14:06:38,460 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#false} assume !false; {456#false} is VALID [2018-12-23 14:06:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-23 14:06:38,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-23 14:06:38,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {456#false} assume !false; {456#false} is VALID [2018-12-23 14:06:38,520 INFO L273 TraceCheckUtils]: 7: Hoare triple {456#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {456#false} is VALID [2018-12-23 14:06:38,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {456#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {456#false} is VALID [2018-12-23 14:06:38,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {456#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {456#false} is VALID [2018-12-23 14:06:38,520 INFO L273 TraceCheckUtils]: 4: Hoare triple {456#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {456#false} is VALID [2018-12-23 14:06:38,522 INFO L273 TraceCheckUtils]: 3: Hoare triple {502#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {456#false} is VALID [2018-12-23 14:06:38,523 INFO L273 TraceCheckUtils]: 2: Hoare triple {506#(< 0 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {502#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,524 INFO L273 TraceCheckUtils]: 1: Hoare triple {459#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {506#(< 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,525 INFO L273 TraceCheckUtils]: 0: Hoare triple {455#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {459#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-23 14:06:38,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-23 14:06:38,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2018-12-23 14:06:38,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-23 14:06:38,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-23 14:06:38,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:06:38,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-12-23 14:06:38,553 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:38,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-23 14:06:38,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-23 14:06:38,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-23 14:06:38,554 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-12-23 14:06:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:38,702 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-23 14:06:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-23 14:06:38,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-23 14:06:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:06:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-23 14:06:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-12-23 14:06:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-23 14:06:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-12-23 14:06:38,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 17 transitions. [2018-12-23 14:06:38,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:38,732 INFO L225 Difference]: With dead ends: 17 [2018-12-23 14:06:38,732 INFO L226 Difference]: Without dead ends: 11 [2018-12-23 14:06:38,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-23 14:06:38,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-23 14:06:38,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-23 14:06:38,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:06:38,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2018-12-23 14:06:38,753 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2018-12-23 14:06:38,753 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2018-12-23 14:06:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:38,754 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-23 14:06:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-23 14:06:38,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:38,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:38,755 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2018-12-23 14:06:38,755 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2018-12-23 14:06:38,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:38,757 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-23 14:06:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-23 14:06:38,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:38,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:38,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:06:38,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:06:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-23 14:06:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-23 14:06:38,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-12-23 14:06:38,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:06:38,759 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-23 14:06:38,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-23 14:06:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-23 14:06:38,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-23 14:06:38,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:06:38,760 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-12-23 14:06:38,760 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:06:38,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:06:38,761 INFO L82 PathProgramCache]: Analyzing trace with hash -175090221, now seen corresponding path program 3 times [2018-12-23 14:06:38,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:06:38,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:38,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-23 14:06:38,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:38,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:06:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:38,865 INFO L273 TraceCheckUtils]: 0: Hoare triple {585#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {587#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,866 INFO L273 TraceCheckUtils]: 1: Hoare triple {587#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {588#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {588#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {589#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,868 INFO L273 TraceCheckUtils]: 3: Hoare triple {589#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {590#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,869 INFO L273 TraceCheckUtils]: 4: Hoare triple {590#(<= 1 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {586#false} is VALID [2018-12-23 14:06:38,870 INFO L273 TraceCheckUtils]: 5: Hoare triple {586#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {586#false} is VALID [2018-12-23 14:06:38,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {586#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {586#false} is VALID [2018-12-23 14:06:38,871 INFO L273 TraceCheckUtils]: 7: Hoare triple {586#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {586#false} is VALID [2018-12-23 14:06:38,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {586#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {586#false} is VALID [2018-12-23 14:06:38,871 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#false} assume !false; {586#false} is VALID [2018-12-23 14:06:38,872 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-23 14:06:38,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:38,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:06:38,873 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-23 14:06:38,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-23 14:06:38,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:38,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-23 14:06:38,882 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-23 14:06:38,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-23 14:06:38,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-23 14:06:38,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-23 14:06:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:38,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-23 14:06:38,957 INFO L273 TraceCheckUtils]: 0: Hoare triple {585#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {587#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {587#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {588#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {588#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {589#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,960 INFO L273 TraceCheckUtils]: 3: Hoare triple {589#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {590#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:38,961 INFO L273 TraceCheckUtils]: 4: Hoare triple {590#(<= 1 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {586#false} is VALID [2018-12-23 14:06:38,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {586#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {586#false} is VALID [2018-12-23 14:06:38,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {586#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {586#false} is VALID [2018-12-23 14:06:38,962 INFO L273 TraceCheckUtils]: 7: Hoare triple {586#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {586#false} is VALID [2018-12-23 14:06:38,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {586#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {586#false} is VALID [2018-12-23 14:06:38,963 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#false} assume !false; {586#false} is VALID [2018-12-23 14:06:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-23 14:06:38,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-23 14:06:39,047 INFO L273 TraceCheckUtils]: 9: Hoare triple {586#false} assume !false; {586#false} is VALID [2018-12-23 14:06:39,048 INFO L273 TraceCheckUtils]: 8: Hoare triple {586#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {586#false} is VALID [2018-12-23 14:06:39,048 INFO L273 TraceCheckUtils]: 7: Hoare triple {586#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {586#false} is VALID [2018-12-23 14:06:39,048 INFO L273 TraceCheckUtils]: 6: Hoare triple {586#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {586#false} is VALID [2018-12-23 14:06:39,049 INFO L273 TraceCheckUtils]: 5: Hoare triple {586#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {586#false} is VALID [2018-12-23 14:06:39,050 INFO L273 TraceCheckUtils]: 4: Hoare triple {636#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {586#false} is VALID [2018-12-23 14:06:39,050 INFO L273 TraceCheckUtils]: 3: Hoare triple {590#(<= 1 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {636#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,051 INFO L273 TraceCheckUtils]: 2: Hoare triple {589#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {590#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,052 INFO L273 TraceCheckUtils]: 1: Hoare triple {588#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {589#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,052 INFO L273 TraceCheckUtils]: 0: Hoare triple {585#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {588#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-23 14:06:39,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-23 14:06:39,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2018-12-23 14:06:39,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-23 14:06:39,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-23 14:06:39,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:06:39,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-23 14:06:39,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:39,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-23 14:06:39,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-23 14:06:39,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-23 14:06:39,087 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2018-12-23 14:06:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:39,184 INFO L93 Difference]: Finished difference Result 18 states and 22 transitions. [2018-12-23 14:06:39,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-23 14:06:39,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-23 14:06:39,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:06:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-23 14:06:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-12-23 14:06:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-23 14:06:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2018-12-23 14:06:39,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2018-12-23 14:06:39,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:39,240 INFO L225 Difference]: With dead ends: 18 [2018-12-23 14:06:39,240 INFO L226 Difference]: Without dead ends: 12 [2018-12-23 14:06:39,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-23 14:06:39,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-23 14:06:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-23 14:06:39,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:06:39,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-12-23 14:06:39,265 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-12-23 14:06:39,265 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-12-23 14:06:39,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:39,267 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-12-23 14:06:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-23 14:06:39,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:39,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:39,268 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-12-23 14:06:39,268 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-12-23 14:06:39,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:39,269 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-12-23 14:06:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-23 14:06:39,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:39,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:39,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:06:39,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:06:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-23 14:06:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-23 14:06:39,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2018-12-23 14:06:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:06:39,272 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-23 14:06:39,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-23 14:06:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-23 14:06:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-23 14:06:39,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:06:39,273 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-12-23 14:06:39,273 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:06:39,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:06:39,273 INFO L82 PathProgramCache]: Analyzing trace with hash 375349322, now seen corresponding path program 4 times [2018-12-23 14:06:39,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:06:39,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:39,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-23 14:06:39,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:39,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:06:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:39,421 INFO L273 TraceCheckUtils]: 0: Hoare triple {727#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {729#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {729#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {730#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {730#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {731#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,424 INFO L273 TraceCheckUtils]: 3: Hoare triple {731#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {732#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,425 INFO L273 TraceCheckUtils]: 4: Hoare triple {732#(<= 1 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {733#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,426 INFO L273 TraceCheckUtils]: 5: Hoare triple {733#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {728#false} is VALID [2018-12-23 14:06:39,426 INFO L273 TraceCheckUtils]: 6: Hoare triple {728#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {728#false} is VALID [2018-12-23 14:06:39,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {728#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {728#false} is VALID [2018-12-23 14:06:39,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {728#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {728#false} is VALID [2018-12-23 14:06:39,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {728#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {728#false} is VALID [2018-12-23 14:06:39,428 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#false} assume !false; {728#false} is VALID [2018-12-23 14:06:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-23 14:06:39,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:39,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:06:39,430 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-23 14:06:39,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-23 14:06:39,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:39,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-23 14:06:39,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:06:39,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-23 14:06:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:39,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-23 14:06:39,577 INFO L273 TraceCheckUtils]: 0: Hoare triple {727#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {729#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {729#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {730#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {730#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {731#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,581 INFO L273 TraceCheckUtils]: 3: Hoare triple {731#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {732#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,582 INFO L273 TraceCheckUtils]: 4: Hoare triple {732#(<= 1 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {733#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {733#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {728#false} is VALID [2018-12-23 14:06:39,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {728#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {728#false} is VALID [2018-12-23 14:06:39,583 INFO L273 TraceCheckUtils]: 7: Hoare triple {728#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {728#false} is VALID [2018-12-23 14:06:39,584 INFO L273 TraceCheckUtils]: 8: Hoare triple {728#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {728#false} is VALID [2018-12-23 14:06:39,584 INFO L273 TraceCheckUtils]: 9: Hoare triple {728#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {728#false} is VALID [2018-12-23 14:06:39,584 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#false} assume !false; {728#false} is VALID [2018-12-23 14:06:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-23 14:06:39,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-23 14:06:39,663 INFO L273 TraceCheckUtils]: 10: Hoare triple {728#false} assume !false; {728#false} is VALID [2018-12-23 14:06:39,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {728#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {728#false} is VALID [2018-12-23 14:06:39,665 INFO L273 TraceCheckUtils]: 8: Hoare triple {728#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {728#false} is VALID [2018-12-23 14:06:39,665 INFO L273 TraceCheckUtils]: 7: Hoare triple {728#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {728#false} is VALID [2018-12-23 14:06:39,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {728#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {728#false} is VALID [2018-12-23 14:06:39,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {733#(<= 0 ULTIMATE.start_main_~i~7)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {728#false} is VALID [2018-12-23 14:06:39,681 INFO L273 TraceCheckUtils]: 4: Hoare triple {732#(<= 1 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {733#(<= 0 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,682 INFO L273 TraceCheckUtils]: 3: Hoare triple {731#(<= 2 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {732#(<= 1 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,683 INFO L273 TraceCheckUtils]: 2: Hoare triple {730#(<= 3 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {731#(<= 2 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,684 INFO L273 TraceCheckUtils]: 1: Hoare triple {729#(<= 4 ULTIMATE.start_main_~i~7)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {730#(<= 3 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,685 INFO L273 TraceCheckUtils]: 0: Hoare triple {727#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {729#(<= 4 ULTIMATE.start_main_~i~7)} is VALID [2018-12-23 14:06:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-23 14:06:39,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-23 14:06:39,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-23 14:06:39,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-23 14:06:39,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-23 14:06:39,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:06:39,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-12-23 14:06:39,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:39,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-23 14:06:39,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-23 14:06:39,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-23 14:06:39,723 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2018-12-23 14:06:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:39,920 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-12-23 14:06:39,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-23 14:06:39,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-23 14:06:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:06:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-23 14:06:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-12-23 14:06:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-23 14:06:39,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2018-12-23 14:06:39,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 19 transitions. [2018-12-23 14:06:39,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:39,947 INFO L225 Difference]: With dead ends: 19 [2018-12-23 14:06:39,948 INFO L226 Difference]: Without dead ends: 13 [2018-12-23 14:06:39,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-23 14:06:39,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-23 14:06:40,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-23 14:06:40,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:06:40,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-12-23 14:06:40,042 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-12-23 14:06:40,042 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-12-23 14:06:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:40,044 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-23 14:06:40,044 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-23 14:06:40,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:40,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:40,045 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-12-23 14:06:40,045 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-12-23 14:06:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:40,046 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-12-23 14:06:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-23 14:06:40,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:40,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:40,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:06:40,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:06:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-23 14:06:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-23 14:06:40,048 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2018-12-23 14:06:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:06:40,049 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-23 14:06:40,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-23 14:06:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-23 14:06:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-23 14:06:40,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:06:40,050 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-12-23 14:06:40,050 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:06:40,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:06:40,050 INFO L82 PathProgramCache]: Analyzing trace with hash 259105971, now seen corresponding path program 5 times [2018-12-23 14:06:40,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:06:40,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:40,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:06:40,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:40,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:06:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:40,162 INFO L273 TraceCheckUtils]: 0: Hoare triple {881#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {881#true} is VALID [2018-12-23 14:06:40,162 INFO L273 TraceCheckUtils]: 1: Hoare triple {881#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {881#true} is VALID [2018-12-23 14:06:40,163 INFO L273 TraceCheckUtils]: 2: Hoare triple {881#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {881#true} is VALID [2018-12-23 14:06:40,163 INFO L273 TraceCheckUtils]: 3: Hoare triple {881#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {881#true} is VALID [2018-12-23 14:06:40,163 INFO L273 TraceCheckUtils]: 4: Hoare triple {881#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {881#true} is VALID [2018-12-23 14:06:40,164 INFO L273 TraceCheckUtils]: 5: Hoare triple {881#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {881#true} is VALID [2018-12-23 14:06:40,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {881#true} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {881#true} is VALID [2018-12-23 14:06:40,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {881#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {883#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ULTIMATE.start_SelectionSort_~i~4)} is VALID [2018-12-23 14:06:40,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {883#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ULTIMATE.start_SelectionSort_~i~4)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2018-12-23 14:06:40,167 INFO L273 TraceCheckUtils]: 9: Hoare triple {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {885#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ~n)} is VALID [2018-12-23 14:06:40,168 INFO L273 TraceCheckUtils]: 10: Hoare triple {885#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ~n)} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {882#false} is VALID [2018-12-23 14:06:40,168 INFO L273 TraceCheckUtils]: 11: Hoare triple {882#false} assume !false; {882#false} is VALID [2018-12-23 14:06:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-23 14:06:40,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:40,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:06:40,169 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-23 14:06:40,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-23 14:06:40,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:40,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-23 14:06:40,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-23 14:06:40,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-23 14:06:40,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-23 14:06:40,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-23 14:06:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:40,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-23 14:06:40,305 INFO L273 TraceCheckUtils]: 0: Hoare triple {881#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {889#(<= 5 ~n)} is VALID [2018-12-23 14:06:40,305 INFO L273 TraceCheckUtils]: 1: Hoare triple {889#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {889#(<= 5 ~n)} is VALID [2018-12-23 14:06:40,309 INFO L273 TraceCheckUtils]: 2: Hoare triple {889#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {889#(<= 5 ~n)} is VALID [2018-12-23 14:06:40,311 INFO L273 TraceCheckUtils]: 3: Hoare triple {889#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {889#(<= 5 ~n)} is VALID [2018-12-23 14:06:40,311 INFO L273 TraceCheckUtils]: 4: Hoare triple {889#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {889#(<= 5 ~n)} is VALID [2018-12-23 14:06:40,313 INFO L273 TraceCheckUtils]: 5: Hoare triple {889#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {889#(<= 5 ~n)} is VALID [2018-12-23 14:06:40,313 INFO L273 TraceCheckUtils]: 6: Hoare triple {889#(<= 5 ~n)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {908#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2018-12-23 14:06:40,315 INFO L273 TraceCheckUtils]: 7: Hoare triple {908#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {908#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2018-12-23 14:06:40,315 INFO L273 TraceCheckUtils]: 8: Hoare triple {908#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {908#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2018-12-23 14:06:40,319 INFO L273 TraceCheckUtils]: 9: Hoare triple {908#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {918#(and (<= ULTIMATE.start_SelectionSort_~lh~4 1) (<= 5 ~n))} is VALID [2018-12-23 14:06:40,336 INFO L273 TraceCheckUtils]: 10: Hoare triple {918#(and (<= ULTIMATE.start_SelectionSort_~lh~4 1) (<= 5 ~n))} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {882#false} is VALID [2018-12-23 14:06:40,336 INFO L273 TraceCheckUtils]: 11: Hoare triple {882#false} assume !false; {882#false} is VALID [2018-12-23 14:06:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-23 14:06:40,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-23 14:06:40,579 INFO L273 TraceCheckUtils]: 11: Hoare triple {882#false} assume !false; {882#false} is VALID [2018-12-23 14:06:40,581 INFO L273 TraceCheckUtils]: 10: Hoare triple {885#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ~n)} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {882#false} is VALID [2018-12-23 14:06:40,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {885#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 1) ~n)} is VALID [2018-12-23 14:06:40,583 INFO L273 TraceCheckUtils]: 8: Hoare triple {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2018-12-23 14:06:40,584 INFO L273 TraceCheckUtils]: 7: Hoare triple {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2018-12-23 14:06:40,585 INFO L273 TraceCheckUtils]: 6: Hoare triple {940#(< 1 ~n)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {884#(<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2018-12-23 14:06:40,586 INFO L273 TraceCheckUtils]: 5: Hoare triple {940#(< 1 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {940#(< 1 ~n)} is VALID [2018-12-23 14:06:40,587 INFO L273 TraceCheckUtils]: 4: Hoare triple {940#(< 1 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {940#(< 1 ~n)} is VALID [2018-12-23 14:06:40,587 INFO L273 TraceCheckUtils]: 3: Hoare triple {940#(< 1 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {940#(< 1 ~n)} is VALID [2018-12-23 14:06:40,588 INFO L273 TraceCheckUtils]: 2: Hoare triple {940#(< 1 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {940#(< 1 ~n)} is VALID [2018-12-23 14:06:40,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {940#(< 1 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {940#(< 1 ~n)} is VALID [2018-12-23 14:06:40,590 INFO L273 TraceCheckUtils]: 0: Hoare triple {881#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {940#(< 1 ~n)} is VALID [2018-12-23 14:06:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-23 14:06:40,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-23 14:06:40,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2018-12-23 14:06:40,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-23 14:06:40,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-23 14:06:40,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:06:40,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-23 14:06:40,654 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:40,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-23 14:06:40,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-23 14:06:40,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-23 14:06:40,655 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 8 states. [2018-12-23 14:06:40,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:40,955 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-12-23 14:06:40,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-23 14:06:40,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-23 14:06:40,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:06:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-23 14:06:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-12-23 14:06:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-23 14:06:40,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-12-23 14:06:40,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2018-12-23 14:06:41,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:41,026 INFO L225 Difference]: With dead ends: 21 [2018-12-23 14:06:41,026 INFO L226 Difference]: Without dead ends: 19 [2018-12-23 14:06:41,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2018-12-23 14:06:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-23 14:06:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-23 14:06:41,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:06:41,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-12-23 14:06:41,124 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-12-23 14:06:41,125 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-12-23 14:06:41,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:41,127 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-12-23 14:06:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2018-12-23 14:06:41,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:41,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:41,129 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-12-23 14:06:41,129 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-12-23 14:06:41,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:41,133 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-12-23 14:06:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2018-12-23 14:06:41,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:41,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:41,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:06:41,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:06:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-23 14:06:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-23 14:06:41,136 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2018-12-23 14:06:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:06:41,136 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-23 14:06:41,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-23 14:06:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2018-12-23 14:06:41,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-23 14:06:41,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:06:41,137 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1] [2018-12-23 14:06:41,140 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:06:41,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:06:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1746247989, now seen corresponding path program 6 times [2018-12-23 14:06:41,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:06:41,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:41,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-23 14:06:41,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:41,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:06:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:41,235 INFO L273 TraceCheckUtils]: 0: Hoare triple {1079#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1079#true} is VALID [2018-12-23 14:06:41,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {1079#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1079#true} is VALID [2018-12-23 14:06:41,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {1079#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1079#true} is VALID [2018-12-23 14:06:41,235 INFO L273 TraceCheckUtils]: 3: Hoare triple {1079#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1079#true} is VALID [2018-12-23 14:06:41,236 INFO L273 TraceCheckUtils]: 4: Hoare triple {1079#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1079#true} is VALID [2018-12-23 14:06:41,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {1079#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1079#true} is VALID [2018-12-23 14:06:41,236 INFO L273 TraceCheckUtils]: 6: Hoare triple {1079#true} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1079#true} is VALID [2018-12-23 14:06:41,236 INFO L273 TraceCheckUtils]: 7: Hoare triple {1079#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1079#true} is VALID [2018-12-23 14:06:41,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {1079#true} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1079#true} is VALID [2018-12-23 14:06:41,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {1079#true} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1079#true} is VALID [2018-12-23 14:06:41,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {1079#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1081#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2018-12-23 14:06:41,239 INFO L273 TraceCheckUtils]: 11: Hoare triple {1081#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1082#(<= ~n ULTIMATE.start_SelectionSort_~lh~4)} is VALID [2018-12-23 14:06:41,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {1082#(<= ~n ULTIMATE.start_SelectionSort_~lh~4)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1080#false} is VALID [2018-12-23 14:06:41,239 INFO L273 TraceCheckUtils]: 13: Hoare triple {1080#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1080#false} is VALID [2018-12-23 14:06:41,239 INFO L273 TraceCheckUtils]: 14: Hoare triple {1080#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1080#false} is VALID [2018-12-23 14:06:41,240 INFO L273 TraceCheckUtils]: 15: Hoare triple {1080#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1080#false} is VALID [2018-12-23 14:06:41,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {1080#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1080#false} is VALID [2018-12-23 14:06:41,240 INFO L273 TraceCheckUtils]: 17: Hoare triple {1080#false} assume !false; {1080#false} is VALID [2018-12-23 14:06:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-23 14:06:41,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-23 14:06:41,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-23 14:06:41,241 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:06:41,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-23 14:06:41,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:06:41,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-23 14:06:41,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:41,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-23 14:06:41,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-23 14:06:41,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-23 14:06:41,263 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 4 states. [2018-12-23 14:06:41,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:41,416 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-12-23 14:06:41,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-23 14:06:41,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-23 14:06:41,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:06:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:06:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-23 14:06:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:06:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-12-23 14:06:41,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2018-12-23 14:06:41,436 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:41,438 INFO L225 Difference]: With dead ends: 29 [2018-12-23 14:06:41,438 INFO L226 Difference]: Without dead ends: 21 [2018-12-23 14:06:41,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-23 14:06:41,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-23 14:06:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-23 14:06:41,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:06:41,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-12-23 14:06:41,516 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-12-23 14:06:41,516 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-12-23 14:06:41,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:41,517 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-12-23 14:06:41,518 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-23 14:06:41,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:41,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:41,518 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-12-23 14:06:41,519 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-12-23 14:06:41,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:41,520 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-12-23 14:06:41,520 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-23 14:06:41,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:41,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:41,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:06:41,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:06:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-23 14:06:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-23 14:06:41,522 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2018-12-23 14:06:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:06:41,522 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-23 14:06:41,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-23 14:06:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2018-12-23 14:06:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-23 14:06:41,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:06:41,523 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2018-12-23 14:06:41,524 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:06:41,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:06:41,524 INFO L82 PathProgramCache]: Analyzing trace with hash 406829563, now seen corresponding path program 7 times [2018-12-23 14:06:41,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:06:41,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:41,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-23 14:06:41,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:41,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:06:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:41,854 INFO L273 TraceCheckUtils]: 0: Hoare triple {1225#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1225#true} is VALID [2018-12-23 14:06:41,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {1225#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1225#true} is VALID [2018-12-23 14:06:41,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {1225#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1225#true} is VALID [2018-12-23 14:06:41,855 INFO L273 TraceCheckUtils]: 3: Hoare triple {1225#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1225#true} is VALID [2018-12-23 14:06:41,855 INFO L273 TraceCheckUtils]: 4: Hoare triple {1225#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1225#true} is VALID [2018-12-23 14:06:41,856 INFO L273 TraceCheckUtils]: 5: Hoare triple {1225#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1225#true} is VALID [2018-12-23 14:06:41,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {1225#true} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1225#true} is VALID [2018-12-23 14:06:41,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {1225#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1227#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2018-12-23 14:06:41,880 INFO L273 TraceCheckUtils]: 8: Hoare triple {1227#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1228#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 2))} is VALID [2018-12-23 14:06:41,882 INFO L273 TraceCheckUtils]: 9: Hoare triple {1228#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 2))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1229#(<= ~n (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2018-12-23 14:06:41,882 INFO L273 TraceCheckUtils]: 10: Hoare triple {1229#(<= ~n (+ ULTIMATE.start_SelectionSort_~lh~4 1))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1230#(<= ~n ULTIMATE.start_SelectionSort_~i~4)} is VALID [2018-12-23 14:06:41,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {1230#(<= ~n ULTIMATE.start_SelectionSort_~i~4)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1226#false} is VALID [2018-12-23 14:06:41,884 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-23 14:06:41,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-23 14:06:41,884 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1226#false} is VALID [2018-12-23 14:06:41,884 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-23 14:06:41,885 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-23 14:06:41,885 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-23 14:06:41,885 INFO L273 TraceCheckUtils]: 18: Hoare triple {1226#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1226#false} is VALID [2018-12-23 14:06:41,886 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2018-12-23 14:06:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-23 14:06:41,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:41,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:06:41,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-23 14:06:41,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-23 14:06:41,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:41,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-23 14:06:41,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:06:41,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-23 14:06:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:41,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-23 14:06:42,183 INFO L273 TraceCheckUtils]: 0: Hoare triple {1225#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1234#(<= 5 ~n)} is VALID [2018-12-23 14:06:42,192 INFO L273 TraceCheckUtils]: 1: Hoare triple {1234#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1234#(<= 5 ~n)} is VALID [2018-12-23 14:06:42,192 INFO L273 TraceCheckUtils]: 2: Hoare triple {1234#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1234#(<= 5 ~n)} is VALID [2018-12-23 14:06:42,193 INFO L273 TraceCheckUtils]: 3: Hoare triple {1234#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1234#(<= 5 ~n)} is VALID [2018-12-23 14:06:42,193 INFO L273 TraceCheckUtils]: 4: Hoare triple {1234#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1234#(<= 5 ~n)} is VALID [2018-12-23 14:06:42,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {1234#(<= 5 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1234#(<= 5 ~n)} is VALID [2018-12-23 14:06:42,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {1234#(<= 5 ~n)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1253#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} is VALID [2018-12-23 14:06:42,195 INFO L273 TraceCheckUtils]: 7: Hoare triple {1253#(and (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= 5 ~n))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1257#(and (<= ULTIMATE.start_SelectionSort_~i~4 1) (<= 5 ~n))} is VALID [2018-12-23 14:06:42,196 INFO L273 TraceCheckUtils]: 8: Hoare triple {1257#(and (<= ULTIMATE.start_SelectionSort_~i~4 1) (<= 5 ~n))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1261#(and (<= ULTIMATE.start_SelectionSort_~i~4 2) (<= 5 ~n))} is VALID [2018-12-23 14:06:42,197 INFO L273 TraceCheckUtils]: 9: Hoare triple {1261#(and (<= ULTIMATE.start_SelectionSort_~i~4 2) (<= 5 ~n))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-23 14:06:42,198 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-23 14:06:42,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {1226#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1226#false} is VALID [2018-12-23 14:06:42,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-23 14:06:42,199 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-23 14:06:42,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1226#false} is VALID [2018-12-23 14:06:42,200 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-23 14:06:42,200 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-23 14:06:42,201 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-23 14:06:42,201 INFO L273 TraceCheckUtils]: 18: Hoare triple {1226#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1226#false} is VALID [2018-12-23 14:06:42,201 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2018-12-23 14:06:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-23 14:06:42,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-23 14:06:42,297 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#false} assume !false; {1226#false} is VALID [2018-12-23 14:06:42,298 INFO L273 TraceCheckUtils]: 18: Hoare triple {1226#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1226#false} is VALID [2018-12-23 14:06:42,298 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-23 14:06:42,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-23 14:06:42,298 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-23 14:06:42,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1226#false} is VALID [2018-12-23 14:06:42,299 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-23 14:06:42,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-23 14:06:42,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {1226#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1226#false} is VALID [2018-12-23 14:06:42,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1226#false} is VALID [2018-12-23 14:06:42,300 INFO L273 TraceCheckUtils]: 9: Hoare triple {1325#(< ULTIMATE.start_SelectionSort_~i~4 ~n)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1226#false} is VALID [2018-12-23 14:06:42,301 INFO L273 TraceCheckUtils]: 8: Hoare triple {1329#(< (+ ULTIMATE.start_SelectionSort_~i~4 1) ~n)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1325#(< ULTIMATE.start_SelectionSort_~i~4 ~n)} is VALID [2018-12-23 14:06:42,302 INFO L273 TraceCheckUtils]: 7: Hoare triple {1333#(< (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1329#(< (+ ULTIMATE.start_SelectionSort_~i~4 1) ~n)} is VALID [2018-12-23 14:06:42,302 INFO L273 TraceCheckUtils]: 6: Hoare triple {1337#(< 2 ~n)} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1333#(< (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n)} is VALID [2018-12-23 14:06:42,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {1337#(< 2 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1337#(< 2 ~n)} is VALID [2018-12-23 14:06:42,303 INFO L273 TraceCheckUtils]: 4: Hoare triple {1337#(< 2 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1337#(< 2 ~n)} is VALID [2018-12-23 14:06:42,304 INFO L273 TraceCheckUtils]: 3: Hoare triple {1337#(< 2 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1337#(< 2 ~n)} is VALID [2018-12-23 14:06:42,304 INFO L273 TraceCheckUtils]: 2: Hoare triple {1337#(< 2 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1337#(< 2 ~n)} is VALID [2018-12-23 14:06:42,304 INFO L273 TraceCheckUtils]: 1: Hoare triple {1337#(< 2 ~n)} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1337#(< 2 ~n)} is VALID [2018-12-23 14:06:42,305 INFO L273 TraceCheckUtils]: 0: Hoare triple {1225#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1337#(< 2 ~n)} is VALID [2018-12-23 14:06:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-23 14:06:42,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-23 14:06:42,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2018-12-23 14:06:42,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-23 14:06:42,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-12-23 14:06:42,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:06:42,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-12-23 14:06:42,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:42,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-23 14:06:42,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-23 14:06:42,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-23 14:06:42,379 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2018-12-23 14:06:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:42,939 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2018-12-23 14:06:42,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-23 14:06:42,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-12-23 14:06:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:06:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-23 14:06:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2018-12-23 14:06:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-23 14:06:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2018-12-23 14:06:42,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 26 transitions. [2018-12-23 14:06:43,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:43,005 INFO L225 Difference]: With dead ends: 39 [2018-12-23 14:06:43,006 INFO L226 Difference]: Without dead ends: 26 [2018-12-23 14:06:43,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-12-23 14:06:43,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-23 14:06:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-23 14:06:43,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:06:43,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-12-23 14:06:43,090 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-12-23 14:06:43,090 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-12-23 14:06:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:43,091 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-12-23 14:06:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-12-23 14:06:43,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:43,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:43,091 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-12-23 14:06:43,091 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-12-23 14:06:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:43,092 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-12-23 14:06:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-12-23 14:06:43,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:43,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:43,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:06:43,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:06:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-23 14:06:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-12-23 14:06:43,094 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 20 [2018-12-23 14:06:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:06:43,095 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-12-23 14:06:43,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-23 14:06:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-12-23 14:06:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-23 14:06:43,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-23 14:06:43,095 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-12-23 14:06:43,096 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-23 14:06:43,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-23 14:06:43,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1640374485, now seen corresponding path program 8 times [2018-12-23 14:06:43,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-23 14:06:43,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:43,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-23 14:06:43,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-23 14:06:43,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-23 14:06:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:43,441 INFO L273 TraceCheckUtils]: 0: Hoare triple {1544#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1544#true} is VALID [2018-12-23 14:06:43,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-23 14:06:43,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-23 14:06:43,442 INFO L273 TraceCheckUtils]: 3: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-23 14:06:43,443 INFO L273 TraceCheckUtils]: 4: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-23 14:06:43,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-23 14:06:43,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {1544#true} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1544#true} is VALID [2018-12-23 14:06:43,444 INFO L273 TraceCheckUtils]: 7: Hoare triple {1544#true} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1546#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} is VALID [2018-12-23 14:06:43,446 INFO L273 TraceCheckUtils]: 8: Hoare triple {1546#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1547#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 2))} is VALID [2018-12-23 14:06:43,450 INFO L273 TraceCheckUtils]: 9: Hoare triple {1547#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 2))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1548#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 3))} is VALID [2018-12-23 14:06:43,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {1548#(<= ULTIMATE.start_SelectionSort_~i~4 (+ ULTIMATE.start_SelectionSort_~lh~4 3))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1549#(<= ~n (+ ULTIMATE.start_SelectionSort_~lh~4 2))} is VALID [2018-12-23 14:06:43,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {1549#(<= ~n (+ ULTIMATE.start_SelectionSort_~lh~4 2))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1550#(<= ~n (+ ULTIMATE.start_SelectionSort_~i~4 1))} is VALID [2018-12-23 14:06:43,468 INFO L273 TraceCheckUtils]: 12: Hoare triple {1550#(<= ~n (+ ULTIMATE.start_SelectionSort_~i~4 1))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1551#(<= ~n ULTIMATE.start_SelectionSort_~i~4)} is VALID [2018-12-23 14:06:43,468 INFO L273 TraceCheckUtils]: 13: Hoare triple {1551#(<= ~n ULTIMATE.start_SelectionSort_~i~4)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1545#false} is VALID [2018-12-23 14:06:43,469 INFO L273 TraceCheckUtils]: 14: Hoare triple {1545#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1545#false} is VALID [2018-12-23 14:06:43,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {1545#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1545#false} is VALID [2018-12-23 14:06:43,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {1545#false} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1545#false} is VALID [2018-12-23 14:06:43,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {1545#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1545#false} is VALID [2018-12-23 14:06:43,469 INFO L273 TraceCheckUtils]: 18: Hoare triple {1545#false} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1545#false} is VALID [2018-12-23 14:06:43,469 INFO L273 TraceCheckUtils]: 19: Hoare triple {1545#false} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1545#false} is VALID [2018-12-23 14:06:43,470 INFO L273 TraceCheckUtils]: 20: Hoare triple {1545#false} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1545#false} is VALID [2018-12-23 14:06:43,470 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#false} assume !false; {1545#false} is VALID [2018-12-23 14:06:43,471 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 28 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-23 14:06:43,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:43,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-23 14:06:43,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-23 14:06:43,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-23 14:06:43,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-23 14:06:43,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-23 14:06:43,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-23 14:06:43,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-23 14:06:43,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-23 14:06:43,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-23 14:06:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-23 14:06:43,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-23 14:06:43,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-23 14:06:43,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-23 14:06:43,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-23 14:06:43,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-12-23 14:06:43,597 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-23 14:06:43,598 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~array~7_26, v_ULTIMATE.start_main_~i~7_44]. (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (store v_ULTIMATE.start_main_~array~7_26 v_ULTIMATE.start_main_~i~7_44 v_ULTIMATE.start_main_~i~7_44) ULTIMATE.start_main_~array~7) (<= 0 v_ULTIMATE.start_main_~i~7_44)) [2018-12-23 14:06:43,598 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_ULTIMATE.start_main_~i~7_44]. (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)) [2018-12-23 14:06:43,905 INFO L273 TraceCheckUtils]: 0: Hoare triple {1544#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1544#true} is VALID [2018-12-23 14:06:43,905 INFO L273 TraceCheckUtils]: 1: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-23 14:06:43,905 INFO L273 TraceCheckUtils]: 2: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-23 14:06:43,906 INFO L273 TraceCheckUtils]: 3: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-23 14:06:43,906 INFO L273 TraceCheckUtils]: 4: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-23 14:06:43,907 INFO L273 TraceCheckUtils]: 5: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1570#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-23 14:06:43,907 INFO L273 TraceCheckUtils]: 6: Hoare triple {1570#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-23 14:06:43,908 INFO L273 TraceCheckUtils]: 7: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-23 14:06:43,909 INFO L273 TraceCheckUtils]: 8: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-23 14:06:43,909 INFO L273 TraceCheckUtils]: 9: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-23 14:06:43,910 INFO L273 TraceCheckUtils]: 10: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-23 14:06:43,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-23 14:06:43,913 INFO L273 TraceCheckUtils]: 12: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-23 14:06:43,914 INFO L273 TraceCheckUtils]: 13: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-23 14:06:43,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-23 14:06:43,915 INFO L273 TraceCheckUtils]: 15: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-23 14:06:43,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-23 14:06:43,916 INFO L273 TraceCheckUtils]: 17: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-23 14:06:43,916 INFO L273 TraceCheckUtils]: 18: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-23 14:06:43,917 INFO L273 TraceCheckUtils]: 19: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} is VALID [2018-12-23 14:06:43,917 INFO L273 TraceCheckUtils]: 20: Hoare triple {1574#(exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1545#false} is VALID [2018-12-23 14:06:43,917 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#false} assume !false; {1545#false} is VALID [2018-12-23 14:06:43,921 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-23 14:06:43,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-23 14:06:43,996 INFO L273 TraceCheckUtils]: 21: Hoare triple {1545#false} assume !false; {1545#false} is VALID [2018-12-23 14:06:43,999 INFO L273 TraceCheckUtils]: 20: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !(SelectionSort_~lh~4 < ~n);main_~i~7 := 0;assume !!(main_~i~7 < 5);__VERIFIER_assert_#in~cond := (if main_~array~7[main_~i~7] == main_~i~7 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1545#false} is VALID [2018-12-23 14:06:43,999 INFO L273 TraceCheckUtils]: 19: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-23 14:06:44,000 INFO L273 TraceCheckUtils]: 18: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-23 14:06:44,001 INFO L273 TraceCheckUtils]: 17: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-23 14:06:44,001 INFO L273 TraceCheckUtils]: 16: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-23 14:06:44,001 INFO L273 TraceCheckUtils]: 15: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-23 14:06:44,002 INFO L273 TraceCheckUtils]: 14: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-23 14:06:44,002 INFO L273 TraceCheckUtils]: 13: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-23 14:06:44,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-23 14:06:44,003 INFO L273 TraceCheckUtils]: 11: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-23 14:06:44,003 INFO L273 TraceCheckUtils]: 10: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !(SelectionSort_~i~4 < ~n);SelectionSort_~temp~4 := ~array[SelectionSort_~lh~4];~array := ~array[SelectionSort_~lh~4 := ~array[SelectionSort_~rh~4]];~array := ~array[SelectionSort_~rh~4 := SelectionSort_~temp~4];SelectionSort_#t~post0 := SelectionSort_~lh~4;SelectionSort_~lh~4 := SelectionSort_#t~post0 + 1;havoc SelectionSort_#t~post0; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-23 14:06:44,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-23 14:06:44,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~i~4 < ~n);assume ~array[SelectionSort_~i~4] < ~array[SelectionSort_~rh~4];SelectionSort_~rh~4 := SelectionSort_~i~4;SelectionSort_#t~post1 := SelectionSort_~i~4;SelectionSort_~i~4 := SelectionSort_#t~post1 + 1;havoc SelectionSort_#t~post1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-23 14:06:44,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} assume !!(SelectionSort_~lh~4 < ~n);SelectionSort_~rh~4 := SelectionSort_~lh~4;SelectionSort_~i~4 := SelectionSort_~lh~4 + 1; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-23 14:06:44,006 INFO L273 TraceCheckUtils]: 6: Hoare triple {1666#(or (<= 0 ULTIMATE.start_main_~i~7) (= (select ULTIMATE.start_main_~array~7 0) 0))} assume !(main_~i~7 >= 0);havoc SelectionSort_#t~post1, SelectionSort_#t~post0, SelectionSort_~lh~4, SelectionSort_~rh~4, SelectionSort_~i~4, SelectionSort_~temp~4;havoc SelectionSort_~lh~4;havoc SelectionSort_~rh~4;havoc SelectionSort_~i~4;havoc SelectionSort_~temp~4;SelectionSort_~lh~4 := 0; {1623#(= (select ULTIMATE.start_main_~array~7 0) 0)} is VALID [2018-12-23 14:06:44,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1666#(or (<= 0 ULTIMATE.start_main_~i~7) (= (select ULTIMATE.start_main_~array~7 0) 0))} is VALID [2018-12-23 14:06:44,007 INFO L273 TraceCheckUtils]: 4: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-23 14:06:44,008 INFO L273 TraceCheckUtils]: 3: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-23 14:06:44,008 INFO L273 TraceCheckUtils]: 2: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-23 14:06:44,008 INFO L273 TraceCheckUtils]: 1: Hoare triple {1544#true} assume !!(main_~i~7 >= 0);main_~array~7 := main_~array~7[main_~i~7 := main_~i~7];main_#t~post2 := main_~i~7;main_~i~7 := main_#t~post2 - 1;havoc main_#t~post2; {1544#true} is VALID [2018-12-23 14:06:44,009 INFO L273 TraceCheckUtils]: 0: Hoare triple {1544#true} ~array := ~array[0 := 0];~array := ~array[1 := 0];~array := ~array[2 := 0];~array := ~array[3 := 0];~array := ~array[4 := 0];~n := 5;havoc main_#res;havoc main_#t~post2, main_#t~post3, main_~array~7, main_~i~7;havoc main_~array~7;havoc main_~i~7;main_~i~7 := 4; {1544#true} is VALID [2018-12-23 14:06:44,011 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-23 14:06:44,039 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-23 14:06:44,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2018-12-23 14:06:44,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-23 14:06:44,039 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-23 14:06:44,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-23 14:06:44,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-23 14:06:44,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:44,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-23 14:06:44,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-23 14:06:44,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-12-23 14:06:44,057 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2018-12-23 14:06:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:44,333 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-12-23 14:06:44,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-23 14:06:44,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-23 14:06:44,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-23 14:06:44,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:06:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-23 14:06:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-23 14:06:44,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-12-23 14:06:44,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 9 transitions. [2018-12-23 14:06:44,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-23 14:06:44,376 INFO L225 Difference]: With dead ends: 26 [2018-12-23 14:06:44,376 INFO L226 Difference]: Without dead ends: 0 [2018-12-23 14:06:44,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-12-23 14:06:44,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-23 14:06:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-23 14:06:44,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-23 14:06:44,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-12-23 14:06:44,378 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-23 14:06:44,378 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-23 14:06:44,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:44,379 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-23 14:06:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-23 14:06:44,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:44,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:44,379 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-23 14:06:44,379 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-23 14:06:44,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-23 14:06:44,379 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-23 14:06:44,379 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-23 14:06:44,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:44,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-23 14:06:44,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-23 14:06:44,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-23 14:06:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-23 14:06:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-23 14:06:44,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-12-23 14:06:44,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-23 14:06:44,380 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-23 14:06:44,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-23 14:06:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-23 14:06:44,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-23 14:06:44,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-23 14:06:44,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-23 14:06:44,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-23 14:06:44,634 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2018-12-23 14:06:44,811 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-12-23 14:06:44,823 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2018-12-23 14:06:44,823 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2018-12-23 14:06:44,824 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2018-12-23 14:06:44,824 INFO L444 ceAbstractionStarter]: At program point L98(lines 74 98) the Hoare annotation is: (let ((.cse4 (+ ULTIMATE.start_SelectionSort_~lh~4 1))) (let ((.cse0 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse1 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse2 (<= .cse4 ULTIMATE.start_SelectionSort_~i~4)) (.cse3 (= ~n 5))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_SelectionSort_~i~4 .cse4) (<= .cse4 ~n)) (and .cse0 .cse1 .cse2 .cse3 (<= (+ ULTIMATE.start_SelectionSort_~lh~4 2) ~n))))) [2018-12-23 14:06:44,824 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2018-12-23 14:06:44,824 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 5 99) no Hoare annotation was computed. [2018-12-23 14:06:44,824 INFO L444 ceAbstractionStarter]: At program point L90(lines 46 90) the Hoare annotation is: (let ((.cse0 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= v_ULTIMATE.start_main_~i~7_44 0) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse1 (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44)))) (.cse2 (= ~n 5)) (.cse3 (+ ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse4 (<= ~n ULTIMATE.start_SelectionSort_~i~4))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_SelectionSort_~lh~4 0)) (and .cse0 .cse1 .cse2 (<= .cse3 ~n) .cse4) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_SelectionSort_~i~4 .cse3) .cse4))) [2018-12-23 14:06:44,825 INFO L444 ceAbstractionStarter]: At program point L53(lines 32 53) the Hoare annotation is: (let ((.cse0 (= ~n 5))) (or (and (<= 4 ULTIMATE.start_main_~i~7) .cse0) (and (exists ((v_ULTIMATE.start_main_~i~7_44 Int)) (and (<= v_ULTIMATE.start_main_~i~7_44 (+ ULTIMATE.start_main_~i~7 1)) (= (select ULTIMATE.start_main_~array~7 v_ULTIMATE.start_main_~i~7_44) v_ULTIMATE.start_main_~i~7_44) (<= 0 v_ULTIMATE.start_main_~i~7_44))) .cse0))) [2018-12-23 14:06:44,826 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-23 14:06:44,833 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2018-12-23 14:06:44,836 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-23 14:06:44,849 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 02:06:44 BoogieIcfgContainer [2018-12-23 14:06:44,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-23 14:06:44,851 INFO L168 Benchmark]: Toolchain (without parser) took 17216.63 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 805.8 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -620.6 MB). Peak memory consumption was 185.2 MB. Max. memory is 7.1 GB. [2018-12-23 14:06:44,852 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-23 14:06:44,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-23 14:06:44,853 INFO L168 Benchmark]: Boogie Preprocessor took 34.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-23 14:06:44,853 INFO L168 Benchmark]: RCFGBuilder took 589.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-23 14:06:44,854 INFO L168 Benchmark]: TraceAbstraction took 16534.86 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 805.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -652.4 MB). Peak memory consumption was 153.5 MB. Max. memory is 7.1 GB. [2018-12-23 14:06:44,858 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 589.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16534.86 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 805.8 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -652.4 MB). Peak memory consumption was 153.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 76]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && ~n == 5) && SelectionSort_~lh~4 == 0) || (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && ~n == 5) && SelectionSort_~lh~4 + 1 <= ~n) && ~n <= SelectionSort_~i~4)) || (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && ~n == 5) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && ~n <= SelectionSort_~i~4) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (4 <= main_~i~7 && ~n == 5) || ((exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44) && ~n == 5) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && ~n == 5) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && SelectionSort_~lh~4 + 1 <= ~n) || (((((exists v_ULTIMATE.start_main_~i~7_44 : int :: (main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44 && v_ULTIMATE.start_main_~i~7_44 <= 0) && 0 <= v_ULTIMATE.start_main_~i~7_44) && (exists v_ULTIMATE.start_main_~i~7_44 : int :: (v_ULTIMATE.start_main_~i~7_44 <= main_~i~7 + 1 && main_~array~7[v_ULTIMATE.start_main_~i~7_44] == v_ULTIMATE.start_main_~i~7_44) && 0 <= v_ULTIMATE.start_main_~i~7_44)) && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && ~n == 5) && SelectionSort_~lh~4 + 2 <= ~n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 16.4s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 9.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 62 SDtfs, 51 SDslu, 87 SDs, 0 SdLazy, 143 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 158 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 3 AbstIntIterations, 2 AbstIntStrong, -0.7066666666666667 AbsIntWeakeningRatio, 2.4 AbsIntAvgWeakeningVarsNumRemoved, 0.4 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s 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.6s 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...