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/insertion_sort.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-27 12:54:53,662 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-27 12:54:53,664 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-27 12:54:53,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-27 12:54:53,676 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-27 12:54:53,677 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-27 12:54:53,678 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-27 12:54:53,680 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-27 12:54:53,682 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-27 12:54:53,683 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-27 12:54:53,684 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-27 12:54:53,684 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-27 12:54:53,685 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-27 12:54:53,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-27 12:54:53,688 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-27 12:54:53,689 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-27 12:54:53,689 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-27 12:54:53,692 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-27 12:54:53,694 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-27 12:54:53,699 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-27 12:54:53,700 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-27 12:54:53,702 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-27 12:54:53,706 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-27 12:54:53,707 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-27 12:54:53,707 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-27 12:54:53,708 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-27 12:54:53,713 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-27 12:54:53,715 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-27 12:54:53,716 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-27 12:54:53,717 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-27 12:54:53,717 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-27 12:54:53,718 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-27 12:54:53,718 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-27 12:54:53,718 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-27 12:54:53,719 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-27 12:54:53,720 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-27 12:54:53,720 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-27 12:54:53,738 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-27 12:54:53,738 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-27 12:54:53,739 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-27 12:54:53,739 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-27 12:54:53,739 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-27 12:54:53,740 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-27 12:54:53,740 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-27 12:54:53,740 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-27 12:54:53,740 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-27 12:54:53,740 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-27 12:54:53,741 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-27 12:54:53,741 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-27 12:54:53,741 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-27 12:54:53,741 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-27 12:54:53,742 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-27 12:54:53,742 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-27 12:54:53,742 INFO L133 SettingsManager]: * Use SBE=true [2019-02-27 12:54:53,743 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-27 12:54:53,743 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-27 12:54:53,743 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-27 12:54:53,743 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-27 12:54:53,743 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-27 12:54:53,744 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-27 12:54:53,744 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-27 12:54:53,744 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-27 12:54:53,744 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-27 12:54:53,744 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-27 12:54:53,745 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-27 12:54:53,745 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-27 12:54:53,745 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-27 12:54:53,745 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-27 12:54:53,745 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-27 12:54:53,746 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-27 12:54:53,746 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-27 12:54:53,746 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-27 12:54:53,746 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-27 12:54:53,746 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-27 12:54:53,746 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-27 12:54:53,747 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-27 12:54:53,747 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-27 12:54:53,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-27 12:54:53,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-27 12:54:53,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-27 12:54:53,808 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-27 12:54:53,809 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-27 12:54:53,809 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/insertion_sort.i_3.bpl [2019-02-27 12:54:53,810 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/insertion_sort.i_3.bpl' [2019-02-27 12:54:53,858 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-27 12:54:53,859 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-27 12:54:53,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-27 12:54:53,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-27 12:54:53,860 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-27 12:54:53,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,889 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-27 12:54:53,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-27 12:54:53,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-27 12:54:53,898 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-27 12:54:53,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,915 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... [2019-02-27 12:54:53,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-27 12:54:53,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-27 12:54:53,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-27 12:54:53,920 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-27 12:54:53,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-27 12:54:53,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-27 12:54:53,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-27 12:54:54,385 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-27 12:54:54,385 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-02-27 12:54:54,387 INFO L202 PluginConnector]: Adding new model insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 12:54:54 BoogieIcfgContainer [2019-02-27 12:54:54,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-27 12:54:54,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-27 12:54:54,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-27 12:54:54,391 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-27 12:54:54,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:54:53" (1/2) ... [2019-02-27 12:54:54,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17486f1e and model type insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.02 12:54:54, skipping insertion in model container [2019-02-27 12:54:54,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 12:54:54" (2/2) ... [2019-02-27 12:54:54,395 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort.i_3.bpl [2019-02-27 12:54:54,414 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-27 12:54:54,424 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-27 12:54:54,441 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-27 12:54:54,478 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-27 12:54:54,478 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-27 12:54:54,479 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-27 12:54:54,479 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-27 12:54:54,479 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-27 12:54:54,479 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-27 12:54:54,479 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-27 12:54:54,479 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-27 12:54:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-27 12:54:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-27 12:54:54,501 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:54:54,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-27 12:54:54,505 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:54:54,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:54:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-27 12:54:54,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:54:54,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:54,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:54:54,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:54,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:54:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:54:54,864 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_~SIZE~5, main_~i~5, main_~j~5, main_~k~5, main_~key~5, main_~v~5;main_~SIZE~5 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~5;havoc main_~j~5;havoc main_~k~5;havoc main_~key~5;havoc main_~v~5;main_~j~5 := 1; {11#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} is VALID [2019-02-27 12:54:54,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~k~5 := 1;assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~5] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10#false} is VALID [2019-02-27 12:54:54,873 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !false; {10#false} is VALID [2019-02-27 12:54:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:54:54,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:54:54,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-27 12:54:54,878 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:54:54,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-27 12:54:54,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:54:54,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-27 12:54:54,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:54:54,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-27 12:54:54,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-27 12:54:54,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 12:54:54,929 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-27 12:54:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:55,016 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-27 12:54:55,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-27 12:54:55,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-27 12:54:55,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:54:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:54:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-02-27 12:54:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:54:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-02-27 12:54:55,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2019-02-27 12:54:55,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:54:55,094 INFO L225 Difference]: With dead ends: 9 [2019-02-27 12:54:55,094 INFO L226 Difference]: Without dead ends: 5 [2019-02-27 12:54:55,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 12:54:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-27 12:54:55,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-27 12:54:55,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:54:55,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-02-27 12:54:55,190 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-27 12:54:55,190 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-27 12:54:55,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:55,192 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-27 12:54:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-27 12:54:55,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:55,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:54:55,193 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-27 12:54:55,193 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-27 12:54:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:55,194 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-27 12:54:55,194 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-27 12:54:55,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:55,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:54:55,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:54:55,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:54:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-27 12:54:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-27 12:54:55,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-27 12:54:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:54:55,199 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-27 12:54:55,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-27 12:54:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-27 12:54:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-27 12:54:55,199 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:54:55,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-27 12:54:55,200 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:54:55,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:54:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-02-27 12:54:55,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:54:55,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:55,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:54:55,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:54:55,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:54:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:54:55,709 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_~SIZE~5, main_~i~5, main_~j~5, main_~k~5, main_~key~5, main_~v~5;main_~SIZE~5 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~5;havoc main_~j~5;havoc main_~k~5;havoc main_~key~5;havoc main_~v~5;main_~j~5 := 1; {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} is VALID [2019-02-27 12:54:55,719 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~key~5 := main_~v~5[main_~j~5];main_~i~5 := main_~j~5 - 1;assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5);main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-02-27 12:54:55,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~k~5 := 1;assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~5] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2019-02-27 12:54:55,733 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-02-27 12:54:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:54:55,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:54:55,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:54:55,735 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-27 12:54:55,737 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-02-27 12:54:55,773 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-27 12:54:55,774 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 12:54:56,027 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-27 12:54:56,029 INFO L272 AbstractInterpreter]: Visited 4 different actions 13 times. Merged at 3 different actions 9 times. Widened at 1 different actions 1 times. Performed 214 root evaluator evaluations with a maximum evaluation depth of 5. Performed 214 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-27 12:54:56,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:54:56,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-27 12:54:56,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:54:56,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-27 12:54:56,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:54:56,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 12:54:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:54:56,085 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-27 12:54:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:54:56,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:54:56,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:54:56,348 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 20 [2019-02-27 12:54:56,352 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-27 12:54:56,379 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-27 12:54:56,379 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2019-02-27 12:54:56,393 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:54:56,394 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~v~5_7, ULTIMATE.start_main_~i~5, ULTIMATE.start_main_~key~5]. (and (not (< ULTIMATE.start_main_~key~5 (select v_ULTIMATE.start_main_~v~5_7 ULTIMATE.start_main_~i~5))) (<= 0 ULTIMATE.start_main_~i~5) (= (store v_ULTIMATE.start_main_~v~5_7 (+ ULTIMATE.start_main_~i~5 1) ULTIMATE.start_main_~key~5) ULTIMATE.start_main_~v~5) (<= ULTIMATE.start_main_~i~5 0)) [2019-02-27 12:54:56,394 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~i~5]. (and (<= (select ULTIMATE.start_main_~v~5 ULTIMATE.start_main_~i~5) (select ULTIMATE.start_main_~v~5 (+ ULTIMATE.start_main_~i~5 1))) (<= 0 ULTIMATE.start_main_~i~5) (<= ULTIMATE.start_main_~i~5 0)) [2019-02-27 12:54:56,512 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_~SIZE~5, main_~i~5, main_~j~5, main_~k~5, main_~key~5, main_~v~5;main_~SIZE~5 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~5;havoc main_~j~5;havoc main_~k~5;havoc main_~key~5;havoc main_~v~5;main_~j~5 := 1; {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} is VALID [2019-02-27 12:54:56,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~key~5 := main_~v~5[main_~j~5];main_~i~5 := main_~j~5 - 1;assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5);main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-02-27 12:54:56,514 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~k~5 := 1;assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~5] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2019-02-27 12:54:56,515 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-02-27 12:54:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:54:56,516 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:54:56,868 WARN L296 Elim1Store]: Array PQE input equivalent to true [2019-02-27 12:54:56,872 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-27 12:54:56,873 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:54:57,040 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-27 12:54:57,065 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2019-02-27 12:54:57,138 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-27 12:54:57,208 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:54:57,283 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-27 12:54:57,291 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2019-02-27 12:54:57,298 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-27 12:54:57,308 INFO L301 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:54:57,314 INFO L301 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:54:57,623 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-27 12:54:57,662 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-27 12:54:57,671 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-27 12:54:57,723 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 28 [2019-02-27 12:54:57,755 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2019-02-27 12:54:57,789 INFO L301 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:54:57,892 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-27 12:54:57,898 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-27 12:54:57,910 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2019-02-27 12:54:57,930 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2019-02-27 12:54:57,942 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:54:57,950 INFO L301 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:54:57,954 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:54:57,955 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:39, output treesize:3 [2019-02-27 12:54:57,959 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:54:57,959 WARN L398 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~v~5, v_ULTIMATE.start_main_~key~5_5, v_prenex_2, v_prenex_3]. (and (or (let ((.cse0 (store ULTIMATE.start_main_~v~5 ULTIMATE.start_main_~j~5 v_ULTIMATE.start_main_~key~5_5))) (<= (select .cse0 0) (select .cse0 1))) (< v_ULTIMATE.start_main_~key~5_5 (select ULTIMATE.start_main_~v~5 (+ ULTIMATE.start_main_~j~5 (- 1))))) (or (<= 1 ULTIMATE.start_main_~j~5) (let ((.cse1 (store v_prenex_2 ULTIMATE.start_main_~j~5 v_prenex_3))) (<= (select .cse1 0) (select .cse1 1))))) [2019-02-27 12:54:57,960 WARN L399 uantifierElimination]: ElimStorePlain result: ∀ []. (= ULTIMATE.start_main_~j~5 1) [2019-02-27 12:54:57,963 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-02-27 12:54:57,965 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} assume !(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~k~5 := 1;assume !!(main_~k~5 % 4294967296 < main_~SIZE~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~v~5[main_~k~5 - 1] <= main_~v~5[main_~k~5] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2019-02-27 12:54:57,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} assume !!(main_~j~5 % 4294967296 < main_~SIZE~5 % 4294967296);main_~key~5 := main_~v~5[main_~j~5];main_~i~5 := main_~j~5 - 1;assume !(main_~i~5 >= 0 && main_~v~5[main_~i~5] > main_~key~5);main_~v~5 := main_~v~5[main_~i~5 + 1 := main_~key~5];main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {48#(<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1))} is VALID [2019-02-27 12:54:57,969 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_#t~post2, main_~SIZE~5, main_~i~5, main_~j~5, main_~k~5, main_~key~5, main_~v~5;main_~SIZE~5 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~5;havoc main_~j~5;havoc main_~k~5;havoc main_~key~5;havoc main_~v~5;main_~j~5 := 1; {47#(and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))} is VALID [2019-02-27 12:54:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:54:57,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 12:54:57,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2019-02-27 12:54:57,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 12:54:57,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-27 12:54:57,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:54:57,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-27 12:54:58,000 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:54:58,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-27 12:54:58,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-27 12:54:58,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-27 12:54:58,001 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-02-27 12:54:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:58,037 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-27 12:54:58,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:54:58,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-27 12:54:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:54:58,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:54:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-02-27 12:54:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-27 12:54:58,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2019-02-27 12:54:58,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5 transitions. [2019-02-27 12:54:58,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:54:58,050 INFO L225 Difference]: With dead ends: 5 [2019-02-27 12:54:58,050 INFO L226 Difference]: Without dead ends: 0 [2019-02-27 12:54:58,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-27 12:54:58,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-27 12:54:58,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-27 12:54:58,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:54:58,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-27 12:54:58,052 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-27 12:54:58,053 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-27 12:54:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:58,053 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-27 12:54:58,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 12:54:58,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:58,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:54:58,054 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-27 12:54:58,054 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-27 12:54:58,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:54:58,055 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-27 12:54:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 12:54:58,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:58,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:54:58,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:54:58,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:54:58,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-27 12:54:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-27 12:54:58,056 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-02-27 12:54:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:54:58,056 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-27 12:54:58,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-27 12:54:58,056 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-27 12:54:58,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:54:58,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-27 12:54:58,135 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 56) no Hoare annotation was computed. [2019-02-27 12:54:58,135 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 55) no Hoare annotation was computed. [2019-02-27 12:54:58,135 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 56) no Hoare annotation was computed. [2019-02-27 12:54:58,135 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 56) no Hoare annotation was computed. [2019-02-27 12:54:58,136 INFO L444 ceAbstractionStarter]: At program point L42(lines 42 54) the Hoare annotation is: false [2019-02-27 12:54:58,136 INFO L444 ceAbstractionStarter]: At program point L53(lines 26 53) the Hoare annotation is: (or (<= (select ULTIMATE.start_main_~v~5 0) (select ULTIMATE.start_main_~v~5 1)) (and (<= 1 ULTIMATE.start_main_~j~5) (<= ULTIMATE.start_main_~j~5 1))) [2019-02-27 12:54:58,137 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-02-27 12:54:58,139 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-27 12:54:58,140 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-02-27 12:54:58,140 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-02-27 12:54:58,140 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-02-27 12:54:58,144 INFO L202 PluginConnector]: Adding new model insertion_sort.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.02 12:54:58 BoogieIcfgContainer [2019-02-27 12:54:58,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-27 12:54:58,146 INFO L168 Benchmark]: Toolchain (without parser) took 4287.56 ms. Allocated memory was 108.0 MB in the beginning and 179.3 MB in the end (delta: 71.3 MB). Free memory was 75.2 MB in the beginning and 92.9 MB in the end (delta: -17.7 MB). Peak memory consumption was 53.6 MB. Max. memory is 7.1 GB. [2019-02-27 12:54:58,147 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 108.0 MB. Free memory is still 76.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-27 12:54:58,148 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.09 ms. Allocated memory is still 108.0 MB. Free memory was 75.0 MB in the beginning and 73.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-02-27 12:54:58,149 INFO L168 Benchmark]: Boogie Preprocessor took 21.52 ms. Allocated memory is still 108.0 MB. Free memory was 73.4 MB in the beginning and 72.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-27 12:54:58,150 INFO L168 Benchmark]: RCFGBuilder took 467.75 ms. Allocated memory is still 108.0 MB. Free memory was 72.2 MB in the beginning and 62.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-02-27 12:54:58,151 INFO L168 Benchmark]: TraceAbstraction took 3756.67 ms. Allocated memory was 108.0 MB in the beginning and 179.3 MB in the end (delta: 71.3 MB). Free memory was 61.7 MB in the beginning and 92.9 MB in the end (delta: -31.2 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. [2019-02-27 12:54:58,155 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.18 ms. Allocated memory is still 108.0 MB. Free memory is still 76.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.09 ms. Allocated memory is still 108.0 MB. Free memory was 75.0 MB in the beginning and 73.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.52 ms. Allocated memory is still 108.0 MB. Free memory was 73.4 MB in the beginning and 72.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 467.75 ms. Allocated memory is still 108.0 MB. Free memory was 72.2 MB in the beginning and 62.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3756.67 ms. Allocated memory was 108.0 MB in the beginning and 179.3 MB in the end (delta: 71.3 MB). Free memory was 61.7 MB in the beginning and 92.9 MB in the end (delta: -31.2 MB). Peak memory consumption was 40.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 55]: 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: 42]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main_~v~5[0] <= main_~v~5[1] || (1 <= main_~j~5 && main_~j~5 <= 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 3.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4 SDtfs, 0 SDslu, 1 SDs, 0 SdLazy, 8 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 3 NumberOfFragments, 16 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 151 SizeOfPredicates, 7 NumberOfNonLiveVariables, 26 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...