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-1de736e-m [2019-02-15 11:11:25,364 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 11:11:25,366 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 11:11:25,381 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 11:11:25,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 11:11:25,382 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 11:11:25,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 11:11:25,387 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 11:11:25,389 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 11:11:25,390 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 11:11:25,391 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 11:11:25,392 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 11:11:25,396 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 11:11:25,397 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 11:11:25,398 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 11:11:25,401 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 11:11:25,402 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 11:11:25,404 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 11:11:25,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 11:11:25,410 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 11:11:25,412 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 11:11:25,415 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 11:11:25,418 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 11:11:25,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 11:11:25,419 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 11:11:25,420 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 11:11:25,421 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 11:11:25,421 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 11:11:25,422 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 11:11:25,423 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 11:11:25,423 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 11:11:25,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 11:11:25,424 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 11:11:25,425 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 11:11:25,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 11:11:25,426 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 11:11:25,427 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-02-15 11:11:25,444 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 11:11:25,444 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 11:11:25,446 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 11:11:25,447 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 11:11:25,447 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 11:11:25,447 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 11:11:25,447 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 11:11:25,448 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 11:11:25,448 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 11:11:25,448 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-15 11:11:25,448 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-15 11:11:25,448 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 11:11:25,448 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 11:11:25,449 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 11:11:25,449 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 11:11:25,450 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 11:11:25,451 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 11:11:25,451 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 11:11:25,451 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 11:11:25,451 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 11:11:25,452 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 11:11:25,452 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 11:11:25,452 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 11:11:25,452 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 11:11:25,452 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 11:11:25,452 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 11:11:25,453 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 11:11:25,455 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 11:11:25,455 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 11:11:25,455 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 11:11:25,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:11:25,455 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 11:11:25,456 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 11:11:25,456 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 11:11:25,456 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 11:11:25,456 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 11:11:25,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 11:11:25,456 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 11:11:25,457 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 11:11:25,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 11:11:25,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 11:11:25,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 11:11:25,518 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 11:11:25,518 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 11:11:25,520 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-02-15 11:11:25,520 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/eureka_05.i_5.bpl' [2019-02-15 11:11:25,580 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 11:11:25,582 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 11:11:25,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 11:11:25,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 11:11:25,583 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 11:11:25,601 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,613 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 11:11:25,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 11:11:25,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 11:11:25,624 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 11:11:25,636 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,637 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,638 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,638 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,644 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,646 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,648 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 15.02 11:11:25" (1/1) ... [2019-02-15 11:11:25,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 11:11:25,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 11:11:25,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 11:11:25,656 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 11:11:25,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (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-15 11:11:25,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 11:11:25,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 11:11:25,965 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-02-15 11:11:25,966 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 11:11:25,967 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-02-15 11:11:25,968 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:11:25 BoogieIcfgContainer [2019-02-15 11:11:25,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 11:11:25,969 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 11:11:25,969 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 11:11:25,972 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 11:11:25,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:11:25" (1/2) ... [2019-02-15 11:11:25,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599d30fb and model type eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:11:25, skipping insertion in model container [2019-02-15 11:11:25,974 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 15.02 11:11:25" (2/2) ... [2019-02-15 11:11:25,976 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05.i_5.bpl [2019-02-15 11:11:25,986 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 11:11:25,994 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-15 11:11:26,011 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-15 11:11:26,040 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 11:11:26,041 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 11:11:26,041 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 11:11:26,041 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 11:11:26,041 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 11:11:26,041 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 11:11:26,041 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 11:11:26,042 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 11:11:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-15 11:11:26,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:11:26,062 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:26,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:11:26,066 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:26,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:26,070 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-15 11:11:26,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:26,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:26,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:26,218 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-15 11:11:26,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:11:26,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 11:11:26,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:11:26,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:11:26,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:11:26,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:11:26,266 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-15 11:11:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:26,342 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-02-15 11:11:26,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:11:26,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-15 11:11:26,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:26,367 INFO L225 Difference]: With dead ends: 11 [2019-02-15 11:11:26,367 INFO L226 Difference]: Without dead ends: 7 [2019-02-15 11:11:26,376 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-02-15 11:11:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-15 11:11:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-15 11:11:26,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-15 11:11:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-02-15 11:11:26,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2019-02-15 11:11:26,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:26,414 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-02-15 11:11:26,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:11:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-15 11:11:26,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:11:26,415 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:26,415 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:11:26,416 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:26,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:26,416 INFO L82 PathProgramCache]: Analyzing trace with hash 28842881, now seen corresponding path program 1 times [2019-02-15 11:11:26,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:26,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:26,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:26,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:26,578 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-15 11:11:26,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:26,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:26,580 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:11:26,582 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [16] [2019-02-15 11:11:26,671 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:11:26,671 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:11:32,267 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:11:32,269 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-02-15 11:11:32,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:32,276 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:11:32,479 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:11:32,669 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-02-15 11:11:32,669 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:11:32,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:11:32,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2019-02-15 11:11:32,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:11:32,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:11:32,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:11:32,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:11:32,676 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2019-02-15 11:11:33,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:33,220 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-02-15 11:11:33,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:11:33,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 11:11:33,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:33,221 INFO L225 Difference]: With dead ends: 11 [2019-02-15 11:11:33,223 INFO L226 Difference]: Without dead ends: 9 [2019-02-15 11:11:33,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:11:33,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-15 11:11:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-02-15 11:11:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-15 11:11:33,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-02-15 11:11:33,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-02-15 11:11:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:33,231 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-02-15 11:11:33,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:11:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-02-15 11:11:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:11:33,232 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:33,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:11:33,233 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:33,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1948270601, now seen corresponding path program 1 times [2019-02-15 11:11:33,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:33,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:33,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:33,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:33,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:11:33,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:33,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:33,350 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:11:33,350 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16], [22] [2019-02-15 11:11:33,352 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:11:33,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:11:38,973 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-15 11:11:38,974 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-02-15 11:11:38,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:38,975 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-15 11:11:39,110 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-15 11:11:39,451 INFO L420 sIntCurrentIteration]: We unified 6 AI predicates to 6 [2019-02-15 11:11:39,452 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-15 11:11:39,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-15 11:11:39,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [3] total 6 [2019-02-15 11:11:39,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:11:39,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:11:39,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:11:39,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:11:39,454 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-02-15 11:11:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:39,668 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2019-02-15 11:11:39,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:11:39,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-15 11:11:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:39,669 INFO L225 Difference]: With dead ends: 9 [2019-02-15 11:11:39,669 INFO L226 Difference]: Without dead ends: 0 [2019-02-15 11:11:39,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:11:39,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-15 11:11:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-15 11:11:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-15 11:11:39,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-15 11:11:39,671 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2019-02-15 11:11:39,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:39,671 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-15 11:11:39,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 11:11:39,672 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-15 11:11:39,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-15 11:11:39,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-15 11:11:39,992 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 5 99) no Hoare annotation was computed. [2019-02-15 11:11:39,993 INFO L444 ceAbstractionStarter]: At program point L69(lines 69 75) the Hoare annotation is: false [2019-02-15 11:11:39,993 INFO L444 ceAbstractionStarter]: At program point L98(lines 74 98) the Hoare annotation is: (forall ((v_idx_44 Int)) (let ((.cse4 (* 2 ~n)) (.cse6 (+ ULTIMATE.start_SelectionSort_~i~4 4)) (.cse8 (+ (* 2 ULTIMATE.start_main_~i~7) 2)) (.cse5 (+ ULTIMATE.start_main_~i~7 2)) (.cse9 (+ ULTIMATE.start_SelectionSort_~lh~4 ULTIMATE.start_SelectionSort_~rh~4)) (.cse11 (+ ULTIMATE.start_SelectionSort_~i~4 ULTIMATE.start_SelectionSort_~rh~4)) (.cse12 (+ ULTIMATE.start_SelectionSort_~lh~4 ~n)) (.cse1 (+ ULTIMATE.start_SelectionSort_~lh~4 5)) (.cse18 (+ ULTIMATE.start_SelectionSort_~rh~4 1)) (.cse7 (+ ULTIMATE.start_main_~i~7 ~n)) (.cse15 (+ ULTIMATE.start_main_~i~7 6)) (.cse19 (+ ULTIMATE.start_SelectionSort_~rh~4 5)) (.cse16 (+ ULTIMATE.start_main_~i~7 ULTIMATE.start_SelectionSort_~rh~4 1)) (.cse20 (+ ULTIMATE.start_main_~i~7 ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse2 (+ ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse0 (+ ULTIMATE.start_main_~i~7 1)) (.cse13 (+ ULTIMATE.start_SelectionSort_~lh~4 ULTIMATE.start_SelectionSort_~i~4)) (.cse17 (* 2 ULTIMATE.start_SelectionSort_~rh~4)) (.cse14 (+ ULTIMATE.start_main_~i~7 ULTIMATE.start_SelectionSort_~i~4)) (.cse3 (* 2 ULTIMATE.start_SelectionSort_~lh~4)) (.cse10 (+ ULTIMATE.start_SelectionSort_~i~4 ~n)) (.cse22 (* 2 ULTIMATE.start_SelectionSort_~i~4)) (.cse21 (+ ULTIMATE.start_SelectionSort_~rh~4 ~n))) (and (<= .cse0 ULTIMATE.start_SelectionSort_~lh~4) (<= 0 ULTIMATE.start_SelectionSort_~rh~4) (<= ~n .cse1) (<= 0 .cse0) (<= ULTIMATE.start_SelectionSort_~i~4 .cse2) (<= .cse3 0) (<= .cse4 10) (<= ULTIMATE.start_SelectionSort_~i~4 .cse5) (<= ULTIMATE.start_SelectionSort_~rh~4 0) (<= ~n .cse6) (<= ULTIMATE.start_SelectionSort_~rh~4 .cse0) (<= .cse7 4) (<= ULTIMATE.start_SelectionSort_~i~4 1) (<= .cse8 0) (<= 0 .cse9) (<= .cse10 6) (<= .cse11 1) (<= 5 .cse12) (<= .cse13 1) (<= 10 .cse4) (<= 1 ULTIMATE.start_SelectionSort_~i~4) (<= .cse6 ~n) (<= .cse14 0) (<= 0 .cse8) (<= .cse5 ULTIMATE.start_SelectionSort_~i~4) (<= 5 ~n) (<= .cse9 0) (<= ~n .cse15) (<= .cse0 0) (<= ~n 5) (<= 1 .cse11) (<= ULTIMATE.start_SelectionSort_~rh~4 ULTIMATE.start_SelectionSort_~lh~4) (<= 0 ULTIMATE.start_SelectionSort_~lh~4) (<= ULTIMATE.start_SelectionSort_~lh~4 0) (<= .cse12 5) (<= 0 .cse16) (<= .cse17 0) (<= .cse18 ULTIMATE.start_SelectionSort_~i~4) (<= .cse19 ~n) (<= .cse1 ~n) (<= ULTIMATE.start_SelectionSort_~i~4 .cse18) (<= .cse0 ULTIMATE.start_SelectionSort_~rh~4) (<= 4 .cse7) (<= .cse15 ~n) (<= 0 .cse20) (<= 5 .cse21) (<= ~n .cse19) (<= .cse16 0) (<= .cse20 0) (<= .cse2 ULTIMATE.start_SelectionSort_~i~4) (<= .cse22 2) (<= ULTIMATE.start_SelectionSort_~lh~4 ULTIMATE.start_SelectionSort_~rh~4) (<= ULTIMATE.start_SelectionSort_~lh~4 .cse0) (<= 1 .cse13) (<= 0 .cse17) (<= 0 .cse14) (<= 0 .cse3) (<= 6 .cse10) (<= 2 .cse22) (<= .cse21 5) (or (= 0 (+ ULTIMATE.start_SelectionSort_~rh~4 (select ~array v_idx_44))) (< (+ v_idx_44 ULTIMATE.start_SelectionSort_~rh~4) 0) (<= 5 v_idx_44))))) [2019-02-15 11:11:39,993 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 5 99) no Hoare annotation was computed. [2019-02-15 11:11:39,994 INFO L444 ceAbstractionStarter]: At program point L90(lines 46 90) the Hoare annotation is: (forall ((v_idx_41 Int)) (let ((.cse0 (+ ULTIMATE.start_main_~i~7 1)) (.cse4 (+ ULTIMATE.start_SelectionSort_~lh~4 5)) (.cse2 (* 2 ~n)) (.cse3 (+ ULTIMATE.start_main_~i~7 ULTIMATE.start_SelectionSort_~lh~4 1)) (.cse5 (+ ULTIMATE.start_main_~i~7 6)) (.cse7 (* 2 ULTIMATE.start_SelectionSort_~lh~4)) (.cse8 (+ ULTIMATE.start_main_~i~7 ~n)) (.cse1 (+ ULTIMATE.start_SelectionSort_~lh~4 ~n)) (.cse6 (+ (* 2 ULTIMATE.start_main_~i~7) 2))) (and (<= .cse0 ULTIMATE.start_SelectionSort_~lh~4) (<= 5 .cse1) (<= 10 .cse2) (<= .cse3 0) (<= ~n .cse4) (or (< (+ ULTIMATE.start_main_~i~7 v_idx_41 1) 0) (<= .cse5 v_idx_41) (= (+ ULTIMATE.start_main_~i~7 (select ~array v_idx_41) 1) 0)) (<= 0 .cse6) (<= ULTIMATE.start_SelectionSort_~lh~4 .cse0) (<= .cse4 ~n) (<= .cse7 0) (<= 4 .cse8) (<= .cse2 10) (<= .cse5 ~n) (<= 0 .cse3) (<= ~n .cse5) (<= 0 .cse7) (<= .cse8 4) (<= .cse1 5) (<= .cse6 0)))) [2019-02-15 11:11:39,994 INFO L444 ceAbstractionStarter]: At program point L53(lines 32 53) the Hoare annotation is: (forall ((v_idx_11 Int)) (let ((.cse0 (* 2 ~n)) (.cse2 (* 2 ULTIMATE.start_main_~i~7)) (.cse1 (+ ULTIMATE.start_main_~i~7 ~n))) (and (<= .cse0 10) (<= 10 .cse0) (<= ~n (+ ULTIMATE.start_main_~i~7 6)) (<= .cse1 9) (<= (+ ULTIMATE.start_main_~i~7 1) ~n) (<= 0 (+ .cse2 2)) (<= .cse2 8) (or (< (+ v_idx_11 5) ~n) (= ~n (+ (select ~array v_idx_11) 5)) (<= 10 (+ v_idx_11 ~n))) (<= 4 .cse1)))) [2019-02-15 11:11:39,995 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 76) no Hoare annotation was computed. [2019-02-15 11:11:40,010 INFO L202 PluginConnector]: Adding new model eureka_05.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 11:11:40 BoogieIcfgContainer [2019-02-15 11:11:40,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-15 11:11:40,011 INFO L168 Benchmark]: Toolchain (without parser) took 14430.46 ms. Allocated memory was 141.0 MB in the beginning and 1.1 GB in the end (delta: 968.4 MB). Free memory was 108.4 MB in the beginning and 326.7 MB in the end (delta: -218.4 MB). Peak memory consumption was 750.0 MB. Max. memory is 7.1 GB. [2019-02-15 11:11:40,014 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.26 ms. Allocated memory is still 141.0 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 11:11:40,014 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.05 ms. Allocated memory is still 141.0 MB. Free memory was 108.4 MB in the beginning and 106.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-02-15 11:11:40,016 INFO L168 Benchmark]: Boogie Preprocessor took 31.65 ms. Allocated memory is still 141.0 MB. Free memory was 106.6 MB in the beginning and 105.6 MB in the end (delta: 969.9 kB). Peak memory consumption was 969.9 kB. Max. memory is 7.1 GB. [2019-02-15 11:11:40,017 INFO L168 Benchmark]: RCFGBuilder took 312.99 ms. Allocated memory is still 141.0 MB. Free memory was 105.4 MB in the beginning and 95.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-02-15 11:11:40,018 INFO L168 Benchmark]: TraceAbstraction took 14041.59 ms. Allocated memory was 141.0 MB in the beginning and 1.1 GB in the end (delta: 968.4 MB). Free memory was 94.7 MB in the beginning and 326.7 MB in the end (delta: -232.0 MB). Peak memory consumption was 736.3 MB. Max. memory is 7.1 GB. [2019-02-15 11:11:40,024 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.26 ms. Allocated memory is still 141.0 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 40.05 ms. Allocated memory is still 141.0 MB. Free memory was 108.4 MB in the beginning and 106.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 31.65 ms. Allocated memory is still 141.0 MB. Free memory was 106.6 MB in the beginning and 105.6 MB in the end (delta: 969.9 kB). Peak memory consumption was 969.9 kB. Max. memory is 7.1 GB. * RCFGBuilder took 312.99 ms. Allocated memory is still 141.0 MB. Free memory was 105.4 MB in the beginning and 95.1 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14041.59 ms. Allocated memory was 141.0 MB in the beginning and 1.1 GB in the end (delta: 968.4 MB). Free memory was 94.7 MB in the beginning and 326.7 MB in the end (delta: -232.0 MB). Peak memory consumption was 736.3 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: (forall v_idx_41 : int :: (((((((((((((((((main_~i~7 + 1 <= SelectionSort_~lh~4 && 5 <= SelectionSort_~lh~4 + ~n) && 10 <= 2 * ~n) && main_~i~7 + SelectionSort_~lh~4 + 1 <= 0) && ~n <= SelectionSort_~lh~4 + 5) && ((main_~i~7 + v_idx_41 + 1 < 0 || main_~i~7 + 6 <= v_idx_41) || main_~i~7 + ~array[v_idx_41] + 1 == 0)) && 0 <= 2 * main_~i~7 + 2) && SelectionSort_~lh~4 <= main_~i~7 + 1) && SelectionSort_~lh~4 + 5 <= ~n) && 2 * SelectionSort_~lh~4 <= 0) && 4 <= main_~i~7 + ~n) && 2 * ~n <= 10) && main_~i~7 + 6 <= ~n) && 0 <= main_~i~7 + SelectionSort_~lh~4 + 1) && ~n <= main_~i~7 + 6) && 0 <= 2 * SelectionSort_~lh~4) && main_~i~7 + ~n <= 4) && SelectionSort_~lh~4 + ~n <= 5) && 2 * main_~i~7 + 2 <= 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: (forall v_idx_11 : int :: (((((((2 * ~n <= 10 && 10 <= 2 * ~n) && ~n <= main_~i~7 + 6) && main_~i~7 + ~n <= 9) && main_~i~7 + 1 <= ~n) && 0 <= 2 * main_~i~7 + 2) && 2 * main_~i~7 <= 8) && ((v_idx_11 + 5 < ~n || ~n == ~array[v_idx_11] + 5) || 10 <= v_idx_11 + ~n)) && 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_44 : int :: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((main_~i~7 + 1 <= SelectionSort_~lh~4 && 0 <= SelectionSort_~rh~4) && ~n <= SelectionSort_~lh~4 + 5) && 0 <= main_~i~7 + 1) && SelectionSort_~i~4 <= SelectionSort_~lh~4 + 1) && 2 * SelectionSort_~lh~4 <= 0) && 2 * ~n <= 10) && SelectionSort_~i~4 <= main_~i~7 + 2) && SelectionSort_~rh~4 <= 0) && ~n <= SelectionSort_~i~4 + 4) && SelectionSort_~rh~4 <= main_~i~7 + 1) && main_~i~7 + ~n <= 4) && SelectionSort_~i~4 <= 1) && 2 * main_~i~7 + 2 <= 0) && 0 <= SelectionSort_~lh~4 + SelectionSort_~rh~4) && SelectionSort_~i~4 + ~n <= 6) && SelectionSort_~i~4 + SelectionSort_~rh~4 <= 1) && 5 <= SelectionSort_~lh~4 + ~n) && SelectionSort_~lh~4 + SelectionSort_~i~4 <= 1) && 10 <= 2 * ~n) && 1 <= SelectionSort_~i~4) && SelectionSort_~i~4 + 4 <= ~n) && main_~i~7 + SelectionSort_~i~4 <= 0) && 0 <= 2 * main_~i~7 + 2) && main_~i~7 + 2 <= SelectionSort_~i~4) && 5 <= ~n) && SelectionSort_~lh~4 + SelectionSort_~rh~4 <= 0) && ~n <= main_~i~7 + 6) && main_~i~7 + 1 <= 0) && ~n <= 5) && 1 <= SelectionSort_~i~4 + SelectionSort_~rh~4) && SelectionSort_~rh~4 <= SelectionSort_~lh~4) && 0 <= SelectionSort_~lh~4) && SelectionSort_~lh~4 <= 0) && SelectionSort_~lh~4 + ~n <= 5) && 0 <= main_~i~7 + SelectionSort_~rh~4 + 1) && 2 * SelectionSort_~rh~4 <= 0) && SelectionSort_~rh~4 + 1 <= SelectionSort_~i~4) && SelectionSort_~rh~4 + 5 <= ~n) && SelectionSort_~lh~4 + 5 <= ~n) && SelectionSort_~i~4 <= SelectionSort_~rh~4 + 1) && main_~i~7 + 1 <= SelectionSort_~rh~4) && 4 <= main_~i~7 + ~n) && main_~i~7 + 6 <= ~n) && 0 <= main_~i~7 + SelectionSort_~lh~4 + 1) && 5 <= SelectionSort_~rh~4 + ~n) && ~n <= SelectionSort_~rh~4 + 5) && main_~i~7 + SelectionSort_~rh~4 + 1 <= 0) && main_~i~7 + SelectionSort_~lh~4 + 1 <= 0) && SelectionSort_~lh~4 + 1 <= SelectionSort_~i~4) && 2 * SelectionSort_~i~4 <= 2) && SelectionSort_~lh~4 <= SelectionSort_~rh~4) && SelectionSort_~lh~4 <= main_~i~7 + 1) && 1 <= SelectionSort_~lh~4 + SelectionSort_~i~4) && 0 <= 2 * SelectionSort_~rh~4) && 0 <= main_~i~7 + SelectionSort_~i~4) && 0 <= 2 * SelectionSort_~lh~4) && 6 <= SelectionSort_~i~4 + ~n) && 2 <= 2 * SelectionSort_~i~4) && SelectionSort_~rh~4 + ~n <= 5) && ((0 == SelectionSort_~rh~4 + ~array[v_idx_44] || v_idx_44 + SelectionSort_~rh~4 < 0) || 5 <= v_idx_44)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 13.9s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 10 SDtfs, 11 SDslu, 5 SDs, 0 SdLazy, 10 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s 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, 11.3s AbstIntTime, 2 AbstIntIterations, 2 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN 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, 129 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 364 FormulaSimplificationTreeSizeReductionInter, 0.2s 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...