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-a9d37a5-m [2019-02-28 10:51:43,591 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:51:43,593 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:51:43,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:51:43,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:51:43,613 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:51:43,615 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:51:43,617 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:51:43,619 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:51:43,620 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:51:43,621 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:51:43,622 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:51:43,623 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:51:43,626 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:51:43,627 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:51:43,629 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:51:43,629 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:51:43,631 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:51:43,633 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:51:43,635 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:51:43,636 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:51:43,637 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:51:43,640 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:51:43,640 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:51:43,640 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:51:43,641 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:51:43,642 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:51:43,643 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:51:43,644 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:51:43,645 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:51:43,645 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:51:43,646 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:51:43,646 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:51:43,646 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:51:43,647 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:51:43,648 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:51:43,648 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-28 10:51:43,661 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:51:43,662 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:51:43,663 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:51:43,663 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:51:43,663 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:51:43,663 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:51:43,664 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:51:43,664 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:51:43,664 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:51:43,664 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:51:43,665 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:51:43,665 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:51:43,665 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:51:43,666 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:51:43,666 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:51:43,666 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:51:43,666 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:51:43,667 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:51:43,667 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:51:43,667 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:51:43,667 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:51:43,667 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:51:43,668 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:51:43,668 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:51:43,668 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:51:43,668 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:51:43,668 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:51:43,669 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:51:43,669 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:51:43,669 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:51:43,669 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:51:43,669 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:51:43,670 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:51:43,670 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:51:43,670 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:51:43,670 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:51:43,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:51:43,671 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:51:43,671 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:51:43,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:51:43,719 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:51:43,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:51:43,725 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:51:43,725 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:51:43,726 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-02-28 10:51:43,726 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-limited.bpl' [2019-02-28 10:51:43,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:51:43,766 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:51:43,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:51:43,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:51:43,767 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:51:43,783 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 28.02 10:51:43" (1/1) ... [2019-02-28 10:51:43,795 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 28.02 10:51:43" (1/1) ... [2019-02-28 10:51:43,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:51:43,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:51:43,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:51:43,819 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:51:43,830 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 28.02 10:51:43" (1/1) ... [2019-02-28 10:51:43,830 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 28.02 10:51:43" (1/1) ... [2019-02-28 10:51:43,831 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 28.02 10:51:43" (1/1) ... [2019-02-28 10:51:43,832 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 28.02 10:51:43" (1/1) ... [2019-02-28 10:51:43,834 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 28.02 10:51:43" (1/1) ... [2019-02-28 10:51:43,837 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 28.02 10:51:43" (1/1) ... [2019-02-28 10:51:43,838 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 28.02 10:51:43" (1/1) ... [2019-02-28 10:51:43,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:51:43,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:51:43,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:51:43,841 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:51:43,842 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 28.02 10:51:43" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:51:43,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:51:43,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:51:44,182 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:51:44,183 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-02-28 10:51:44,184 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:51:44 BoogieIcfgContainer [2019-02-28 10:51:44,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:51:44,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:51:44,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:51:44,191 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:51:44,191 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 28.02 10:51:43" (1/2) ... [2019-02-28 10:51:44,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d0a86a and model type speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:51:44, skipping insertion in model container [2019-02-28 10:51:44,193 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 28.02 10:51:44" (2/2) ... [2019-02-28 10:51:44,196 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-limited.bpl [2019-02-28 10:51:44,208 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:51:44,220 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-28 10:51:44,238 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-28 10:51:44,279 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:51:44,279 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:51:44,280 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:51:44,280 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:51:44,280 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:51:44,280 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:51:44,280 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:51:44,281 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:51:44,299 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-28 10:51:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 10:51:44,317 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:44,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 10:51:44,321 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:44,329 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-02-28 10:51:44,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:44,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:44,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:44,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:44,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:44,496 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-28 10:51:44,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:51:44,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:51:44,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:51:44,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:51:44,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:51:44,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:51:44,515 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-28 10:51:44,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:44,690 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-02-28 10:51:44,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:51:44,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 10:51:44,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:44,711 INFO L225 Difference]: With dead ends: 13 [2019-02-28 10:51:44,712 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 10:51:44,724 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-02-28 10:51:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 10:51:44,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-02-28 10:51:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 10:51:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-28 10:51:44,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-02-28 10:51:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:44,776 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-02-28 10:51:44,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:51:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-02-28 10:51:44,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:51:44,777 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:44,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:51:44,778 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:44,778 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-02-28 10:51:44,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:44,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:44,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:44,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:44,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:44,943 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-28 10:51:44,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:44,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:44,945 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:51:44,948 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2019-02-28 10:51:45,010 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:51:45,011 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:51:50,771 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:51:50,773 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-02-28 10:51:50,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:50,779 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:51:51,072 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:51:51,179 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-28 10:51:51,180 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:51:51,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:51:51,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-28 10:51:51,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:51:51,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:51:51,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:51:51,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:51:51,188 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 3 states. [2019-02-28 10:51:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:51,485 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2019-02-28 10:51:51,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:51:51,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:51:51,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:51,486 INFO L225 Difference]: With dead ends: 10 [2019-02-28 10:51:51,487 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 10:51:51,488 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-02-28 10:51:51,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 10:51:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-02-28 10:51:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 10:51:51,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2019-02-28 10:51:51,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 8 transitions. Word has length 3 [2019-02-28 10:51:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:51,491 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 8 transitions. [2019-02-28 10:51:51,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:51:51,492 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 8 transitions. [2019-02-28 10:51:51,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:51:51,492 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:51,492 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:51:51,493 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:51,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-02-28 10:51:51,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:51,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:51,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:51,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:51,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:51,656 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-02-28 10:51:51,672 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-28 10:51:51,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:51,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:51,673 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:51:51,673 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2019-02-28 10:51:51,675 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:51:51,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:51:54,440 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:51:54,441 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-02-28 10:51:54,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:54,442 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:51:54,589 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:51:54,700 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-28 10:51:54,701 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:51:54,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:51:54,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-28 10:51:54,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:51:54,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:51:54,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:51:54,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:51:54,703 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. Second operand 3 states. [2019-02-28 10:51:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:54,950 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2019-02-28 10:51:54,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:51:54,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:51:54,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:54,951 INFO L225 Difference]: With dead ends: 11 [2019-02-28 10:51:54,951 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 10:51:54,952 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-02-28 10:51:54,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 10:51:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-28 10:51:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:51:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-02-28 10:51:54,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 3 [2019-02-28 10:51:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:54,957 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-02-28 10:51:54,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:51:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 12 transitions. [2019-02-28 10:51:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:51:54,958 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:54,958 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:51:54,958 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:51:54,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:54,958 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2019-02-28 10:51:54,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:54,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:54,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:54,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:54,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:55,341 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-02-28 10:51:55,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:55,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:55,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:55,357 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:51:55,358 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2019-02-28 10:51:55,359 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:51:55,359 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:52:00,844 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 10:52:00,845 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-02-28 10:52:00,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:00,845 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 10:52:01,099 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 10:52:01,277 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-02-28 10:52:01,278 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 10:52:01,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 10:52:01,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2019-02-28 10:52:01,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:52:01,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:52:01,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:52:01,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:01,280 INFO L87 Difference]: Start difference. First operand 8 states and 12 transitions. Second operand 3 states. [2019-02-28 10:52:01,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:01,339 INFO L93 Difference]: Finished difference Result 8 states and 12 transitions. [2019-02-28 10:52:01,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:52:01,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-28 10:52:01,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:01,340 INFO L225 Difference]: With dead ends: 8 [2019-02-28 10:52:01,340 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 10:52:01,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:52:01,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 10:52:01,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 10:52:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 10:52:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 10:52:01,341 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2019-02-28 10:52:01,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:01,341 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 10:52:01,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:52:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 10:52:01,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 10:52:01,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 10:52:01,384 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:52:01,384 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:52:01,384 INFO L444 ceAbstractionStarter]: At program point L26-1(lines 25 31) the Hoare annotation is: (forall ((v_idx_126 Int) (v_idx_129 Int) (v_idx_123 Int) (v_idx_131 Int)) (let ((.cse0 (+ ULTIMATE.start_main_p1 1)) (.cse8 (+ ULTIMATE.start_main_p2 1))) (and (<= ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) (<= .cse0 ULTIMATE.start_malloc_ptr) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p2) (<= .cse0 ULTIMATE.start_main_p2) (let ((.cse6 (select |#memory_int| v_idx_131))) (let ((.cse5 (<= (* 2 .cse6) 0)) (.cse7 (<= .cse6 0)) (.cse3 (< v_idx_131 ULTIMATE.start_main_p2)) (.cse4 (<= .cse8 v_idx_131))) (let ((.cse1 (or (and .cse5 .cse7) .cse3 .cse4))) (or (and .cse1 (<= .cse0 v_idx_129)) (let ((.cse2 (select |#memory_int| v_idx_129))) (and (<= 0 (* 2 .cse2)) (<= 0 .cse2) (or .cse3 .cse4 (and .cse5 (<= .cse6 .cse2) .cse7)))) (and .cse1 (< v_idx_129 ULTIMATE.start_main_p1)))))) (or (<= .cse8 v_idx_123) (= 0 (select |ULTIMATE.start_malloc_old_#valid| v_idx_123)) (< v_idx_123 ULTIMATE.start_main_p2)) (or (<= .cse8 v_idx_126) (< v_idx_126 ULTIMATE.start_main_p2) (= 1 (select |#valid| v_idx_126)))))) [2019-02-28 10:52:01,385 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 34) no Hoare annotation was computed. [2019-02-28 10:52:01,385 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 33) no Hoare annotation was computed. [2019-02-28 10:52:01,385 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 36) no Hoare annotation was computed. [2019-02-28 10:52:01,385 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-02-28 10:52:01,398 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 10:52:01 BoogieIcfgContainer [2019-02-28 10:52:01,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 10:52:01,399 INFO L168 Benchmark]: Toolchain (without parser) took 17634.04 ms. Allocated memory was 132.1 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 107.3 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 115.4 MB. Max. memory is 7.1 GB. [2019-02-28 10:52:01,401 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.1 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:52:01,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.38 ms. Allocated memory is still 132.1 MB. Free memory was 107.3 MB in the beginning and 104.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-02-28 10:52:01,403 INFO L168 Benchmark]: Boogie Preprocessor took 21.33 ms. Allocated memory is still 132.1 MB. Free memory was 104.8 MB in the beginning and 103.9 MB in the end (delta: 917.9 kB). Peak memory consumption was 917.9 kB. Max. memory is 7.1 GB. [2019-02-28 10:52:01,404 INFO L168 Benchmark]: RCFGBuilder took 346.03 ms. Allocated memory is still 132.1 MB. Free memory was 103.9 MB in the beginning and 94.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-02-28 10:52:01,405 INFO L168 Benchmark]: TraceAbstraction took 17211.17 ms. Allocated memory was 132.1 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 94.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. [2019-02-28 10:52:01,410 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.20 ms. Allocated memory is still 132.1 MB. Free memory is still 108.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 51.38 ms. Allocated memory is still 132.1 MB. Free memory was 107.3 MB in the beginning and 104.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.33 ms. Allocated memory is still 132.1 MB. Free memory was 104.8 MB in the beginning and 103.9 MB in the end (delta: 917.9 kB). Peak memory consumption was 917.9 kB. Max. memory is 7.1 GB. * RCFGBuilder took 346.03 ms. Allocated memory is still 132.1 MB. Free memory was 103.9 MB in the beginning and 94.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17211.17 ms. Allocated memory was 132.1 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 94.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 102.1 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_126 : int, v_idx_129 : int, v_idx_123 : int, v_idx_131 : int :: (((((p2 <= ptr && p1 + 1 <= ptr) && ptr <= p2) && p1 + 1 <= p2) && ((((((2 * #memory_int[v_idx_131] <= 0 && #memory_int[v_idx_131] <= 0) || v_idx_131 < p2) || p2 + 1 <= v_idx_131) && p1 + 1 <= v_idx_129) || ((0 <= 2 * #memory_int[v_idx_129] && 0 <= #memory_int[v_idx_129]) && ((v_idx_131 < p2 || p2 + 1 <= v_idx_131) || ((2 * #memory_int[v_idx_131] <= 0 && #memory_int[v_idx_131] <= #memory_int[v_idx_129]) && #memory_int[v_idx_131] <= 0)))) || ((((2 * #memory_int[v_idx_131] <= 0 && #memory_int[v_idx_131] <= 0) || v_idx_131 < p2) || p2 + 1 <= v_idx_131) && v_idx_129 < p1))) && ((p2 + 1 <= v_idx_123 || 0 == old(malloc_old_#valid)[v_idx_123]) || v_idx_123 < p2)) && ((p2 + 1 <= v_idx_126 || v_idx_126 < p2) || 1 == #valid[v_idx_126])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 17.1s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10 SDtfs, 7 SDslu, 1 SDs, 0 SdLazy, 15 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 4 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, 14.0s AbstIntTime, 3 AbstIntIterations, 3 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 4 NumberOfFragments, 143 HoareAnnotationTreeSize, 1 FomulaSimplifications, 939 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s 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...