java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1377b90 [2019-01-07 14:15:00,995 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 14:15:00,998 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 14:15:01,011 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 14:15:01,011 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 14:15:01,012 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 14:15:01,014 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 14:15:01,015 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 14:15:01,017 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 14:15:01,018 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 14:15:01,019 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 14:15:01,019 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 14:15:01,020 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 14:15:01,021 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 14:15:01,022 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 14:15:01,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 14:15:01,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 14:15:01,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 14:15:01,028 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 14:15:01,029 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 14:15:01,030 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 14:15:01,032 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 14:15:01,034 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 14:15:01,034 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 14:15:01,035 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 14:15:01,036 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 14:15:01,037 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 14:15:01,038 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 14:15:01,038 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 14:15:01,040 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 14:15:01,042 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 14:15:01,043 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 14:15:01,043 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 14:15:01,043 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 14:15:01,044 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 14:15:01,045 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 14:15:01,045 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-07 14:15:01,062 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 14:15:01,063 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 14:15:01,063 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 14:15:01,064 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 14:15:01,064 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 14:15:01,064 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 14:15:01,064 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 14:15:01,064 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 14:15:01,065 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 14:15:01,065 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 14:15:01,065 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 14:15:01,065 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 14:15:01,065 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 14:15:01,066 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 14:15:01,066 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 14:15:01,067 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 14:15:01,067 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 14:15:01,067 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 14:15:01,067 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 14:15:01,068 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 14:15:01,068 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 14:15:01,068 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 14:15:01,068 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 14:15:01,068 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 14:15:01,069 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 14:15:01,069 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 14:15:01,069 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 14:15:01,069 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 14:15:01,070 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 14:15:01,070 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 14:15:01,070 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 14:15:01,070 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:15:01,071 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 14:15:01,071 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 14:15:01,071 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 14:15:01,071 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 14:15:01,072 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 14:15:01,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 14:15:01,072 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 14:15:01,072 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 14:15:01,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 14:15:01,138 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 14:15:01,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 14:15:01,146 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 14:15:01,146 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 14:15:01,147 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-unlimited.bpl [2019-01-07 14:15:01,148 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-unlimited.bpl' [2019-01-07 14:15:01,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 14:15:01,201 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 14:15:01,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 14:15:01,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 14:15:01,203 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 14:15:01,221 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 07.01 02:15:01" (1/1) ... [2019-01-07 14:15:01,235 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 07.01 02:15:01" (1/1) ... [2019-01-07 14:15:01,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 14:15:01,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 14:15:01,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 14:15:01,266 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 14:15:01,279 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 07.01 02:15:01" (1/1) ... [2019-01-07 14:15:01,279 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 07.01 02:15:01" (1/1) ... [2019-01-07 14:15:01,280 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 07.01 02:15:01" (1/1) ... [2019-01-07 14:15:01,280 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 07.01 02:15:01" (1/1) ... [2019-01-07 14:15:01,283 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 07.01 02:15:01" (1/1) ... [2019-01-07 14:15:01,288 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 07.01 02:15:01" (1/1) ... [2019-01-07 14:15:01,289 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 07.01 02:15:01" (1/1) ... [2019-01-07 14:15:01,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 14:15:01,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 14:15:01,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 14:15:01,292 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 14:15:01,293 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 07.01 02:15:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:15:01,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 14:15:01,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 14:15:01,608 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 14:15:01,608 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-07 14:15:01,609 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:15:01 BoogieIcfgContainer [2019-01-07 14:15:01,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 14:15:01,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 14:15:01,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 14:15:01,614 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 14:15:01,614 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 07.01 02:15:01" (1/2) ... [2019-01-07 14:15:01,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b044474 and model type speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:15:01, skipping insertion in model container [2019-01-07 14:15:01,616 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 07.01 02:15:01" (2/2) ... [2019-01-07 14:15:01,618 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-1-unlimited.bpl [2019-01-07 14:15:01,628 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 14:15:01,638 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 14:15:01,656 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 14:15:01,685 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 14:15:01,685 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 14:15:01,685 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 14:15:01,685 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 14:15:01,685 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 14:15:01,686 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 14:15:01,686 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 14:15:01,686 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 14:15:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-01-07 14:15:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 14:15:01,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:15:01,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 14:15:01,711 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:15:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:15:01,717 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2019-01-07 14:15:01,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:15:01,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:15:01,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:15:01,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:15:01,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:15:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:15:01,967 INFO L273 TraceCheckUtils]: 0: Hoare triple {8#true} havoc main_p1;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0]; {10#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-07 14:15:01,986 INFO L273 TraceCheckUtils]: 1: Hoare triple {10#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {9#false} is VALID [2019-01-07 14:15:01,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:15:01,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:15:01,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 14:15:01,994 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:15:02,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 14:15:02,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:15:02,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 14:15:02,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:15:02,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 14:15:02,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 14:15:02,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:15:02,057 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-01-07 14:15:02,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:15:02,188 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-07 14:15:02,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 14:15:02,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 14:15:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:15:02,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:15:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-07 14:15:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:15:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-07 14:15:02,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9 transitions. [2019-01-07 14:15:02,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:15:02,241 INFO L225 Difference]: With dead ends: 9 [2019-01-07 14:15:02,241 INFO L226 Difference]: Without dead ends: 4 [2019-01-07 14:15:02,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:15:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-01-07 14:15:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-01-07 14:15:02,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:15:02,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4 states. Second operand 4 states. [2019-01-07 14:15:02,315 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2019-01-07 14:15:02,315 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2019-01-07 14:15:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:15:02,317 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-01-07 14:15:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-01-07 14:15:02,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:15:02,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:15:02,318 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2019-01-07 14:15:02,318 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2019-01-07 14:15:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:15:02,320 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-01-07 14:15:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-01-07 14:15:02,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:15:02,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:15:02,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:15:02,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:15:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:15:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-01-07 14:15:02,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-01-07 14:15:02,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:15:02,324 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-01-07 14:15:02,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 14:15:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-01-07 14:15:02,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 14:15:02,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:15:02,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 14:15:02,326 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:15:02,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:15:02,326 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2019-01-07 14:15:02,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:15:02,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:15:02,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:15:02,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:15:02,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:15:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:15:02,498 INFO L273 TraceCheckUtils]: 0: Hoare triple {38#true} havoc main_p1;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0]; {40#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-07 14:15:02,501 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {41#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-07 14:15:02,502 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {39#false} is VALID [2019-01-07 14:15:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:15:02,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:15:02,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:15:02,505 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 14:15:02,507 INFO L207 CegarAbsIntRunner]: [0], [4], [6] [2019-01-07 14:15:02,547 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 14:15:02,547 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:15:02,659 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 14:15:02,661 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 14 root evaluator evaluations with a maximum evaluation depth of 2. Performed 14 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 14:15:02,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:15:02,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 14:15:02,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:15:02,668 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 [2019-01-07 14:15:02,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:15:02,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 14:15:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:15:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:15:02,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:15:02,763 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 [2019-01-07 14:15:02,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 14:15:02,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:15:02,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-07 14:15:02,815 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:15:02,815 WARN L385 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_7|]. (= |#memory_int| (store |v_#memory_int_7| ULTIMATE.start_main_p1 0)) [2019-01-07 14:15:02,815 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 0) [2019-01-07 14:15:02,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 14:15:02,982 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 [2019-01-07 14:15:03,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 14:15:03,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 14:15:03,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-07 14:15:03,028 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 14:15:03,028 WARN L385 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_8|]. (let ((.cse0 (select |v_#memory_int_8| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_8| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|))) [2019-01-07 14:15:03,028 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#memory_int| ULTIMATE.start_main_p1) 1) [2019-01-07 14:15:03,104 INFO L273 TraceCheckUtils]: 0: Hoare triple {38#true} havoc main_p1;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0]; {40#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-07 14:15:03,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {40#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {48#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} is VALID [2019-01-07 14:15:03,121 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(= (select |#memory_int| ULTIMATE.start_main_p1) 1)} assume !(#memory_int[main_p1] >= 0); {39#false} is VALID [2019-01-07 14:15:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:15:03,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:15:03,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {39#false} is VALID [2019-01-07 14:15:03,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {56#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {52#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-07 14:15:03,234 INFO L273 TraceCheckUtils]: 0: Hoare triple {38#true} havoc main_p1;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0]; {56#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} is VALID [2019-01-07 14:15:03,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:15:03,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 14:15:03,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-07 14:15:03,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:15:03,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 14:15:03,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:15:03,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 14:15:03,271 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:15:03,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 14:15:03,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 14:15:03,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-07 14:15:03,272 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2019-01-07 14:15:03,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:15:03,353 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-01-07 14:15:03,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 14:15:03,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 14:15:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:15:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:15:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-01-07 14:15:03,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:15:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-01-07 14:15:03,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 3 transitions. [2019-01-07 14:15:03,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:15:03,373 INFO L225 Difference]: With dead ends: 4 [2019-01-07 14:15:03,373 INFO L226 Difference]: Without dead ends: 0 [2019-01-07 14:15:03,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-07 14:15:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-07 14:15:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-07 14:15:03,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:15:03,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-07 14:15:03,376 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 14:15:03,376 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 14:15:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:15:03,376 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 14:15:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:15:03,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:15:03,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:15:03,377 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-07 14:15:03,377 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-07 14:15:03,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:15:03,378 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-07 14:15:03,378 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:15:03,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:15:03,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:15:03,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:15:03,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:15:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-07 14:15:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-07 14:15:03,379 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2019-01-07 14:15:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:15:03,379 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-07 14:15:03,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 14:15:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-07 14:15:03,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:15:03,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-07 14:15:03,413 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-07 14:15:03,413 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 28) no Hoare annotation was computed. [2019-01-07 14:15:03,413 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-07 14:15:03,414 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 26) no Hoare annotation was computed. [2019-01-07 14:15:03,414 INFO L444 ceAbstractionStarter]: At program point L21-1(lines 21 24) the Hoare annotation is: (<= 0 (select |#memory_int| ULTIMATE.start_main_p1)) [2019-01-07 14:15:03,416 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-01-07 14:15:03,417 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-01-07 14:15:03,417 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2019-01-07 14:15:03,417 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2019-01-07 14:15:03,418 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-07 14:15:03,425 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 02:15:03 BoogieIcfgContainer [2019-01-07 14:15:03,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-07 14:15:03,427 INFO L168 Benchmark]: Toolchain (without parser) took 2227.19 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: 97.8 MB). Peak memory consumption was 97.8 MB. Max. memory is 7.1 GB. [2019-01-07 14:15:03,429 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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. [2019-01-07 14:15:03,430 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.17 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. [2019-01-07 14:15:03,431 INFO L168 Benchmark]: Boogie Preprocessor took 25.32 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. [2019-01-07 14:15:03,432 INFO L168 Benchmark]: RCFGBuilder took 318.13 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. [2019-01-07 14:15:03,432 INFO L168 Benchmark]: TraceAbstraction took 1815.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 76.7 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. [2019-01-07 14:15:03,437 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 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 63.17 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 25.32 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 318.13 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 1815.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 76.7 MB). Peak memory consumption was 76.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 <= #memory_int[p1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s 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, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 5 HoareAnnotationTreeSize, 1 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 69 SizeOfPredicates, 0 NumberOfNonLiveVariables, 11 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 1/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...