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-1-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 14:26:36,453 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 14:26:36,455 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 14:26:36,467 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 14:26:36,468 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 14:26:36,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 14:26:36,470 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 14:26:36,473 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 14:26:36,475 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 14:26:36,478 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 14:26:36,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 14:26:36,479 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 14:26:36,480 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 14:26:36,486 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 14:26:36,488 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 14:26:36,488 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 14:26:36,495 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 14:26:36,497 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 14:26:36,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 14:26:36,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 14:26:36,509 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 14:26:36,510 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 14:26:36,515 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 14:26:36,516 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 14:26:36,516 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 14:26:36,517 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 14:26:36,518 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 14:26:36,519 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 14:26:36,519 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 14:26:36,520 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 14:26:36,521 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 14:26:36,521 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 14:26:36,521 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 14:26:36,522 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 14:26:36,524 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 14:26:36,525 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 14:26:36,526 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 [2018-12-24 14:26:36,539 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 14:26:36,539 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 14:26:36,543 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 14:26:36,543 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 14:26:36,544 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 14:26:36,544 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 14:26:36,544 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 14:26:36,544 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 14:26:36,544 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 14:26:36,545 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-24 14:26:36,545 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-24 14:26:36,545 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 14:26:36,545 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 14:26:36,547 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 14:26:36,547 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 14:26:36,547 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 14:26:36,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 14:26:36,548 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 14:26:36,548 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 14:26:36,548 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 14:26:36,549 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 14:26:36,549 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 14:26:36,549 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 14:26:36,549 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 14:26:36,549 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 14:26:36,550 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 14:26:36,550 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 14:26:36,550 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 14:26:36,550 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 14:26:36,550 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 14:26:36,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:26:36,553 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 14:26:36,553 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 14:26:36,553 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 14:26:36,553 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 14:26:36,554 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 14:26:36,554 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 14:26:36,554 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 14:26:36,554 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 14:26:36,597 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 14:26:36,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 14:26:36,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 14:26:36,614 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 14:26:36,614 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 14:26:36,615 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 [2018-12-24 14:26:36,615 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-unlimited.bpl' [2018-12-24 14:26:36,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 14:26:36,651 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 14:26:36,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 14:26:36,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 14:26:36,653 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 14:26:36,670 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 24.12 02:26:36" (1/1) ... [2018-12-24 14:26:36,683 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 24.12 02:26:36" (1/1) ... [2018-12-24 14:26:36,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 14:26:36,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 14:26:36,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 14:26:36,712 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 14:26:36,725 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 24.12 02:26:36" (1/1) ... [2018-12-24 14:26:36,725 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 24.12 02:26:36" (1/1) ... [2018-12-24 14:26:36,726 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 24.12 02:26:36" (1/1) ... [2018-12-24 14:26:36,726 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 24.12 02:26:36" (1/1) ... [2018-12-24 14:26:36,728 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 24.12 02:26:36" (1/1) ... [2018-12-24 14:26:36,734 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 24.12 02:26:36" (1/1) ... [2018-12-24 14:26:36,735 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 24.12 02:26:36" (1/1) ... [2018-12-24 14:26:36,736 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 14:26:36,737 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 14:26:36,737 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 14:26:36,737 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 14:26:36,741 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 24.12 02:26:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 14:26:36,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-24 14:26:36,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-24 14:26:36,953 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-24 14:26:36,953 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-24 14:26:36,954 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 02:26:36 BoogieIcfgContainer [2018-12-24 14:26:36,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 14:26:36,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 14:26:36,955 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 14:26:36,958 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 14:26:36,959 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 24.12 02:26:36" (1/2) ... [2018-12-24 14:26:36,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@763618f3 and model type speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 02:26:36, skipping insertion in model container [2018-12-24 14:26:36,960 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 24.12 02:26:36" (2/2) ... [2018-12-24 14:26:36,962 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-1-unlimited.bpl [2018-12-24 14:26:36,972 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 14:26:36,980 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-24 14:26:36,998 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-24 14:26:37,026 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 14:26:37,027 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 14:26:37,027 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 14:26:37,027 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 14:26:37,027 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 14:26:37,028 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 14:26:37,028 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 14:26:37,028 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 14:26:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-12-24 14:26:37,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-24 14:26:37,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:37,048 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-24 14:26:37,050 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:37,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:37,055 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-12-24 14:26:37,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:37,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:37,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:37,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:37,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:37,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:37,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 14:26:37,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 14:26:37,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:26:37,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 14:26:37,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 14:26:37,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 14:26:37,222 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-12-24 14:26:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:37,278 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-24 14:26:37,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 14:26:37,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-24 14:26:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:37,293 INFO L225 Difference]: With dead ends: 9 [2018-12-24 14:26:37,293 INFO L226 Difference]: Without dead ends: 4 [2018-12-24 14:26:37,297 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 [2018-12-24 14:26:37,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-12-24 14:26:37,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-12-24 14:26:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-24 14:26:37,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-12-24 14:26:37,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-12-24 14:26:37,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:37,337 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-12-24 14:26:37,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 14:26:37,338 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-12-24 14:26:37,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 14:26:37,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:37,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 14:26:37,339 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:37,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:37,339 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-12-24 14:26:37,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:37,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:37,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:37,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:37,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:37,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:37,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:37,511 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-24 14:26:37,513 INFO L207 CegarAbsIntRunner]: [0], [4], [6] [2018-12-24 14:26:37,572 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-24 14:26:37,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 14:26:41,958 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-24 14:26:41,960 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. [2018-12-24 14:26:41,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:41,972 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-24 14:26:42,126 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 60% of their original sizes. [2018-12-24 14:26:42,127 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2018-12-24 14:26:44,173 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_45 Int) (v_idx_43 Int) (v_idx_44 Int)) (exists ((v_b_74_1 Int) (v_b_75_1 Int) (v_v_829_1 Int) (v_v_830_1 Int) (v_v_831_1 Int)) (let ((.cse1 (+ v_b_74_1 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 1))) (and (<= c_ULTIMATE.start_main_p1 v_b_74_1) (<= v_b_75_1 .cse0) (or (<= v_b_75_1 v_idx_44) (= v_v_830_1 (select |c_#memory_int| v_idx_44)) (< v_idx_44 v_b_74_1)) (<= .cse1 v_b_75_1) (<= 0 (* 2 v_v_830_1)) (or (= v_v_831_1 (select |c_#memory_int| v_idx_45)) (< v_idx_45 v_b_75_1)) (<= v_b_74_1 c_ULTIMATE.start_main_p1) (or (= v_v_829_1 (select |c_#memory_int| v_idx_43)) (<= v_b_74_1 v_idx_43)) (<= v_b_75_1 .cse1) (<= .cse0 v_b_75_1))))) is different from false [2018-12-24 14:26:46,333 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_47 Int) (v_idx_48 Int) (v_idx_46 Int)) (exists ((v_b_74_1 Int) (v_b_75_1 Int) (v_v_829_1 Int) (v_v_830_1 Int) (v_v_831_1 Int)) (let ((.cse1 (+ v_b_74_1 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 1))) (and (<= c_ULTIMATE.start_main_p1 v_b_74_1) (<= v_b_75_1 .cse0) (<= .cse1 v_b_75_1) (<= 0 (* 2 v_v_830_1)) (<= v_b_74_1 c_ULTIMATE.start_main_p1) (<= v_b_75_1 .cse1) (or (= v_v_830_1 (select |c_#memory_int| v_idx_47)) (<= v_b_75_1 v_idx_47) (< v_idx_47 v_b_74_1)) (or (< v_idx_48 v_b_75_1) (= v_v_831_1 (select |c_#memory_int| v_idx_48))) (or (= v_v_829_1 (select |c_#memory_int| v_idx_46)) (<= v_b_74_1 v_idx_46)) (<= .cse0 v_b_75_1))))) is different from false [2018-12-24 14:26:46,350 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2018-12-24 14:26:46,350 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-24 14:26:46,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-24 14:26:46,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2018-12-24 14:26:46,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:26:46,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 14:26:46,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 14:26:46,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=3, Unknown=2, NotChecked=2, Total=12 [2018-12-24 14:26:46,354 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-12-24 14:26:48,512 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_45 Int) (v_idx_43 Int) (v_idx_44 Int)) (exists ((v_b_74_1 Int) (v_b_75_1 Int) (v_v_829_1 Int) (v_v_830_1 Int) (v_v_831_1 Int)) (let ((.cse1 (+ v_b_74_1 1)) (.cse0 (+ c_ULTIMATE.start_main_p1 1))) (and (<= c_ULTIMATE.start_main_p1 v_b_74_1) (<= v_b_75_1 .cse0) (or (<= v_b_75_1 v_idx_44) (= v_v_830_1 (select |c_#memory_int| v_idx_44)) (< v_idx_44 v_b_74_1)) (<= .cse1 v_b_75_1) (<= 0 (* 2 v_v_830_1)) (or (= v_v_831_1 (select |c_#memory_int| v_idx_45)) (< v_idx_45 v_b_75_1)) (<= v_b_74_1 c_ULTIMATE.start_main_p1) (or (= v_v_829_1 (select |c_#memory_int| v_idx_43)) (<= v_b_74_1 v_idx_43)) (<= v_b_75_1 .cse1) (<= .cse0 v_b_75_1))))) (forall ((v_idx_47 Int) (v_idx_48 Int) (v_idx_46 Int)) (exists ((v_b_74_1 Int) (v_b_75_1 Int) (v_v_829_1 Int) (v_v_830_1 Int) (v_v_831_1 Int)) (let ((.cse3 (+ v_b_74_1 1)) (.cse2 (+ c_ULTIMATE.start_main_p1 1))) (and (<= c_ULTIMATE.start_main_p1 v_b_74_1) (<= v_b_75_1 .cse2) (<= .cse3 v_b_75_1) (<= 0 (* 2 v_v_830_1)) (<= v_b_74_1 c_ULTIMATE.start_main_p1) (<= v_b_75_1 .cse3) (or (= v_v_830_1 (select |c_#memory_int| v_idx_47)) (<= v_b_75_1 v_idx_47) (< v_idx_47 v_b_74_1)) (or (< v_idx_48 v_b_75_1) (= v_v_831_1 (select |c_#memory_int| v_idx_48))) (or (= v_v_829_1 (select |c_#memory_int| v_idx_46)) (<= v_b_74_1 v_idx_46)) (<= .cse2 v_b_75_1)))))) is different from false [2018-12-24 14:26:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:52,655 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-24 14:26:52,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 14:26:52,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-24 14:26:52,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:52,656 INFO L225 Difference]: With dead ends: 6 [2018-12-24 14:26:52,656 INFO L226 Difference]: Without dead ends: 5 [2018-12-24 14:26:52,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=7, Invalid=4, Unknown=3, NotChecked=6, Total=20 [2018-12-24 14:26:52,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-24 14:26:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-24 14:26:52,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-24 14:26:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-24 14:26:52,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-24 14:26:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:52,666 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-24 14:26:52,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 14:26:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-24 14:26:52,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 14:26:52,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 14:26:52,667 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-12-24 14:26:52,668 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 14:26:52,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 14:26:52,669 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-12-24 14:26:52,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 14:26:52,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:52,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 14:26:52,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 14:26:52,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 14:26:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 14:26:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:52,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:52,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 14:26:52,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 14:26:52,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 14:26:52,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 14:26:52,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 14:26:52,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 14:26:52,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 14:26:52,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-24 14:26:52,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 14:26:52,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 14:26:52,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 14:26:52,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:53,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:53,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-24 14:26:53,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:26:53,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2018-12-24 14:26:53,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:53,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:53,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-12-24 14:26:53,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-24 14:26:53,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2018-12-24 14:26:53,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 14:26:53,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 14:26:53,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-12-24 14:26:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:53,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 14:26:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 14:26:53,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-24 14:26:53,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 8 [2018-12-24 14:26:53,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 14:26:53,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-24 14:26:53,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-24 14:26:53,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-24 14:26:53,343 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-24 14:26:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 14:26:53,390 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-24 14:26:53,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 14:26:53,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-24 14:26:53,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 14:26:53,392 INFO L225 Difference]: With dead ends: 5 [2018-12-24 14:26:53,393 INFO L226 Difference]: Without dead ends: 0 [2018-12-24 14:26:53,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-12-24 14:26:53,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-24 14:26:53,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-24 14:26:53,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-24 14:26:53,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-24 14:26:53,394 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2018-12-24 14:26:53,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 14:26:53,395 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-24 14:26:53,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-24 14:26:53,395 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-24 14:26:53,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-24 14:26:53,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-24 14:26:53,430 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2018-12-24 14:26:53,430 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 28) no Hoare annotation was computed. [2018-12-24 14:26:53,430 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2018-12-24 14:26:53,430 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 26) no Hoare annotation was computed. [2018-12-24 14:26:53,431 INFO L444 ceAbstractionStarter]: At program point L21-1(lines 21 24) the Hoare annotation is: (<= 0 (select |#memory_int| ULTIMATE.start_main_p1)) [2018-12-24 14:26:53,436 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 02:26:53 BoogieIcfgContainer [2018-12-24 14:26:53,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-24 14:26:53,436 INFO L168 Benchmark]: Toolchain (without parser) took 16785.89 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -967.7 MB). Peak memory consumption was 50.4 MB. Max. memory is 7.1 GB. [2018-12-24 14:26:53,438 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 14:26:53,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 14:26:53,439 INFO L168 Benchmark]: Boogie Preprocessor took 24.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 14:26:53,440 INFO L168 Benchmark]: RCFGBuilder took 217.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-24 14:26:53,441 INFO L168 Benchmark]: TraceAbstraction took 16480.55 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -988.9 MB). Peak memory consumption was 29.3 MB. Max. memory is 7.1 GB. [2018-12-24 14:26:53,446 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 217.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16480.55 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -988.9 MB). Peak memory consumption was 29.3 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: 0 <= #memory_int[p1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 16.4s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 8 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 6.7s 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, 4.4s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 0.0 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 3 NumberOfFragments, 5 HoareAnnotationTreeSize, 1 FomulaSimplifications, 210 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 13 NumberOfCodeBlocks, 13 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 12 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 4/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...