java -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_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 14:37:01,633 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:37:01,635 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:37:01,647 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:37:01,647 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:37:01,649 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:37:01,650 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:37:01,652 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:37:01,654 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:37:01,655 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:37:01,656 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:37:01,656 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:37:01,658 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:37:01,659 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:37:01,660 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:37:01,661 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:37:01,662 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:37:01,664 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:37:01,667 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:37:01,669 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:37:01,670 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:37:01,672 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:37:01,674 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:37:01,675 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:37:01,675 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:37:01,676 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:37:01,678 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:37:01,679 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:37:01,679 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:37:01,681 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:37:01,681 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:37:01,682 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:37:01,682 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:37:01,683 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:37:01,684 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:37:01,685 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:37:01,685 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-11 14:37:01,699 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:37:01,699 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:37:01,700 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:37:01,700 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:37:01,701 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:37:01,701 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:37:01,701 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:37:01,701 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:37:01,701 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:37:01,702 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-11 14:37:01,702 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-11 14:37:01,702 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:37:01,702 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:37:01,703 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:37:01,703 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:37:01,704 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:37:01,704 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:37:01,704 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:37:01,704 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:37:01,704 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:37:01,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:37:01,705 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:37:01,705 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:37:01,705 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:37:01,706 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:37:01,706 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:37:01,706 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:37:01,706 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:37:01,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:37:01,707 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:37:01,707 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:37:01,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:37:01,707 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:37:01,708 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:37:01,708 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:37:01,708 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:37:01,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:37:01,708 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:37:01,709 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:37:01,745 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:37:01,763 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:37:01,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:37:01,770 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:37:01,771 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:37:01,772 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl [2019-01-11 14:37:01,772 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2019-01-11 14:37:01,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:37:01,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:37:01,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:37:01,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:37:01,835 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:37:01,853 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,865 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:37:01,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:37:01,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:37:01,881 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:37:01,893 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,894 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,896 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,897 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,904 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,907 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,908 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 11.01 02:37:01" (1/1) ... [2019-01-11 14:37:01,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:37:01,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:37:01,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:37:01,916 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:37:01,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:37:01" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 14:37:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 14:37:01,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 14:37:02,205 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-01-11 14:37:02,207 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 14:37:02,207 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-11 14:37:02,209 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:37:02 BoogieIcfgContainer [2019-01-11 14:37:02,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:37:02,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:37:02,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:37:02,215 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:37:02,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:37:01" (1/2) ... [2019-01-11 14:37:02,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@344b3cc0 and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:37:02, skipping insertion in model container [2019-01-11 14:37:02,217 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 11.01 02:37:02" (2/2) ... [2019-01-11 14:37:02,219 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2019-01-11 14:37:02,230 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:37:02,239 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 14:37:02,264 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 14:37:02,305 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:37:02,305 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:37:02,306 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:37:02,306 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:37:02,306 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:37:02,306 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:37:02,306 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:37:02,306 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:37:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-11 14:37:02,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:37:02,335 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:37:02,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:37:02,339 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:37:02,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:37:02,349 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-11 14:37:02,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:37:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:37:02,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:37:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:37:02,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:37:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:37:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:37:02,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:37:02,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:37:02,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:37:02,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:37:02,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:37:02,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:37:02,571 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-11 14:37:02,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:37:02,640 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-01-11 14:37:02,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:37:02,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-11 14:37:02,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:37:02,655 INFO L225 Difference]: With dead ends: 11 [2019-01-11 14:37:02,655 INFO L226 Difference]: Without dead ends: 7 [2019-01-11 14:37:02,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:37:02,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-11 14:37:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-11 14:37:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-11 14:37:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-11 14:37:02,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2019-01-11 14:37:02,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:37:02,694 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-11 14:37:02,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:37:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-01-11 14:37:02,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:37:02,695 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:37:02,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:37:02,696 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:37:02,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:37:02,697 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2019-01-11 14:37:02,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:37:02,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:37:02,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:37:02,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:37:02,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:37:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:37:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:37:02,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:37:02,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:37:02,859 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:37:02,861 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2019-01-11 14:37:02,943 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:37:02,944 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:37:08,799 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-11 14:37:08,803 INFO L272 AbstractInterpreter]: Visited 4 different actions 14 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:37:08,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:37:08,809 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-11 14:37:08,969 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 38.89% of their original sizes. [2019-01-11 14:37:08,970 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-11 14:37:09,034 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-11 14:37:09,035 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-11 14:37:09,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 14:37:09,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-01-11 14:37:09,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:37:09,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:37:09,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:37:09,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:37:09,038 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2019-01-11 14:37:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:37:09,377 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-01-11 14:37:09,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:37:09,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 14:37:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:37:09,379 INFO L225 Difference]: With dead ends: 11 [2019-01-11 14:37:09,379 INFO L226 Difference]: Without dead ends: 9 [2019-01-11 14:37:09,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 14:37:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-11 14:37:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-11 14:37:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 14:37:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-11 14:37:09,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-01-11 14:37:09,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:37:09,385 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-11 14:37:09,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:37:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-01-11 14:37:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:37:09,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:37:09,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:37:09,386 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:37:09,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:37:09,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1948270601, now seen corresponding path program 1 times [2019-01-11 14:37:09,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:37:09,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:37:09,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:37:09,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:37:09,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:37:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:37:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:37:09,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:37:09,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:37:09,539 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:37:09,540 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22] [2019-01-11 14:37:09,541 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-11 14:37:09,542 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:37:12,634 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-11 14:37:12,634 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 14:37:12,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:37:12,634 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-11 14:37:12,818 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 30.56% of their original sizes. [2019-01-11 14:37:12,819 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-11 14:37:14,221 INFO L420 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2019-01-11 14:37:14,222 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-11 14:37:14,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-11 14:37:14,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [3] total 7 [2019-01-11 14:37:14,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:37:14,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:37:14,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:37:14,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-11 14:37:14,224 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 6 states. [2019-01-11 14:37:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:37:17,244 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-01-11 14:37:17,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:37:17,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-01-11 14:37:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:37:17,245 INFO L225 Difference]: With dead ends: 9 [2019-01-11 14:37:17,245 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 14:37:17,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:37:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 14:37:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 14:37:17,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 14:37:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 14:37:17,247 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-01-11 14:37:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:37:17,248 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 14:37:17,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:37:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 14:37:17,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 14:37:17,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 14:37:17,703 WARN L181 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2019-01-11 14:37:22,431 WARN L181 SmtUtils]: Spent 4.63 s on a formula simplification. DAG size of input: 130 DAG size of output: 130 [2019-01-11 14:37:22,434 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2019-01-11 14:37:22,435 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2019-01-11 14:37:22,435 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2019-01-11 14:37:22,436 INFO L444 ceAbstractionStarter]: At program point L98(lines 74 98) the Hoare annotation is: (and (forall ((v_idx_63 Int) (v_idx_61 Int) (v_idx_62 Int)) (exists ((v_v_628_2 Int) (v_v_630_2 Int)) (let ((.cse0 (* 2 ~n)) (.cse2 (* 2 ULTIMATE.start_main_~i~7)) (.cse1 (+ ULTIMATE.start_main_~i~7 ~n))) (and (<= .cse0 10) (<= 10 .cse0) (or (<= ~n (+ v_idx_61 5)) (= v_v_628_2 (select ~array v_idx_61))) (<= ~n (+ ULTIMATE.start_main_~i~7 6)) (<= .cse1 9) (<= (+ ULTIMATE.start_main_~i~7 1) ~n) (or (< (+ v_idx_62 5) ~n) (<= 10 (+ v_idx_62 ~n)) (= ~n (+ (select ~array v_idx_62) 5))) (<= 0 (+ .cse2 2)) (<= .cse2 8) (or (= v_v_630_2 (select ~array v_idx_63)) (< (+ v_idx_63 ~n) 10)) (<= 4 .cse1))))) (forall ((v_idx_72 Int) (v_idx_70 Int) (v_idx_71 Int)) (exists ((v_v_628_2 Int) (v_v_630_2 Int)) (let ((.cse5 (+ ULTIMATE.start_SelectionSort_~lh~4 5)) (.cse4 (+ ULTIMATE.start_SelectionSort_~rh~4 1)) (.cse7 (+ ULTIMATE.start_SelectionSort_~rh~4 5)) (.cse9 (* 2 ~n)) (.cse11 (+ ULTIMATE.start_SelectionSort_~i~4 4)) (.cse6 (+ ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse12 (+ ULTIMATE.start_SelectionSort_~lh~4 ULTIMATE.start_SelectionSort_~rh~4)) (.cse16 (+ ULTIMATE.start_SelectionSort_~lh~4 ULTIMATE.start_SelectionSort_~i~4)) (.cse3 (* 2 ULTIMATE.start_SelectionSort_~rh~4)) (.cse14 (+ ULTIMATE.start_SelectionSort_~i~4 ULTIMATE.start_SelectionSort_~rh~4)) (.cse8 (* 2 ULTIMATE.start_SelectionSort_~lh~4)) (.cse15 (+ ULTIMATE.start_SelectionSort_~lh~4 ~n)) (.cse13 (+ ULTIMATE.start_SelectionSort_~i~4 ~n)) (.cse17 (* 2 ULTIMATE.start_SelectionSort_~i~4)) (.cse10 (+ ULTIMATE.start_SelectionSort_~rh~4 ~n))) (and (<= .cse3 0) (<= .cse4 ULTIMATE.start_SelectionSort_~i~4) (<= 0 ULTIMATE.start_SelectionSort_~rh~4) (<= ~n .cse5) (<= ULTIMATE.start_SelectionSort_~i~4 .cse6) (or (<= 0 (+ v_idx_70 ULTIMATE.start_SelectionSort_~rh~4)) (= v_v_628_2 (select ~array v_idx_70))) (<= .cse7 ~n) (<= .cse5 ~n) (<= ULTIMATE.start_SelectionSort_~i~4 .cse4) (<= .cse8 0) (<= .cse9 10) (<= 5 .cse10) (<= ULTIMATE.start_SelectionSort_~rh~4 0) (<= ~n .cse11) (<= ULTIMATE.start_SelectionSort_~i~4 1) (<= 0 .cse12) (<= .cse13 6) (<= .cse14 1) (<= ~n .cse7) (<= 5 .cse15) (<= .cse16 1) (<= 10 .cse9) (<= 1 ULTIMATE.start_SelectionSort_~i~4) (<= .cse11 ~n) (<= .cse6 ULTIMATE.start_SelectionSort_~i~4) (<= .cse17 2) (<= ULTIMATE.start_SelectionSort_~lh~4 ULTIMATE.start_SelectionSort_~rh~4) (<= 5 ~n) (<= .cse12 0) (<= 1 .cse16) (<= 0 .cse3) (<= ~n 5) (<= 1 .cse14) (<= ULTIMATE.start_SelectionSort_~rh~4 ULTIMATE.start_SelectionSort_~lh~4) (or (<= 5 v_idx_71) (< (+ v_idx_71 ULTIMATE.start_SelectionSort_~rh~4) 0) (= 0 (+ ULTIMATE.start_SelectionSort_~rh~4 (select ~array v_idx_71)))) (<= 0 ULTIMATE.start_SelectionSort_~lh~4) (<= 0 .cse8) (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= .cse15 5) (<= 6 .cse13) (<= 2 .cse17) (<= .cse10 5) (or (< v_idx_72 5) (= v_v_630_2 (select ~array v_idx_72)))))))) [2019-01-11 14:37:22,436 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2019-01-11 14:37:22,437 INFO L444 ceAbstractionStarter]: At program point L90(lines 46 90) the Hoare annotation is: (and (<= 0 (* 2 ULTIMATE.start_SelectionSort_~lh~4)) (<= (+ ULTIMATE.start_SelectionSort_~lh~4 ~n) 5) (forall ((v_idx_63 Int) (v_idx_61 Int) (v_idx_62 Int)) (exists ((v_v_628_2 Int) (v_v_630_2 Int)) (let ((.cse0 (* 2 ~n)) (.cse2 (* 2 ULTIMATE.start_main_~i~7)) (.cse1 (+ ULTIMATE.start_main_~i~7 ~n))) (and (<= .cse0 10) (<= 10 .cse0) (or (<= ~n (+ v_idx_61 5)) (= v_v_628_2 (select ~array v_idx_61))) (<= ~n (+ ULTIMATE.start_main_~i~7 6)) (<= .cse1 9) (<= (+ ULTIMATE.start_main_~i~7 1) ~n) (or (< (+ v_idx_62 5) ~n) (<= 10 (+ v_idx_62 ~n)) (= ~n (+ (select ~array v_idx_62) 5))) (<= 0 (+ .cse2 2)) (<= .cse2 8) (or (= v_v_630_2 (select ~array v_idx_63)) (< (+ v_idx_63 ~n) 10)) (<= 4 .cse1)))))) [2019-01-11 14:37:22,437 INFO L444 ceAbstractionStarter]: At program point L53(lines 32 53) the Hoare annotation is: (forall ((v_idx_63 Int) (v_idx_61 Int) (v_idx_62 Int)) (exists ((v_v_628_2 Int) (v_v_630_2 Int)) (let ((.cse0 (* 2 ~n)) (.cse2 (* 2 ULTIMATE.start_main_~i~7)) (.cse1 (+ ULTIMATE.start_main_~i~7 ~n))) (and (<= .cse0 10) (<= 10 .cse0) (or (<= ~n (+ v_idx_61 5)) (= v_v_628_2 (select ~array v_idx_61))) (<= ~n (+ ULTIMATE.start_main_~i~7 6)) (<= .cse1 9) (<= (+ ULTIMATE.start_main_~i~7 1) ~n) (or (< (+ v_idx_62 5) ~n) (<= 10 (+ v_idx_62 ~n)) (= ~n (+ (select ~array v_idx_62) 5))) (<= 0 (+ .cse2 2)) (<= .cse2 8) (or (= v_v_630_2 (select ~array v_idx_63)) (< (+ v_idx_63 ~n) 10)) (<= 4 .cse1))))) [2019-01-11 14:37:22,454 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 02:37:22 BoogieIcfgContainer [2019-01-11 14:37:22,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-11 14:37:22,455 INFO L168 Benchmark]: Toolchain (without parser) took 20622.77 ms. Allocated memory was 138.4 MB in the beginning and 827.3 MB in the end (delta: 688.9 MB). Free memory was 106.4 MB in the beginning and 649.1 MB in the end (delta: -542.7 MB). Peak memory consumption was 146.2 MB. Max. memory is 7.1 GB. [2019-01-11 14:37:22,457 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory is still 107.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 14:37:22,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.72 ms. Allocated memory is still 138.4 MB. Free memory was 106.4 MB in the beginning and 104.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-01-11 14:37:22,459 INFO L168 Benchmark]: Boogie Preprocessor took 34.13 ms. Allocated memory is still 138.4 MB. Free memory was 104.6 MB in the beginning and 103.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-01-11 14:37:22,460 INFO L168 Benchmark]: RCFGBuilder took 293.90 ms. Allocated memory is still 138.4 MB. Free memory was 103.5 MB in the beginning and 93.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-01-11 14:37:22,461 INFO L168 Benchmark]: TraceAbstraction took 20242.94 ms. Allocated memory was 138.4 MB in the beginning and 827.3 MB in the end (delta: 688.9 MB). Free memory was 92.7 MB in the beginning and 649.1 MB in the end (delta: -556.4 MB). Peak memory consumption was 132.5 MB. Max. memory is 7.1 GB. [2019-01-11 14:37:22,468 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 138.4 MB. Free memory is still 107.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.72 ms. Allocated memory is still 138.4 MB. Free memory was 106.4 MB in the beginning and 104.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.13 ms. Allocated memory is still 138.4 MB. Free memory was 104.6 MB in the beginning and 103.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 293.90 ms. Allocated memory is still 138.4 MB. Free memory was 103.5 MB in the beginning and 93.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20242.94 ms. Allocated memory was 138.4 MB in the beginning and 827.3 MB in the end (delta: 688.9 MB). Free memory was 92.7 MB in the beginning and 649.1 MB in the end (delta: -556.4 MB). Peak memory consumption was 132.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: (0 <= 2 * SelectionSort_~lh~4 && SelectionSort_~lh~4 + ~n <= 5) && (forall v_idx_63 : int, v_idx_61 : int, v_idx_62 : int :: (exists v_v_628_2 : int, v_v_630_2 : int :: (((((((((2 * ~n <= 10 && 10 <= 2 * ~n) && (~n <= v_idx_61 + 5 || v_v_628_2 == ~array[v_idx_61])) && ~n <= main_~i~7 + 6) && main_~i~7 + ~n <= 9) && main_~i~7 + 1 <= ~n) && ((v_idx_62 + 5 < ~n || 10 <= v_idx_62 + ~n) || ~n == ~array[v_idx_62] + 5)) && 0 <= 2 * main_~i~7 + 2) && 2 * main_~i~7 <= 8) && (v_v_630_2 == ~array[v_idx_63] || v_idx_63 + ~n < 10)) && 4 <= main_~i~7 + ~n)) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (forall v_idx_63 : int, v_idx_61 : int, v_idx_62 : int :: (exists v_v_628_2 : int, v_v_630_2 : int :: (((((((((2 * ~n <= 10 && 10 <= 2 * ~n) && (~n <= v_idx_61 + 5 || v_v_628_2 == ~array[v_idx_61])) && ~n <= main_~i~7 + 6) && main_~i~7 + ~n <= 9) && main_~i~7 + 1 <= ~n) && ((v_idx_62 + 5 < ~n || 10 <= v_idx_62 + ~n) || ~n == ~array[v_idx_62] + 5)) && 0 <= 2 * main_~i~7 + 2) && 2 * main_~i~7 <= 8) && (v_v_630_2 == ~array[v_idx_63] || v_idx_63 + ~n < 10)) && 4 <= main_~i~7 + ~n)) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: (forall v_idx_63 : int, v_idx_61 : int, v_idx_62 : int :: (exists v_v_628_2 : int, v_v_630_2 : int :: (((((((((2 * ~n <= 10 && 10 <= 2 * ~n) && (~n <= v_idx_61 + 5 || v_v_628_2 == ~array[v_idx_61])) && ~n <= main_~i~7 + 6) && main_~i~7 + ~n <= 9) && main_~i~7 + 1 <= ~n) && ((v_idx_62 + 5 < ~n || 10 <= v_idx_62 + ~n) || ~n == ~array[v_idx_62] + 5)) && 0 <= 2 * main_~i~7 + 2) && 2 * main_~i~7 <= 8) && (v_v_630_2 == ~array[v_idx_63] || v_idx_63 + ~n < 10)) && 4 <= main_~i~7 + ~n)) && (forall v_idx_72 : int, v_idx_70 : int, v_idx_71 : int :: (exists v_v_628_2 : int, v_v_630_2 : int :: (((((((((((((((((((((((((((((((((((((((((2 * SelectionSort_~rh~4 <= 0 && SelectionSort_~rh~4 + 1 <= SelectionSort_~i~4) && 0 <= SelectionSort_~rh~4) && ~n <= SelectionSort_~lh~4 + 5) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && (0 <= v_idx_70 + SelectionSort_~rh~4 || v_v_628_2 == ~array[v_idx_70])) && SelectionSort_~rh~4 + 5 <= ~n) && SelectionSort_~lh~4 + 5 <= ~n) && SelectionSort_~i~4 <= SelectionSort_~rh~4 + 1) && 2 * SelectionSort_~lh~4 <= 0) && 2 * ~n <= 10) && 5 <= SelectionSort_~rh~4 + ~n) && SelectionSort_~rh~4 <= 0) && ~n <= SelectionSort_~i~4 + 4) && SelectionSort_~i~4 <= 1) && 0 <= SelectionSort_~lh~4 + SelectionSort_~rh~4) && SelectionSort_~i~4 + ~n <= 6) && SelectionSort_~i~4 + SelectionSort_~rh~4 <= 1) && ~n <= SelectionSort_~rh~4 + 5) && 5 <= SelectionSort_~lh~4 + ~n) && SelectionSort_~lh~4 + SelectionSort_~i~4 <= 1) && 10 <= 2 * ~n) && 1 <= SelectionSort_~i~4) && SelectionSort_~i~4 + 4 <= ~n) && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && 2 * SelectionSort_~i~4 <= 2) && SelectionSort_~lh~4 <= SelectionSort_~rh~4) && 5 <= ~n) && SelectionSort_~lh~4 + SelectionSort_~rh~4 <= 0) && 1 <= SelectionSort_~lh~4 + SelectionSort_~i~4) && 0 <= 2 * SelectionSort_~rh~4) && ~n <= 5) && 1 <= SelectionSort_~i~4 + SelectionSort_~rh~4) && SelectionSort_~rh~4 <= SelectionSort_~lh~4) && ((5 <= v_idx_71 || v_idx_71 + SelectionSort_~rh~4 < 0) || 0 == SelectionSort_~rh~4 + ~array[v_idx_71])) && 0 <= SelectionSort_~lh~4) && 0 <= 2 * SelectionSort_~lh~4) && SelectionSort_~lh~4 <= 0) && SelectionSort_~lh~4 + ~n <= 5) && 6 <= SelectionSort_~i~4 + ~n) && 2 <= 2 * SelectionSort_~i~4) && SelectionSort_~rh~4 + ~n <= 5) && (v_idx_72 < 5 || v_v_630_2 == ~array[v_idx_72]))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 20.1s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 5.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 10 SDtfs, 12 SDslu, 5 SDs, 0 SdLazy, 6 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 9.0s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, 0.8400000000000001 AbsIntWeakeningRatio, 2.4 AbsIntAvgWeakeningVarsNumRemoved, -2.8 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 7 NumberOfFragments, 487 HoareAnnotationTreeSize, 4 FomulaSimplifications, 206 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 230 FormulaSimplificationTreeSizeReductionInter, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1/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...