java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:45:58,166 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:45:58,168 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:45:58,187 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:45:58,187 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:45:58,188 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:45:58,190 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:45:58,192 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:45:58,201 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:45:58,202 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:45:58,203 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:45:58,203 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:45:58,204 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:45:58,205 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:45:58,206 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:45:58,207 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:45:58,208 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:45:58,210 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:45:58,212 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:45:58,213 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:45:58,214 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:45:58,215 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:45:58,218 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:45:58,218 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:45:58,218 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:45:58,219 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:45:58,220 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:45:58,221 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:45:58,221 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:45:58,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:45:58,223 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:45:58,226 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:45:58,227 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:45:58,227 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:45:58,228 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:45:58,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:45:58,230 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 13:45:58,254 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:45:58,255 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:45:58,256 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:45:58,256 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:45:58,256 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:45:58,256 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:45:58,256 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:45:58,257 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:45:58,257 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:45:58,258 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 13:45:58,258 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 13:45:58,258 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:45:58,258 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:45:58,259 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:45:58,259 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:45:58,259 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:45:58,259 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:45:58,261 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:45:58,261 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:45:58,262 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:45:58,262 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:45:58,262 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:45:58,262 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:45:58,262 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:45:58,262 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:45:58,263 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:45:58,263 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:45:58,264 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:45:58,264 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:45:58,264 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:45:58,264 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:45:58,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:45:58,265 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:45:58,265 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:45:58,265 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:45:58,265 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:45:58,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:45:58,266 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:45:58,266 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:45:58,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:45:58,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:45:58,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:45:58,334 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:45:58,335 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:45:58,335 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-02-28 13:45:58,336 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-1-unlimited.bpl' [2019-02-28 13:45:58,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:45:58,386 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:45:58,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:45:58,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:45:58,387 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:45:58,406 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 28.02 01:45:58" (1/1) ... [2019-02-28 13:45:58,419 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 28.02 01:45:58" (1/1) ... [2019-02-28 13:45:58,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:45:58,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:45:58,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:45:58,449 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:45:58,460 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 28.02 01:45:58" (1/1) ... [2019-02-28 13:45:58,460 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 28.02 01:45:58" (1/1) ... [2019-02-28 13:45:58,462 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 28.02 01:45:58" (1/1) ... [2019-02-28 13:45:58,462 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 28.02 01:45:58" (1/1) ... [2019-02-28 13:45:58,464 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 28.02 01:45:58" (1/1) ... [2019-02-28 13:45:58,468 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 28.02 01:45:58" (1/1) ... [2019-02-28 13:45:58,470 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 28.02 01:45:58" (1/1) ... [2019-02-28 13:45:58,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:45:58,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:45:58,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:45:58,472 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:45:58,473 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 28.02 01:45:58" (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 13:45:58,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:45:58,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:45:58,715 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:45:58,715 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-02-28 13:45:58,717 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:45:58 BoogieIcfgContainer [2019-02-28 13:45:58,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:45:58,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:45:58,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:45:58,721 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:45:58,722 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 28.02 01:45:58" (1/2) ... [2019-02-28 13:45:58,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57ccb7b7 and model type speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:45:58, skipping insertion in model container [2019-02-28 13:45:58,723 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 28.02 01:45:58" (2/2) ... [2019-02-28 13:45:58,725 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-1-unlimited.bpl [2019-02-28 13:45:58,735 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:45:58,742 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 13:45:58,759 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 13:45:58,795 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:45:58,795 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:45:58,795 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:45:58,795 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:45:58,796 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:45:58,796 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:45:58,796 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:45:58,796 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:45:58,819 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-02-28 13:45:58,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 13:45:58,833 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:45:58,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 13:45:58,837 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:45:58,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:45:58,844 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2019-02-28 13:45:58,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:45:58,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:45:58,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:45:58,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:45:58,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:45:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:45:59,114 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-02-28 13:45:59,138 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-02-28 13:45:59,141 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 13:45:59,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:45:59,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:45:59,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:45:59,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:45:59,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:45:59,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:45:59,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:45:59,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:45:59,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:45:59,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:45:59,226 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-02-28 13:45:59,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:45:59,334 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-28 13:45:59,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:45:59,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:45:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:45:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:45:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-02-28 13:45:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:45:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-02-28 13:45:59,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9 transitions. [2019-02-28 13:45:59,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:45:59,386 INFO L225 Difference]: With dead ends: 9 [2019-02-28 13:45:59,386 INFO L226 Difference]: Without dead ends: 4 [2019-02-28 13:45:59,389 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 13:45:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2019-02-28 13:45:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2019-02-28 13:45:59,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:45:59,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4 states. Second operand 4 states. [2019-02-28 13:45:59,455 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2019-02-28 13:45:59,455 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2019-02-28 13:45:59,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:45:59,457 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-02-28 13:45:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-02-28 13:45:59,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:45:59,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:45:59,458 INFO L74 IsIncluded]: Start isIncluded. First operand 4 states. Second operand 4 states. [2019-02-28 13:45:59,459 INFO L87 Difference]: Start difference. First operand 4 states. Second operand 4 states. [2019-02-28 13:45:59,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:45:59,460 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-02-28 13:45:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-02-28 13:45:59,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:45:59,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:45:59,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:45:59,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:45:59,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:45:59,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2019-02-28 13:45:59,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2019-02-28 13:45:59,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:45:59,464 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2019-02-28 13:45:59,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:45:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2019-02-28 13:45:59,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:45:59,465 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:45:59,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:45:59,466 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:45:59,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:45:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2019-02-28 13:45:59,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:45:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:45:59,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:45:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:45:59,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:45:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:45:59,628 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-02-28 13:45:59,629 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-02-28 13:45:59,630 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-02-28 13:45:59,630 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 13:45:59,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:45:59,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:45:59,632 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:45:59,634 INFO L207 CegarAbsIntRunner]: [0], [4], [6] [2019-02-28 13:45:59,705 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:45:59,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:46:46,066 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-02-28 13:46:46,068 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 13:46:46,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:46:46,073 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-02-28 13:46:48,937 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-02-28 13:46:49,354 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-02-28 13:46:51,013 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-02-28 13:46:51,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-02-28 13:46:51,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-02-28 13:46:51,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:46:51,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:46:51,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:46:51,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:46:51,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:46:51,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:46:51,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:46:51,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:46:51,026 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 3 states. [2019-02-28 13:46:51,372 WARN L214 ngHoareTripleChecker]: Soundness check failed for the following hoare triple [2019-02-28 13:46:51,372 WARN L217 ngHoareTripleChecker]: Expected: UNKNOWN Actual: INVALID [2019-02-28 13:46:51,373 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:46:51,374 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:46:51,375 WARN L224 ngHoareTripleChecker]: Pre: {62#(forall ((v_idx_555 Int) (v_idx_558 Int) (v_idx_562 Int)) (and (<= (- (- c_ULTIMATE.start_main_p1) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p1) (<= c_ULTIMATE.start_main_p1 c_ULTIMATE.start_malloc_ptr) (or (<= (+ c_ULTIMATE.start_malloc_ptr 1) v_idx_555) (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_555)) (< v_idx_555 c_ULTIMATE.start_main_p1)) (or (<= (+ c_ULTIMATE.start_malloc_ptr 1) v_idx_562) (< v_idx_562 c_ULTIMATE.start_main_p1) (and (<= 0 (* 2 (select |c_#memory_int| v_idx_562))) (<= 0 (select |c_#memory_int| v_idx_562)))) (or (= 1 (select |c_#valid| v_idx_558)) (< v_idx_558 c_ULTIMATE.start_main_p1) (<= (+ c_ULTIMATE.start_malloc_ptr 1) v_idx_558)) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_malloc_ptr) 0)))} [2019-02-28 13:46:51,375 WARN L228 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; [2019-02-28 13:46:51,376 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p1 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p1) 1))) [2019-02-28 13:46:51,376 WARN L230 ngHoareTripleChecker]: Post: {63#false} [2019-02-28 13:46:51,377 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:46:51,378 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:46:51,378 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:46:51,546 WARN L270 ngHoareTripleChecker]: Pre: {62#(and (<= (- (- ULTIMATE.start_main_p1) (- ULTIMATE.start_malloc_ptr)) 0) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p1) (forall ((v_prenex_1 Int)) (or (<= (+ ULTIMATE.start_malloc_ptr 1) v_prenex_1) (< v_prenex_1 ULTIMATE.start_main_p1) (<= 0 (* 2 (select |#memory_int| v_prenex_1))))) (<= ULTIMATE.start_main_p1 ULTIMATE.start_malloc_ptr) (forall ((v_idx_562 Int)) (or (<= (+ ULTIMATE.start_malloc_ptr 1) v_idx_562) (<= 0 (select |#memory_int| v_idx_562)) (< v_idx_562 ULTIMATE.start_main_p1))) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_malloc_ptr) 0) (forall ((v_idx_555 Int)) (or (<= (+ ULTIMATE.start_malloc_ptr 1) v_idx_555) (= 0 (select |ULTIMATE.start_malloc_old_#valid| v_idx_555)) (< v_idx_555 ULTIMATE.start_main_p1))) (forall ((v_idx_558 Int)) (or (= 1 (select |#valid| v_idx_558)) (< v_idx_558 ULTIMATE.start_main_p1) (<= (+ ULTIMATE.start_malloc_ptr 1) v_idx_558))))} [2019-02-28 13:46:51,546 WARN L274 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; [2019-02-28 13:46:51,548 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p1 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p1) 1))) [2019-02-28 13:46:51,552 WARN L276 ngHoareTripleChecker]: Post: {63#false} [2019-02-28 13:46:51,552 WARN L620 ntHoareTripleChecker]: -- [2019-02-28 13:46:51,553 WARN L621 ntHoareTripleChecker]: Abstract states [2019-02-28 13:46:51,554 WARN L623 ntHoareTripleChecker]: PreS: {#1{Arrays: {[#memory_int] -> [-inf_0] v_1016 [b_74] v_1017 [b_75] v_1018 [inf_0], [#valid] -> [-inf_0] v_1013 [b_72] v_1014 [b_73] v_1015 [inf_0], [ULTIMATE.start_malloc_old_#valid] -> [-inf_0] v_1009 [b_70] v_1010 [b_71] v_1011 [inf_0], [old(#memory_int)] -> [-inf_0] v_1525 [inf_0], [old(#valid)] -> [-inf_0] v_1524 [inf_0], }, Substate: {ints: {v_1010 = [0; 0]; v_1014 = [1; 1]; v_1017 = [0; inf]}, 16 vars top, relations: {b_74 - b_75 = [-1; -1]; b_71 - b_75 = [0; 0]; ULTIMATE.start_malloc_ptr - b_75 = [-1; -1]; b_73 - b_75 = [0; 0]; ULTIMATE.start_main_p1 - b_75 = [-1; -1]; b_70 - b_75 = [-1; -1]; b_72 - b_75 = [-1; -1]; b_71 - b_74 = [1; 1]; ULTIMATE.start_malloc_ptr - b_74 = [0; 0]; b_73 - b_74 = [1; 1]; ULTIMATE.start_main_p1 - b_74 = [0; 0]; b_70 - b_74 = [0; 0]; b_72 - b_74 = [0; 0]; v_1010 + v_1014 = [1; 1]; v_1010 - v_1014 = [-1; -1]; ULTIMATE.start_malloc_ptr - b_71 = [-1; -1]; ULTIMATE.start_main_p1 - b_71 = [-1; -1]; b_70 - b_71 = [-1; -1]; ULTIMATE.start_main_p1 - ULTIMATE.start_malloc_ptr = [0; 0]; b_71 - b_73 = [0; 0]; ULTIMATE.start_malloc_ptr - b_73 = [-1; -1]; ULTIMATE.start_main_p1 - b_73 = [-1; -1]; b_70 - b_73 = [-1; -1]; b_72 - b_73 = [-1; -1]; v_1010 + v_1017 = [0; inf]; v_1010 - v_1017 = [-inf; 0]; v_1014 + v_1017 = [1; inf]; v_1014 - v_1017 = [-inf; 1]; ULTIMATE.start_malloc_ptr - b_70 = [0; 0]; ULTIMATE.start_main_p1 - b_70 = [0; 0]; b_71 - b_72 = [1; 1]; ULTIMATE.start_malloc_ptr - b_72 = [0; 0]; ULTIMATE.start_main_p1 - b_72 = [0; 0]; b_70 - b_72 = [0; 0]}, }}} [2019-02-28 13:46:51,555 WARN L628 ntHoareTripleChecker]: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p1 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p1) 1))) (#memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1];) [2019-02-28 13:46:51,555 WARN L629 ntHoareTripleChecker]: Post: {#1{Arrays: {}, Substate: false}} [2019-02-28 13:46:51,555 WARN L630 ntHoareTripleChecker]: -- [2019-02-28 13:46:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:46:51,692 INFO L93 Difference]: Finished difference Result 4 states and 4 transitions. [2019-02-28 13:46:51,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:46:51,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:46:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:46:51,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:46:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-02-28 13:46:51,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:46:51,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-02-28 13:46:51,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 3 transitions. [2019-02-28 13:46:51,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:46:51,732 INFO L225 Difference]: With dead ends: 4 [2019-02-28 13:46:51,732 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 13:46:51,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 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 13:46:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 13:46:51,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 13:46:51,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:46:51,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-28 13:46:51,734 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-28 13:46:51,735 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-28 13:46:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:46:51,735 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-28 13:46:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:46:51,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:46:51,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:46:51,736 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-28 13:46:51,736 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-28 13:46:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:46:51,737 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-28 13:46:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:46:51,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:46:51,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:46:51,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:46:51,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:46:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 13:46:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 13:46:51,738 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2019-02-28 13:46:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:46:51,739 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 13:46:51,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:46:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 13:46:51,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:46:51,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 13:46:51,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-28 13:46:51,918 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 28) no Hoare annotation was computed. [2019-02-28 13:46:51,918 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-28 13:46:51,918 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 26) no Hoare annotation was computed. [2019-02-28 13:46:51,918 INFO L444 ceAbstractionStarter]: At program point L21-1(lines 21 24) the Hoare annotation is: (forall ((v_idx_447 Int) (v_idx_453 Int) (v_idx_450 Int)) (let ((.cse0 (+ ULTIMATE.start_malloc_ptr 1))) (and (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p1) (or (< v_idx_450 ULTIMATE.start_main_p1) (<= .cse0 v_idx_450) (= (select |#valid| v_idx_450) 1)) (<= ULTIMATE.start_main_p1 ULTIMATE.start_malloc_ptr) (or (< v_idx_453 ULTIMATE.start_main_p1) (<= .cse0 v_idx_453) (let ((.cse1 (select |#memory_int| v_idx_453))) (and (<= 0 (* 2 .cse1)) (<= 0 .cse1)))) (or (<= .cse0 v_idx_447) (= 0 (select |ULTIMATE.start_malloc_old_#valid| v_idx_447)) (< v_idx_447 ULTIMATE.start_main_p1))))) [2019-02-28 13:46:51,920 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-02-28 13:46:51,923 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-28 13:46:51,923 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2019-02-28 13:46:51,923 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2019-02-28 13:46:51,923 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-02-28 13:46:51,932 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-1-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 01:46:51 BoogieIcfgContainer [2019-02-28 13:46:51,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 13:46:51,933 INFO L168 Benchmark]: Toolchain (without parser) took 53548.31 ms. Allocated memory was 139.5 MB in the beginning and 790.1 MB in the end (delta: 650.6 MB). Free memory was 107.0 MB in the beginning and 619.8 MB in the end (delta: -512.8 MB). Peak memory consumption was 137.8 MB. Max. memory is 7.1 GB. [2019-02-28 13:46:51,935 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 13:46:51,936 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.12 ms. Allocated memory is still 139.5 MB. Free memory was 107.0 MB in the beginning and 104.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-28 13:46:51,937 INFO L168 Benchmark]: Boogie Preprocessor took 23.08 ms. Allocated memory is still 139.5 MB. Free memory was 104.7 MB in the beginning and 103.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-28 13:46:51,938 INFO L168 Benchmark]: RCFGBuilder took 245.48 ms. Allocated memory is still 139.5 MB. Free memory was 103.5 MB in the beginning and 93.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-02-28 13:46:51,939 INFO L168 Benchmark]: TraceAbstraction took 53213.94 ms. Allocated memory was 139.5 MB in the beginning and 790.1 MB in the end (delta: 650.6 MB). Free memory was 93.4 MB in the beginning and 619.8 MB in the end (delta: -526.3 MB). Peak memory consumption was 124.3 MB. Max. memory is 7.1 GB. [2019-02-28 13:46:51,944 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 139.5 MB. Free memory is still 107.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.12 ms. Allocated memory is still 139.5 MB. Free memory was 107.0 MB in the beginning and 104.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.08 ms. Allocated memory is still 139.5 MB. Free memory was 104.7 MB in the beginning and 103.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 245.48 ms. Allocated memory is still 139.5 MB. Free memory was 103.5 MB in the beginning and 93.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 53213.94 ms. Allocated memory was 139.5 MB in the beginning and 790.1 MB in the end (delta: 650.6 MB). Free memory was 93.4 MB in the beginning and 619.8 MB in the end (delta: -526.3 MB). Peak memory consumption was 124.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: (forall v_idx_447 : int, v_idx_453 : int, v_idx_450 : int :: (((ptr <= p1 && ((v_idx_450 < p1 || ptr + 1 <= v_idx_450) || #valid[v_idx_450] == 1)) && p1 <= ptr) && ((v_idx_453 < p1 || ptr + 1 <= v_idx_453) || (0 <= 2 * #memory_int[v_idx_453] && 0 <= #memory_int[v_idx_453]))) && ((ptr + 1 <= v_idx_447 || 0 == old(malloc_old_#valid)[v_idx_447]) || v_idx_447 < p1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 53.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 4 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 5 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 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, 46.4s AbstIntTime, 1 AbstIntIterations, 1 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, 58 HoareAnnotationTreeSize, 1 FomulaSimplifications, 65 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 25 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...