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/heapseparator/speedup-poc-dd-2-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1ae3202 [2019-03-04 16:53:13,102 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:53:13,104 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:53:13,120 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:53:13,120 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:53:13,123 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:53:13,125 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:53:13,127 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:53:13,129 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:53:13,130 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:53:13,138 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:53:13,139 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:53:13,140 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:53:13,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:53:13,144 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:53:13,145 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:53:13,148 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:53:13,151 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:53:13,157 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:53:13,160 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:53:13,162 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:53:13,163 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:53:13,166 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:53:13,166 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:53:13,166 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:53:13,168 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:53:13,169 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:53:13,169 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:53:13,173 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:53:13,175 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:53:13,176 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:53:13,176 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:53:13,177 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:53:13,178 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:53:13,180 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:53:13,180 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:53:13,180 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-03-04 16:53:13,206 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:53:13,206 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:53:13,208 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:53:13,208 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:53:13,208 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:53:13,208 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:53:13,209 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:53:13,209 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:53:13,209 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:53:13,209 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:53:13,209 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-03-04 16:53:13,209 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:53:13,213 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:53:13,214 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:53:13,214 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:53:13,214 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:53:13,215 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:53:13,215 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:53:13,215 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:53:13,215 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:53:13,215 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:53:13,216 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:53:13,216 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:53:13,216 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:53:13,216 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:53:13,216 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:53:13,216 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:53:13,218 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:53:13,219 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:53:13,219 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:53:13,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:53:13,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:53:13,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:53:13,220 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:53:13,220 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:53:13,220 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:53:13,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:53:13,220 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:53:13,221 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:53:13,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:53:13,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:53:13,294 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:53:13,296 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:53:13,296 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:53:13,297 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl [2019-03-04 16:53:13,297 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl' [2019-03-04 16:53:13,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:53:13,332 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:53:13,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:13,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:53:13,333 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:53:13,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:13" (1/1) ... [2019-03-04 16:53:13,365 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:13" (1/1) ... [2019-03-04 16:53:13,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:53:13,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:53:13,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:53:13,385 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:53:13,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:13" (1/1) ... [2019-03-04 16:53:13,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:13" (1/1) ... [2019-03-04 16:53:13,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:13" (1/1) ... [2019-03-04 16:53:13,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:13" (1/1) ... [2019-03-04 16:53:13,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:13" (1/1) ... [2019-03-04 16:53:13,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:13" (1/1) ... [2019-03-04 16:53:13,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:13" (1/1) ... [2019-03-04 16:53:13,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:53:13,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:53:13,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:53:13,405 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:53:13,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:13" (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-03-04 16:53:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:53:13,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:53:13,744 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:53:13,746 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-03-04 16:53:13,747 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:13 BoogieIcfgContainer [2019-03-04 16:53:13,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:53:13,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:53:13,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:53:13,753 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:53:13,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:53:13" (1/2) ... [2019-03-04 16:53:13,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597d29fd and model type speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:53:13, skipping insertion in model container [2019-03-04 16:53:13,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:53:13" (2/2) ... [2019-03-04 16:53:13,758 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-limited.bpl [2019-03-04 16:53:13,768 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:53:13,777 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-03-04 16:53:13,793 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-03-04 16:53:13,828 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:53:13,828 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:53:13,828 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:53:13,828 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:53:13,828 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:53:13,828 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:53:13,829 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:53:13,829 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:53:13,843 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-03-04 16:53:13,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:53:13,848 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:13,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:53:13,852 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:13,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:13,862 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-03-04 16:53:13,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:13,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:13,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:13,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:13,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:14,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:53:14,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:53:14,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:14,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:14,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:14,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:14,055 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-03-04 16:53:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:14,214 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-03-04 16:53:14,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:14,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:53:14,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:14,232 INFO L225 Difference]: With dead ends: 13 [2019-03-04 16:53:14,233 INFO L226 Difference]: Without dead ends: 8 [2019-03-04 16:53:14,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-03-04 16:53:14,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-03-04 16:53:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-03-04 16:53:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-03-04 16:53:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-03-04 16:53:14,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-03-04 16:53:14,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:14,270 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-03-04 16:53:14,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-03-04 16:53:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:14,271 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:14,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:14,271 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:14,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:14,272 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-03-04 16:53:14,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:14,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:14,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:14,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:14,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:14,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:14,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:14,358 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:53:14,362 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2019-03-04 16:53:14,428 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:14,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:19,419 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:53:19,420 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 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-03-04 16:53:19,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:19,426 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:53:19,750 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 66.67% of their original sizes. [2019-03-04 16:53:19,750 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:53:19,875 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-03-04 16:53:19,875 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:53:19,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:53:19,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-03-04 16:53:19,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:19,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:53:19,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:53:19,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:19,879 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 3 states. [2019-03-04 16:53:20,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:20,008 INFO L93 Difference]: Finished difference Result 8 states and 13 transitions. [2019-03-04 16:53:20,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:20,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:53:20,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:20,010 INFO L225 Difference]: With dead ends: 8 [2019-03-04 16:53:20,010 INFO L226 Difference]: Without dead ends: 7 [2019-03-04 16:53:20,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:53:20,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-03-04 16:53:20,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-03-04 16:53:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-03-04 16:53:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-03-04 16:53:20,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 3 [2019-03-04 16:53:20,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:20,014 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-03-04 16:53:20,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:53:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-03-04 16:53:20,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:53:20,015 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:20,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:53:20,016 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:20,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:20,016 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-03-04 16:53:20,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:20,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:20,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:20,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:20,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:20,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:20,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:20,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:20,161 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:53:20,162 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2019-03-04 16:53:20,163 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:20,163 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:23,002 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:53:23,002 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 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-03-04 16:53:23,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:23,003 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:53:23,182 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 58.33% of their original sizes. [2019-03-04 16:53:23,183 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:53:23,286 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-03-04 16:53:23,287 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:53:23,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:53:23,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-03-04 16:53:23,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:23,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:53:23,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:53:23,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:53:23,288 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-03-04 16:53:23,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:23,494 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-03-04 16:53:23,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:23,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:53:23,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:23,496 INFO L225 Difference]: With dead ends: 11 [2019-03-04 16:53:23,496 INFO L226 Difference]: Without dead ends: 8 [2019-03-04 16:53:23,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:53:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-03-04 16:53:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-03-04 16:53:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-03-04 16:53:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-03-04 16:53:23,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 3 [2019-03-04 16:53:23,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:23,502 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-03-04 16:53:23,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:53:23,502 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-03-04 16:53:23,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:53:23,503 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:23,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:53:23,503 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:23,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:23,503 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2019-03-04 16:53:23,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:23,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:23,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:23,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:23,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:23,794 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-03-04 16:53:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:23,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:23,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:23,816 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:53:23,816 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2019-03-04 16:53:23,818 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:53:23,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:53:28,904 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-03-04 16:53:28,905 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 2 different actions 8 times. Widened at 2 different actions 4 times. Found 10 fixpoints after 2 different actions. Largest state had 0 variables. [2019-03-04 16:53:28,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:28,905 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-03-04 16:53:29,118 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 55.56% of their original sizes. [2019-03-04 16:53:29,118 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-03-04 16:53:29,274 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-03-04 16:53:29,275 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-03-04 16:53:29,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-03-04 16:53:29,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-03-04 16:53:29,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:53:29,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:53:29,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:53:29,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:53:29,277 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 4 states. [2019-03-04 16:53:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:29,365 INFO L93 Difference]: Finished difference Result 8 states and 13 transitions. [2019-03-04 16:53:29,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:53:29,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:53:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:29,365 INFO L225 Difference]: With dead ends: 8 [2019-03-04 16:53:29,365 INFO L226 Difference]: Without dead ends: 0 [2019-03-04 16:53:29,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-03-04 16:53:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-03-04 16:53:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-03-04 16:53:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-03-04 16:53:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-03-04 16:53:29,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-03-04 16:53:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:29,367 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-03-04 16:53:29,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:53:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-03-04 16:53:29,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-03-04 16:53:29,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-03-04 16:53:29,432 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:53:29,432 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 33) no Hoare annotation was computed. [2019-03-04 16:53:29,432 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-03-04 16:53:29,433 INFO L444 ceAbstractionStarter]: At program point L26-1(lines 25 31) the Hoare annotation is: (forall ((v_idx_213 Int) (v_idx_211 Int)) (let ((.cse6 (+ ULTIMATE.start_main_p1 1))) (and (let ((.cse4 (select |#memory_int| v_idx_213))) (let ((.cse1 (<= (+ ULTIMATE.start_main_p2 1) v_idx_213)) (.cse2 (< v_idx_213 ULTIMATE.start_main_p2)) (.cse3 (<= (* 2 .cse4) 0))) (let ((.cse0 (or .cse1 .cse2 .cse3))) (or (and (< v_idx_211 ULTIMATE.start_main_p1) .cse0) (let ((.cse5 (select |#memory_int| v_idx_211))) (and (or .cse1 .cse2 (and .cse3 (<= .cse4 .cse5))) (<= 0 (* 2 .cse5)))) (and (<= .cse6 v_idx_211) .cse0))))) (<= .cse6 ULTIMATE.start_main_p2)))) [2019-03-04 16:53:29,433 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 34) no Hoare annotation was computed. [2019-03-04 16:53:29,433 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 36) no Hoare annotation was computed. [2019-03-04 16:53:29,433 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-03-04 16:53:29,444 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 04:53:29 BoogieIcfgContainer [2019-03-04 16:53:29,445 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-03-04 16:53:29,445 INFO L168 Benchmark]: Toolchain (without parser) took 16113.82 ms. Allocated memory was 137.9 MB in the beginning and 1.1 GB in the end (delta: 919.6 MB). Free memory was 108.2 MB in the beginning and 243.7 MB in the end (delta: -135.5 MB). Peak memory consumption was 784.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:29,447 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory is still 109.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:53:29,447 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.84 ms. Allocated memory is still 137.9 MB. Free memory was 108.2 MB in the beginning and 106.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:29,449 INFO L168 Benchmark]: Boogie Preprocessor took 19.89 ms. Allocated memory is still 137.9 MB. Free memory was 106.0 MB in the beginning and 104.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:29,450 INFO L168 Benchmark]: RCFGBuilder took 343.42 ms. Allocated memory is still 137.9 MB. Free memory was 104.9 MB in the beginning and 95.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:29,450 INFO L168 Benchmark]: TraceAbstraction took 15694.84 ms. Allocated memory was 137.9 MB in the beginning and 1.1 GB in the end (delta: 919.6 MB). Free memory was 95.4 MB in the beginning and 243.7 MB in the end (delta: -148.3 MB). Peak memory consumption was 771.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:53:29,458 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.19 ms. Allocated memory is still 137.9 MB. Free memory is still 109.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.84 ms. Allocated memory is still 137.9 MB. Free memory was 108.2 MB in the beginning and 106.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.89 ms. Allocated memory is still 137.9 MB. Free memory was 106.0 MB in the beginning and 104.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 343.42 ms. Allocated memory is still 137.9 MB. Free memory was 104.9 MB in the beginning and 95.6 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15694.84 ms. Allocated memory was 137.9 MB in the beginning and 1.1 GB in the end (delta: 919.6 MB). Free memory was 95.4 MB in the beginning and 243.7 MB in the end (delta: -148.3 MB). Peak memory consumption was 771.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 33]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (forall v_idx_213 : int, v_idx_211 : int :: (((v_idx_211 < p1 && ((p2 + 1 <= v_idx_213 || v_idx_213 < p2) || 2 * #memory_int[v_idx_213] <= 0)) || (((p2 + 1 <= v_idx_213 || v_idx_213 < p2) || (2 * #memory_int[v_idx_213] <= 0 && #memory_int[v_idx_213] <= #memory_int[v_idx_211])) && 0 <= 2 * #memory_int[v_idx_211])) || (p1 + 1 <= v_idx_211 && ((p2 + 1 <= v_idx_213 || v_idx_213 < p2) || 2 * #memory_int[v_idx_213] <= 0))) && p1 + 1 <= p2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 15.6s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9 SDtfs, 8 SDslu, 1 SDs, 0 SdLazy, 16 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 13.0s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 4 NumberOfFragments, 82 HoareAnnotationTreeSize, 1 FomulaSimplifications, 442 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 165 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/5 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...