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-10-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-15a42f0 [2018-12-18 22:30:55,230 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-18 22:30:55,232 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-18 22:30:55,253 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-18 22:30:55,253 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-18 22:30:55,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-18 22:30:55,258 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-18 22:30:55,261 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-18 22:30:55,264 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-18 22:30:55,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-18 22:30:55,266 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-18 22:30:55,275 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-18 22:30:55,276 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-18 22:30:55,277 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-18 22:30:55,282 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-18 22:30:55,283 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-18 22:30:55,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-18 22:30:55,285 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-18 22:30:55,292 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-18 22:30:55,295 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-18 22:30:55,296 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-18 22:30:55,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-18 22:30:55,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-18 22:30:55,303 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-18 22:30:55,304 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-18 22:30:55,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-18 22:30:55,306 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-18 22:30:55,307 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-18 22:30:55,309 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-18 22:30:55,311 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-18 22:30:55,311 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-18 22:30:55,312 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-18 22:30:55,312 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-18 22:30:55,312 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-18 22:30:55,314 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-18 22:30:55,315 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-18 22:30:55,316 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-18 22:30:55,337 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-18 22:30:55,337 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-18 22:30:55,339 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-18 22:30:55,339 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-18 22:30:55,339 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-18 22:30:55,339 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-18 22:30:55,340 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-18 22:30:55,340 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-18 22:30:55,340 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-18 22:30:55,340 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-18 22:30:55,340 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-18 22:30:55,341 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-18 22:30:55,341 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-18 22:30:55,342 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-18 22:30:55,342 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-18 22:30:55,344 INFO L133 SettingsManager]: * Use SBE=true [2018-12-18 22:30:55,345 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-18 22:30:55,345 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-18 22:30:55,345 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-18 22:30:55,345 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-18 22:30:55,345 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-18 22:30:55,346 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-18 22:30:55,347 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-18 22:30:55,347 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-18 22:30:55,347 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-18 22:30:55,347 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-18 22:30:55,347 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-18 22:30:55,348 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-18 22:30:55,348 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-18 22:30:55,348 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-18 22:30:55,348 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:30:55,349 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-18 22:30:55,349 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-18 22:30:55,349 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-18 22:30:55,349 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-18 22:30:55,349 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-18 22:30:55,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-18 22:30:55,350 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-18 22:30:55,350 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-18 22:30:55,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-18 22:30:55,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-18 22:30:55,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-18 22:30:55,422 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-18 22:30:55,422 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-18 22:30:55,423 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-unlimited.bpl [2018-12-18 22:30:55,424 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-unlimited.bpl' [2018-12-18 22:30:55,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-18 22:30:55,498 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-18 22:30:55,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-18 22:30:55,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-18 22:30:55,500 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-18 22:30:55,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:55" (1/1) ... [2018-12-18 22:30:55,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:55" (1/1) ... [2018-12-18 22:30:55,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-18 22:30:55,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-18 22:30:55,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-18 22:30:55,587 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-18 22:30:55,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:55" (1/1) ... [2018-12-18 22:30:55,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:55" (1/1) ... [2018-12-18 22:30:55,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:55" (1/1) ... [2018-12-18 22:30:55,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:55" (1/1) ... [2018-12-18 22:30:55,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:55" (1/1) ... [2018-12-18 22:30:55,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:55" (1/1) ... [2018-12-18 22:30:55,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:55" (1/1) ... [2018-12-18 22:30:55,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-18 22:30:55,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-18 22:30:55,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-18 22:30:55,621 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-18 22:30:55,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:30:55,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-18 22:30:55,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-18 22:30:57,095 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-18 22:30:57,095 INFO L280 CfgBuilder]: Removed 23 assue(true) statements. [2018-12-18 22:30:57,098 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:30:57 BoogieIcfgContainer [2018-12-18 22:30:57,098 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-18 22:30:57,099 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-18 22:30:57,099 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-18 22:30:57,104 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-18 22:30:57,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:30:55" (1/2) ... [2018-12-18 22:30:57,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4af550 and model type speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:30:57, skipping insertion in model container [2018-12-18 22:30:57,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:30:57" (2/2) ... [2018-12-18 22:30:57,108 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-10-unlimited.bpl [2018-12-18 22:30:57,120 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-18 22:30:57,133 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-12-18 22:30:57,151 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-12-18 22:30:57,194 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-18 22:30:57,194 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-18 22:30:57,194 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-18 22:30:57,195 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-18 22:30:57,195 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-18 22:30:57,195 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-18 22:30:57,195 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-18 22:30:57,195 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-18 22:30:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-12-18 22:30:57,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-18 22:30:57,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:30:57,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-18 22:30:57,235 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr9ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:30:57,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:30:57,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1004, now seen corresponding path program 1 times [2018-12-18 22:30:57,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:30:57,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:30:57,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:30:57,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:30:57,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:30:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:30:57,637 INFO L273 TraceCheckUtils]: 0: Hoare triple {26#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;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;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_p2 := malloc_ptr;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_p3 := malloc_ptr;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_p4 := malloc_ptr;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_p5 := malloc_ptr;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_p6 := malloc_ptr;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_p7 := malloc_ptr;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_p8 := malloc_ptr;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_p9 := malloc_ptr;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_p10 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {28#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:30:57,643 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {27#false} is VALID [2018-12-18 22:30:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:30:57,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:30:57,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 22:30:57,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:30:57,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:30:57,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:30:57,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 22:30:57,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:30:57,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 22:30:57,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 22:30:57,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:30:57,693 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-12-18 22:30:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:30:58,339 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2018-12-18 22:30:58,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:30:58,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:30:58,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:30:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:30:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-12-18 22:30:58,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:30:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-12-18 22:30:58,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2018-12-18 22:30:58,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:30:58,779 INFO L225 Difference]: With dead ends: 45 [2018-12-18 22:30:58,779 INFO L226 Difference]: Without dead ends: 40 [2018-12-18 22:30:58,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:30:58,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-18 22:30:58,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2018-12-18 22:30:58,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:30:58,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 22 states. [2018-12-18 22:30:58,865 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 22 states. [2018-12-18 22:30:58,866 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 22 states. [2018-12-18 22:30:58,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:30:58,877 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2018-12-18 22:30:58,877 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2018-12-18 22:30:58,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:30:58,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:30:58,879 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 40 states. [2018-12-18 22:30:58,879 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 40 states. [2018-12-18 22:30:58,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:30:58,884 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2018-12-18 22:30:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2018-12-18 22:30:58,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:30:58,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:30:58,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:30:58,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:30:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-18 22:30:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2018-12-18 22:30:58,891 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 41 transitions. Word has length 2 [2018-12-18 22:30:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:30:58,891 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 41 transitions. [2018-12-18 22:30:58,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 22:30:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 41 transitions. [2018-12-18 22:30:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:30:58,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:30:58,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:30:58,893 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr9ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:30:58,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:30:58,894 INFO L82 PathProgramCache]: Analyzing trace with hash 30392, now seen corresponding path program 1 times [2018-12-18 22:30:58,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:30:58,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:30:58,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:30:58,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:30:58,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:30:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:30:59,170 INFO L273 TraceCheckUtils]: 0: Hoare triple {182#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;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;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_p2 := malloc_ptr;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_p3 := malloc_ptr;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_p4 := malloc_ptr;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_p5 := malloc_ptr;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_p6 := malloc_ptr;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_p7 := malloc_ptr;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_p8 := malloc_ptr;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_p9 := malloc_ptr;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_p10 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {184#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2018-12-18 22:30:59,188 INFO L273 TraceCheckUtils]: 1: Hoare triple {184#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {185#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:30:59,200 INFO L273 TraceCheckUtils]: 2: Hoare triple {185#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {183#false} is VALID [2018-12-18 22:30:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:30:59,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:30:59,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:30:59,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-18 22:30:59,204 INFO L207 CegarAbsIntRunner]: [0], [18], [43] [2018-12-18 22:30:59,267 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-18 22:30:59,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 22:31:02,763 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-18 22:31:02,764 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-18 22:31:02,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:31:02,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-18 22:31:02,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:31:02,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 22:31:02,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:31:02,780 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:31:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:31:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:31:02,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:31:03,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-12-18 22:31:03,142 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 42 [2018-12-18 22:31:03,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 52 [2018-12-18 22:31:03,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 66 [2018-12-18 22:31:03,329 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 84 [2018-12-18 22:31:03,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 106 [2018-12-18 22:31:03,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,464 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 132 [2018-12-18 22:31:03,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,523 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 162 [2018-12-18 22:31:03,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:03,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 196 [2018-12-18 22:31:04,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 195 [2018-12-18 22:31:04,200 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:04,448 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:04,739 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:04,835 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:04,912 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:04,990 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:05,064 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:05,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:05,134 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:05,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:05,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 140 [2018-12-18 22:31:05,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 127 [2018-12-18 22:31:05,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 123 [2018-12-18 22:31:05,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:05,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 122 [2018-12-18 22:31:05,983 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-12-18 22:31:06,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 130 [2018-12-18 22:31:06,195 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-18 22:31:06,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 145 [2018-12-18 22:31:06,508 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-12-18 22:31:06,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 167 [2018-12-18 22:31:06,873 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2018-12-18 22:31:06,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:06,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 145 [2018-12-18 22:31:06,930 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:07,013 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:07,096 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:07,184 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:07,275 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:07,372 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:07,460 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:07,566 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:31:07,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-18 22:31:07,748 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 10 variables, input treesize:182, output treesize:195 [2018-12-18 22:31:10,371 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:31:10,371 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_52|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p9, ULTIMATE.start_main_p10, |v_#valid_12|]. (let ((.cse4 (store |v_#valid_12| ULTIMATE.start_main_p1 1))) (let ((.cse2 (store .cse4 ULTIMATE.start_main_p2 1))) (let ((.cse5 (store .cse2 ULTIMATE.start_main_p3 1))) (let ((.cse3 (store .cse5 ULTIMATE.start_main_p4 1))) (let ((.cse1 (store .cse3 ULTIMATE.start_main_p5 1))) (let ((.cse0 (store .cse1 ULTIMATE.start_main_p6 1))) (let ((.cse6 (store .cse0 ULTIMATE.start_main_p7 1))) (and (= (select .cse0 ULTIMATE.start_main_p7) 0) (= (select .cse1 ULTIMATE.start_main_p6) 0) (= 0 (select .cse2 ULTIMATE.start_main_p3)) (= (store (store (store (store (store (store (store (store (store (store |v_#memory_int_52| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) ULTIMATE.start_main_p4 0) ULTIMATE.start_main_p5 0) ULTIMATE.start_main_p6 0) ULTIMATE.start_main_p7 0) ULTIMATE.start_main_p8 0) ULTIMATE.start_main_p9 0) ULTIMATE.start_main_p10 0) |#memory_int|) (= 0 (select .cse3 ULTIMATE.start_main_p5)) (= 0 (select .cse4 ULTIMATE.start_main_p2)) (= 0 (select .cse5 ULTIMATE.start_main_p4)) (= 0 (select .cse6 ULTIMATE.start_main_p8)) (= 0 (select (store .cse6 ULTIMATE.start_main_p8 1) ULTIMATE.start_main_p9)))))))))) [2018-12-18 22:31:10,372 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p9, ULTIMATE.start_main_p8, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6, ULTIMATE.start_main_p10]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2018-12-18 22:31:16,307 WARN L181 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2018-12-18 22:31:16,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:31:16,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 190 [2018-12-18 22:31:16,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 22:31:16,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-18 22:31:16,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:200, output treesize:158 [2018-12-18 22:31:19,108 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:31:19,109 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_53|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p9, ULTIMATE.start_main_p8, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_53| ULTIMATE.start_main_p4))) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= (select |v_#memory_int_53| ULTIMATE.start_main_p6) 0) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (= (select |v_#memory_int_53| ULTIMATE.start_main_p1) 0) (= (select |v_#memory_int_53| ULTIMATE.start_main_p9) 0) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (= (select |v_#memory_int_53| ULTIMATE.start_main_p7) 0) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (= (select |v_#memory_int_53| ULTIMATE.start_main_p8) 0) (= .cse0 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= (select |v_#memory_int_53| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (= (select |v_#memory_int_53| ULTIMATE.start_main_p5) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (store |v_#memory_int_53| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)) (= (select |v_#memory_int_53| ULTIMATE.start_main_p2) 0) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) [2018-12-18 22:31:19,109 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p9, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6, ULTIMATE.start_main_p8, ULTIMATE.start_main_p4]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) (- 1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2018-12-18 22:31:24,520 INFO L273 TraceCheckUtils]: 0: Hoare triple {182#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;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;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_p2 := malloc_ptr;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_p3 := malloc_ptr;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_p4 := malloc_ptr;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_p5 := malloc_ptr;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_p6 := malloc_ptr;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_p7 := malloc_ptr;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_p8 := malloc_ptr;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_p9 := malloc_ptr;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_p10 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {189#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is UNKNOWN [2018-12-18 22:31:27,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {193#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0)) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))))} is UNKNOWN [2018-12-18 22:31:27,210 INFO L273 TraceCheckUtils]: 2: Hoare triple {193#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0)) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))))} assume !(#memory_int[main_p1] <= 0); {183#false} is VALID [2018-12-18 22:31:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:31:27,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:31:27,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {197#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {183#false} is VALID [2018-12-18 22:31:27,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {201#(<= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {197#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:31:27,283 INFO L273 TraceCheckUtils]: 0: Hoare triple {182#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;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;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_p2 := malloc_ptr;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_p3 := malloc_ptr;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_p4 := malloc_ptr;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_p5 := malloc_ptr;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_p6 := malloc_ptr;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_p7 := malloc_ptr;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_p8 := malloc_ptr;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_p9 := malloc_ptr;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_p10 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {201#(<= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:31:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:31:27,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-18 22:31:27,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2018-12-18 22:31:27,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:31:27,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:31:27,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:31:27,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-18 22:31:27,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:31:27,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-18 22:31:27,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-18 22:31:27,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-18 22:31:27,325 INFO L87 Difference]: Start difference. First operand 22 states and 41 transitions. Second operand 4 states. [2018-12-18 22:31:27,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:31:27,465 INFO L93 Difference]: Finished difference Result 24 states and 53 transitions. [2018-12-18 22:31:27,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:31:27,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:31:27,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:31:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:31:27,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-12-18 22:31:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:31:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-12-18 22:31:27,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-12-18 22:31:27,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:31:27,513 INFO L225 Difference]: With dead ends: 24 [2018-12-18 22:31:27,513 INFO L226 Difference]: Without dead ends: 23 [2018-12-18 22:31:27,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-18 22:31:27,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-18 22:31:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-18 22:31:27,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:31:27,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2018-12-18 22:31:27,522 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2018-12-18 22:31:27,522 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2018-12-18 22:31:27,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:31:27,525 INFO L93 Difference]: Finished difference Result 23 states and 52 transitions. [2018-12-18 22:31:27,525 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 52 transitions. [2018-12-18 22:31:27,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:31:27,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:31:27,526 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2018-12-18 22:31:27,526 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2018-12-18 22:31:27,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:31:27,529 INFO L93 Difference]: Finished difference Result 23 states and 52 transitions. [2018-12-18 22:31:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 52 transitions. [2018-12-18 22:31:27,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:31:27,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:31:27,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:31:27,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:31:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-18 22:31:27,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2018-12-18 22:31:27,532 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 41 transitions. Word has length 3 [2018-12-18 22:31:27,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:31:27,532 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 41 transitions. [2018-12-18 22:31:27,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-18 22:31:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 41 transitions. [2018-12-18 22:31:27,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:31:27,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:31:27,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:31:27,534 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr9ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:31:27,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:31:27,534 INFO L82 PathProgramCache]: Analyzing trace with hash 30020, now seen corresponding path program 1 times [2018-12-18 22:31:27,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:31:27,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:31:27,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:31:27,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:31:27,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:31:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:31:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:31:27,610 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-18 22:31:27,638 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-18 22:31:27,638 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2018-12-18 22:31:27,639 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2018-12-18 22:31:27,639 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2018-12-18 22:31:27,639 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2018-12-18 22:31:27,639 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2018-12-18 22:31:27,639 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2018-12-18 22:31:27,639 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2018-12-18 22:31:27,639 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2018-12-18 22:31:27,639 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2018-12-18 22:31:27,640 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2018-12-18 22:31:27,642 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2018-12-18 22:31:27,642 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2018-12-18 22:31:27,642 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2018-12-18 22:31:27,642 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2018-12-18 22:31:27,642 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2018-12-18 22:31:27,642 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2018-12-18 22:31:27,642 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-12-18 22:31:27,642 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2018-12-18 22:31:27,642 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2018-12-18 22:31:27,642 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2018-12-18 22:31:27,642 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2018-12-18 22:31:27,642 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2018-12-18 22:31:27,643 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-12-18 22:31:27,643 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2018-12-18 22:31:27,643 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2018-12-18 22:31:27,643 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2018-12-18 22:31:27,643 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2018-12-18 22:31:27,643 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2018-12-18 22:31:27,643 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2018-12-18 22:31:27,644 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2018-12-18 22:31:27,644 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-12-18 22:31:27,644 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-18 22:31:27,646 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-10-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:31:27 BoogieIcfgContainer [2018-12-18 22:31:27,647 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-18 22:31:27,648 INFO L168 Benchmark]: Toolchain (without parser) took 32150.48 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 813.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -390.8 MB). Peak memory consumption was 422.4 MB. Max. memory is 7.1 GB. [2018-12-18 22:31:27,649 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:31:27,649 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:31:27,650 INFO L168 Benchmark]: Boogie Preprocessor took 33.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:31:27,650 INFO L168 Benchmark]: RCFGBuilder took 1477.60 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-12-18 22:31:27,651 INFO L168 Benchmark]: TraceAbstraction took 30547.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 813.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -443.7 MB). Peak memory consumption was 369.5 MB. Max. memory is 7.1 GB. [2018-12-18 22:31:27,657 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1477.60 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30547.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 813.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -443.7 MB). Peak memory consumption was 369.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 63]: assertion can be violated assertion can be violated We found a FailurePath: [L76-L77] modifies #valid; [L76-L78] ensures old(#valid)[ptr] == 0; [L76-L79] ensures #valid == old(#valid)[ptr := 1]; [L76-L77] modifies #valid; [L76-L78] ensures old(#valid)[ptr] == 0; [L76-L79] ensures #valid == old(#valid)[ptr := 1]; [L76-L77] modifies #valid; [L76-L78] ensures old(#valid)[ptr] == 0; [L76-L79] ensures #valid == old(#valid)[ptr := 1]; [L76-L77] modifies #valid; [L76-L78] ensures old(#valid)[ptr] == 0; [L76-L79] ensures #valid == old(#valid)[ptr := 1]; [L76-L77] modifies #valid; [L76-L78] ensures old(#valid)[ptr] == 0; [L76-L79] ensures #valid == old(#valid)[ptr := 1]; [L76-L77] modifies #valid; [L76-L78] ensures old(#valid)[ptr] == 0; [L76-L79] ensures #valid == old(#valid)[ptr := 1]; [L76-L77] modifies #valid; [L76-L78] ensures old(#valid)[ptr] == 0; [L76-L79] ensures #valid == old(#valid)[ptr := 1]; [L76-L77] modifies #valid; [L76-L78] ensures old(#valid)[ptr] == 0; [L76-L79] ensures #valid == old(#valid)[ptr := 1]; [L76-L77] modifies #valid; [L76-L78] ensures old(#valid)[ptr] == 0; [L76-L79] ensures #valid == old(#valid)[ptr := 1]; [L76-L77] modifies #valid; [L76-L78] ensures old(#valid)[ptr] == 0; [L76-L79] ensures #valid == old(#valid)[ptr := 1]; [L28] #memory_int[p1] := 0; [L29] #memory_int[p2] := 0; [L30] #memory_int[p3] := 0; [L31] #memory_int[p4] := 0; [L32] #memory_int[p5] := 0; [L33] #memory_int[p6] := 0; [L34] #memory_int[p7] := 0; [L35] #memory_int[p8] := 0; [L36] #memory_int[p9] := 0; [L37] #memory_int[p10] := 0; [L41] #memory_int[p1] := #memory_int[p1] + 1; [L63] assert #memory_int[p1] <= 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 10 error locations. UNSAFE Result, 30.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5 SDtfs, 38 SDslu, 1 SDs, 0 SdLazy, 109 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 3.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 24.9s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 7 ConstructedInterpolants, 2 QuantifiedInterpolants, 793 SizeOfPredicates, 9 NumberOfNonLiveVariables, 29 ConjunctsInSsa, 19 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 incorrect! Received shutdown request...