java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 15:09:32,584 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 15:09:32,586 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 15:09:32,597 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 15:09:32,598 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 15:09:32,599 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 15:09:32,600 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 15:09:32,602 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 15:09:32,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 15:09:32,604 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 15:09:32,605 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 15:09:32,606 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 15:09:32,606 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 15:09:32,607 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 15:09:32,609 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 15:09:32,609 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 15:09:32,610 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 15:09:32,612 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 15:09:32,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 15:09:32,616 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 15:09:32,617 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 15:09:32,618 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 15:09:32,621 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 15:09:32,621 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 15:09:32,621 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 15:09:32,622 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 15:09:32,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 15:09:32,624 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 15:09:32,625 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 15:09:32,626 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 15:09:32,626 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 15:09:32,627 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 15:09:32,627 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 15:09:32,627 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 15:09:32,628 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 15:09:32,629 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 15:09:32,629 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-31 15:09:32,642 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 15:09:32,642 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 15:09:32,643 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 15:09:32,643 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 15:09:32,643 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 15:09:32,644 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 15:09:32,644 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 15:09:32,644 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 15:09:32,644 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 15:09:32,644 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 15:09:32,645 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 15:09:32,645 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 15:09:32,645 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 15:09:32,646 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 15:09:32,646 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 15:09:32,646 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 15:09:32,646 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 15:09:32,647 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 15:09:32,647 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 15:09:32,647 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 15:09:32,647 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 15:09:32,647 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 15:09:32,648 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 15:09:32,648 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 15:09:32,648 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 15:09:32,648 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 15:09:32,648 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 15:09:32,649 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 15:09:32,649 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 15:09:32,649 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 15:09:32,649 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 15:09:32,649 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 15:09:32,650 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 15:09:32,650 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 15:09:32,650 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 15:09:32,650 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 15:09:32,650 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 15:09:32,650 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 15:09:32,651 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 15:09:32,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 15:09:32,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 15:09:32,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 15:09:32,703 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 15:09:32,704 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 15:09:32,704 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-unlimited.bpl [2019-01-31 15:09:32,705 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-unlimited.bpl' [2019-01-31 15:09:32,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 15:09:32,754 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 15:09:32,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 15:09:32,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 15:09:32,756 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 15:09:32,775 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:32" (1/1) ... [2019-01-31 15:09:32,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:32" (1/1) ... [2019-01-31 15:09:32,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 15:09:32,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 15:09:32,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 15:09:32,816 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 15:09:32,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:32" (1/1) ... [2019-01-31 15:09:32,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:32" (1/1) ... [2019-01-31 15:09:32,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:32" (1/1) ... [2019-01-31 15:09:32,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:32" (1/1) ... [2019-01-31 15:09:32,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:32" (1/1) ... [2019-01-31 15:09:32,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:32" (1/1) ... [2019-01-31 15:09:32,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:32" (1/1) ... [2019-01-31 15:09:32,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 15:09:32,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 15:09:32,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 15:09:32,840 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 15:09:32,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:32" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 15:09:32,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 15:09:32,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 15:09:33,096 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 15:09:33,097 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-31 15:09:33,098 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:09:33 BoogieIcfgContainer [2019-01-31 15:09:33,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 15:09:33,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 15:09:33,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 15:09:33,102 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 15:09:33,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 03:09:32" (1/2) ... [2019-01-31 15:09:33,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71840ae3 and model type speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 03:09:33, skipping insertion in model container [2019-01-31 15:09:33,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 03:09:33" (2/2) ... [2019-01-31 15:09:33,106 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-1-unlimited.bpl [2019-01-31 15:09:33,116 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 15:09:33,124 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 15:09:33,140 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 15:09:33,172 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 15:09:33,172 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 15:09:33,173 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 15:09:33,173 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 15:09:33,173 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 15:09:33,173 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 15:09:33,173 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 15:09:33,174 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 15:09:33,188 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-01-31 15:09:33,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 15:09:33,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:09:33,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 15:09:33,197 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:09:33,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:09:33,204 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2019-01-31 15:09:33,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:09:33,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:09:33,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:09:33,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:09:33,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:09:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:09:33,456 INFO L273 TraceCheckUtils]: 0: Hoare triple {8#true} havoc main_p1;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0]; {10#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-31 15:09:33,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {10#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {9#false} is VALID [2019-01-31 15:09:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:09:33,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 15:09:33,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 15:09:33,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:09:33,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 15:09:33,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:09:33,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 15:09:33,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:09:33,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 15:09:33,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 15:09:33,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 15:09:33,555 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-01-31 15:09:33,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:09:33,668 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-31 15:09:33,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 15:09:33,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 15:09:33,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:09:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:09:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-31 15:09:33,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:09:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-31 15:09:33,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9 transitions. [2019-01-31 15:09:33,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:09:33,749 INFO L225 Difference]: With dead ends: 9 [2019-01-31 15:09:33,750 INFO L226 Difference]: Without dead ends: 4 [2019-01-31 15:09:33,753 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-01-31 15:09:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-01-31 15:09:33,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-01-31 15:09:33,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:09:33,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4 states. Second operand 4 states. [2019-01-31 15:09:33,823 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2019-01-31 15:09:33,824 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2019-01-31 15:09:33,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:09:33,828 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-01-31 15:09:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-01-31 15:09:33,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:09:33,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:09:33,829 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2019-01-31 15:09:33,829 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2019-01-31 15:09:33,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:09:33,831 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-01-31 15:09:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-01-31 15:09:33,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:09:33,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:09:33,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:09:33,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:09:33,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-31 15:09:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-01-31 15:09:33,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-01-31 15:09:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:09:33,839 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-01-31 15:09:33,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 15:09:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-01-31 15:09:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 15:09:33,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 15:09:33,842 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 15:09:33,843 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 15:09:33,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:09:33,844 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2019-01-31 15:09:33,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 15:09:33,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:09:33,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 15:09:33,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 15:09:33,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 15:09:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 15:09:34,127 INFO L273 TraceCheckUtils]: 0: Hoare triple {38#true} havoc main_p1;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0]; {40#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-31 15:09:34,134 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {41#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-31 15:09:34,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {39#false} is VALID [2019-01-31 15:09:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 15:09:34,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 15:09:34,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 15:09:34,138 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 15:09:34,140 INFO L207 CegarAbsIntRunner]: [0], [4], [6] [2019-01-31 15:09:34,210 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 15:09:34,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 15:10:17,314 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 15:10:17,316 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-01-31 15:10:17,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 15:10:17,321 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 15:10:20,580 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 60% of their original sizes. [2019-01-31 15:10:20,689 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 15:10:20,878 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-31 15:10:21,097 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 15:10:21,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 15:10:21,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-01-31 15:10:21,098 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 15:10:21,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 15:10:21,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 15:10:21,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 15:10:21,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:21,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 15:10:21,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 15:10:21,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 15:10:21,108 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 3 states. [2019-01-31 15:10:21,192 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-01-31 15:10:21,193 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-01-31 15:10:21,194 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-31 15:10:21,194 WARN L223 ngHoareTripleChecker]: -- [2019-01-31 15:10:21,195 WARN L224 ngHoareTripleChecker]: Pre: {70#(forall ((v_idx_546 Int)) (or (<= (+ c_ULTIMATE.start_main_p1 1) v_idx_546) (<= 0 (* 2 (select |c_#memory_int| v_idx_546))) (< v_idx_546 c_ULTIMATE.start_main_p1)))} [2019-01-31 15:10:21,195 WARN L228 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; [2019-01-31 15:10:21,196 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p1 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p1) 1))) [2019-01-31 15:10:21,196 WARN L230 ngHoareTripleChecker]: Post: {71#false} [2019-01-31 15:10:21,196 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-31 15:10:21,200 WARN L268 ngHoareTripleChecker]: -- [2019-01-31 15:10:21,200 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-31 15:10:21,365 WARN L270 ngHoareTripleChecker]: Pre: {70#(forall ((v_idx_546 Int)) (or (<= (+ ULTIMATE.start_main_p1 1) v_idx_546) (<= 0 (* 2 (select |#memory_int| v_idx_546))) (< v_idx_546 ULTIMATE.start_main_p1)))} [2019-01-31 15:10:21,366 WARN L274 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; [2019-01-31 15:10:21,366 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p1 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p1) 1))) [2019-01-31 15:10:21,377 WARN L276 ngHoareTripleChecker]: Post: {71#false} [2019-01-31 15:10:21,378 WARN L620 ntHoareTripleChecker]: -- [2019-01-31 15:10:21,378 WARN L621 ntHoareTripleChecker]: Abstract states [2019-01-31 15:10:21,379 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[#memory_int] -> [-inf_0] v_895 [b_74] v_896 [b_75] v_897 [inf_0], [#valid] -> [-inf_0] v_1401 [inf_0], [ULTIMATE.start_malloc_old_#valid] -> [-inf_0] v_1400 [inf_0], [old(#memory_int)] -> [-inf_0] v_1403 [inf_0], [old(#valid)] -> [-inf_0] v_1402 [inf_0], }, Substate: {ints: {v_896 = [0; inf]}, 10 vars top, relations: {ULTIMATE.start_main_p1 - b_74 = [0; 0]; ULTIMATE.start_main_p1 - b_75 = [-1; -1]; b_74 - b_75 = [-1; -1]}, }}} [2019-01-31 15:10:21,379 WARN L628 ntHoareTripleChecker]: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p1 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p1) 1))) (#memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1];) [2019-01-31 15:10:21,379 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-01-31 15:10:21,380 WARN L630 ntHoareTripleChecker]: -- [2019-01-31 15:10:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:21,393 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-01-31 15:10:21,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 15:10:21,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 15:10:21,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 15:10:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:10:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-01-31 15:10:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 15:10:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-01-31 15:10:21,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 3 transitions. [2019-01-31 15:10:21,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 15:10:21,410 INFO L225 Difference]: With dead ends: 4 [2019-01-31 15:10:21,410 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 15:10:21,411 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-01-31 15:10:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 15:10:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 15:10:21,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 15:10:21,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-31 15:10:21,412 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 15:10:21,412 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 15:10:21,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:21,412 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 15:10:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 15:10:21,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:21,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:21,413 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-31 15:10:21,413 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-31 15:10:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 15:10:21,413 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-31 15:10:21,413 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 15:10:21,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:21,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 15:10:21,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 15:10:21,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 15:10:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 15:10:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 15:10:21,414 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2019-01-31 15:10:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 15:10:21,414 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 15:10:21,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 15:10:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 15:10:21,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 15:10:21,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 15:10:21,536 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-31 15:10:21,537 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 28) no Hoare annotation was computed. [2019-01-31 15:10:21,537 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-31 15:10:21,537 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 26) no Hoare annotation was computed. [2019-01-31 15:10:21,538 INFO L444 ceAbstractionStarter]: At program point L21-1(lines 21 24) the Hoare annotation is: (forall ((v_idx_497 Int)) (or (<= (+ ULTIMATE.start_main_p1 1) v_idx_497) (<= 0 (* 2 (select |#memory_int| v_idx_497))) (< v_idx_497 ULTIMATE.start_main_p1))) [2019-01-31 15:10:21,541 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-01-31 15:10:21,559 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-01-31 15:10:21,560 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2019-01-31 15:10:21,560 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2019-01-31 15:10:21,560 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-31 15:10:21,569 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 03:10:21 BoogieIcfgContainer [2019-01-31 15:10:21,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 15:10:21,570 INFO L168 Benchmark]: Toolchain (without parser) took 48816.62 ms. Allocated memory was 133.2 MB in the beginning and 756.0 MB in the end (delta: 622.9 MB). Free memory was 108.3 MB in the beginning and 174.3 MB in the end (delta: -66.0 MB). Peak memory consumption was 556.9 MB. Max. memory is 7.1 GB. [2019-01-31 15:10:21,573 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 133.2 MB. Free memory is still 109.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 15:10:21,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.29 ms. Allocated memory is still 133.2 MB. Free memory was 108.1 MB in the beginning and 106.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-31 15:10:21,577 INFO L168 Benchmark]: Boogie Preprocessor took 23.42 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 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-01-31 15:10:21,577 INFO L168 Benchmark]: RCFGBuilder took 258.65 ms. Allocated memory is still 133.2 MB. Free memory was 104.9 MB in the beginning and 95.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-01-31 15:10:21,578 INFO L168 Benchmark]: TraceAbstraction took 48469.75 ms. Allocated memory was 133.2 MB in the beginning and 756.0 MB in the end (delta: 622.9 MB). Free memory was 95.1 MB in the beginning and 174.3 MB in the end (delta: -79.2 MB). Peak memory consumption was 543.7 MB. Max. memory is 7.1 GB. [2019-01-31 15:10:21,591 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.27 ms. Allocated memory is still 133.2 MB. Free memory is still 109.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.29 ms. Allocated memory is still 133.2 MB. Free memory was 108.1 MB in the beginning and 106.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.42 ms. Allocated memory is still 133.2 MB. Free memory was 106.1 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 258.65 ms. Allocated memory is still 133.2 MB. Free memory was 104.9 MB in the beginning and 95.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48469.75 ms. Allocated memory was 133.2 MB in the beginning and 756.0 MB in the end (delta: 622.9 MB). Free memory was 95.1 MB in the beginning and 174.3 MB in the end (delta: -79.2 MB). Peak memory consumption was 543.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: 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: 21]: Loop Invariant Derived loop invariant: (forall v_idx_497 : int :: (p1 + 1 <= v_idx_497 || 0 <= 2 * #memory_int[v_idx_497]) || v_idx_497 < p1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 48.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 4 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 5 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 43.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 17 HoareAnnotationTreeSize, 1 FomulaSimplifications, 24 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 25 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...