java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 14:44:13,603 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:44:13,605 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:44:13,621 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:44:13,622 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:44:13,623 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:44:13,625 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:44:13,627 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:44:13,629 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:44:13,630 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:44:13,639 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:44:13,639 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:44:13,640 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:44:13,641 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:44:13,644 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:44:13,645 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:44:13,646 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:44:13,649 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:44:13,654 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:44:13,658 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:44:13,659 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:44:13,661 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:44:13,662 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:44:13,664 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:44:13,664 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:44:13,665 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:44:13,666 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:44:13,667 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:44:13,668 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:44:13,670 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:44:13,671 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:44:13,671 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:44:13,672 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:44:13,672 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:44:13,674 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:44:13,675 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:44:13,675 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-31 14:44:13,698 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:44:13,699 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:44:13,700 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:44:13,700 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:44:13,700 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:44:13,700 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:44:13,700 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:44:13,701 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:44:13,704 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:44:13,704 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:44:13,704 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:44:13,704 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:44:13,705 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:44:13,705 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:44:13,705 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:44:13,706 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:44:13,707 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:44:13,707 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:44:13,707 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:44:13,707 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:44:13,708 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:44:13,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:44:13,709 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:44:13,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:44:13,709 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:44:13,710 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:44:13,710 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:44:13,710 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:44:13,710 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:44:13,710 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:44:13,711 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:44:13,711 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:44:13,711 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:44:13,711 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:44:13,712 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:44:13,712 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:44:13,712 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:44:13,712 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:44:13,712 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:44:13,712 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:44:13,753 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:44:13,765 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:44:13,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:44:13,770 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:44:13,771 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:44:13,771 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl [2019-01-31 14:44:13,773 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl' [2019-01-31 14:44:13,824 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:44:13,825 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:44:13,826 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:44:13,826 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:44:13,826 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:44:13,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:13" (1/1) ... [2019-01-31 14:44:13,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:13" (1/1) ... [2019-01-31 14:44:13,886 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:44:13,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:44:13,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:44:13,888 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:44:13,899 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:13" (1/1) ... [2019-01-31 14:44:13,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:13" (1/1) ... [2019-01-31 14:44:13,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:13" (1/1) ... [2019-01-31 14:44:13,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:13" (1/1) ... [2019-01-31 14:44:13,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:13" (1/1) ... [2019-01-31 14:44:13,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:13" (1/1) ... [2019-01-31 14:44:13,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:13" (1/1) ... [2019-01-31 14:44:13,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:44:13,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:44:13,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:44:13,915 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:44:13,916 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:13" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:44:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 14:44:13,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 14:44:15,111 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 14:44:15,112 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-01-31 14:44:15,113 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:44:15 BoogieIcfgContainer [2019-01-31 14:44:15,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:44:15,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:44:15,114 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:44:15,117 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:44:15,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:13" (1/2) ... [2019-01-31 14:44:15,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ced3258 and model type speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:44:15, skipping insertion in model container [2019-01-31 14:44:15,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:44:15" (2/2) ... [2019-01-31 14:44:15,122 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-9-unlimited.bpl [2019-01-31 14:44:15,133 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:44:15,142 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-01-31 14:44:15,160 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-01-31 14:44:15,195 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:44:15,195 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:44:15,196 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:44:15,196 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:44:15,196 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:44:15,196 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:44:15,196 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:44:15,197 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:44:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-01-31 14:44:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 14:44:15,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:44:15,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 14:44:15,225 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:44:15,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:44:15,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1000, now seen corresponding path program 1 times [2019-01-31 14:44:15,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:44:15,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:44:15,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:44:15,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:44:15,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:44:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:44:15,578 INFO L273 TraceCheckUtils]: 0: Hoare triple {24#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;#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]; {26#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-31 14:44:15,583 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {25#false} is VALID [2019-01-31 14:44:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:44:15,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:44:15,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 14:44:15,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:44:15,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 14:44:15,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:44:15,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:44:15,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:44:15,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:44:15,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:44:15,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:44:15,632 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-01-31 14:44:16,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:44:16,218 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2019-01-31 14:44:16,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:44:16,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 14:44:16,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:44:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:44:16,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2019-01-31 14:44:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:44:16,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2019-01-31 14:44:16,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2019-01-31 14:44:16,643 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:44:16,666 INFO L225 Difference]: With dead ends: 41 [2019-01-31 14:44:16,666 INFO L226 Difference]: Without dead ends: 36 [2019-01-31 14:44:16,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:44:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-31 14:44:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2019-01-31 14:44:16,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:44:16,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 20 states. [2019-01-31 14:44:16,755 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 20 states. [2019-01-31 14:44:16,756 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 20 states. [2019-01-31 14:44:16,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:44:16,764 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2019-01-31 14:44:16,764 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-01-31 14:44:16,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:44:16,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:44:16,765 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 36 states. [2019-01-31 14:44:16,766 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 36 states. [2019-01-31 14:44:16,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:44:16,770 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2019-01-31 14:44:16,770 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-01-31 14:44:16,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:44:16,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:44:16,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:44:16,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:44:16,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-31 14:44:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2019-01-31 14:44:16,776 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 2 [2019-01-31 14:44:16,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:44:16,776 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2019-01-31 14:44:16,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:44:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2019-01-31 14:44:16,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:44:16,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:44:16,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:44:16,778 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:44:16,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:44:16,779 INFO L82 PathProgramCache]: Analyzing trace with hash 30388, now seen corresponding path program 1 times [2019-01-31 14:44:16,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:44:16,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:44:16,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:44:16,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:44:16,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:44:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:44:16,936 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;#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]; {168#(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 [2019-01-31 14:44:16,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#(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]; {169#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-31 14:44:16,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {169#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {167#false} is VALID [2019-01-31 14:44:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:44:16,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:44:16,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:44:16,940 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 14:44:16,943 INFO L207 CegarAbsIntRunner]: [0], [18], [39] [2019-01-31 14:44:16,978 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:44:16,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:44:17,110 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:44:17,111 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 94 root evaluator evaluations with a maximum evaluation depth of 2. Performed 94 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 14:44:17,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:44:17,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:44:17,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:44:17,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 14:44:17,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:44:17,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:44:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:44:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:44:17,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:44:17,703 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-31 14:44:17,773 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 30 treesize of output 33 [2019-01-31 14:44:17,879 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 33 treesize of output 39 [2019-01-31 14:44:17,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,020 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 35 treesize of output 49 [2019-01-31 14:44:18,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,099 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 37 treesize of output 63 [2019-01-31 14:44:18,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,278 INFO L303 Elim1Store]: Index analysis took 101 ms [2019-01-31 14:44:18,282 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 39 treesize of output 81 [2019-01-31 14:44:18,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,405 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 41 treesize of output 103 [2019-01-31 14:44:18,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,483 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 43 treesize of output 129 [2019-01-31 14:44:18,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:18,703 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 45 treesize of output 159 [2019-01-31 14:44:18,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2019-01-31 14:44:18,851 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 14:44:18,958 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:19,072 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:19,146 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:19,245 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:19,284 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:19,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:19,347 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:19,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:19,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:19,482 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 117 treesize of output 114 [2019-01-31 14:44:19,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:19,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:19,781 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 101 treesize of output 104 [2019-01-31 14:44:19,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:19,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:19,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:19,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:19,889 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 83 treesize of output 103 [2019-01-31 14:44:20,110 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-01-31 14:44:20,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,133 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 68 treesize of output 105 [2019-01-31 14:44:20,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,327 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 56 treesize of output 116 [2019-01-31 14:44:20,531 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-31 14:44:20,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,582 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 47 treesize of output 134 [2019-01-31 14:44:20,764 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-31 14:44:20,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:20,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 113 [2019-01-31 14:44:20,910 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-31 14:44:20,972 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:21,036 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:21,105 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:21,172 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:21,238 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:21,306 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:21,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 14:44:21,464 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-01-31 14:44:31,954 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:44:31,954 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_47|, 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, |v_#valid_11|]. (let ((.cse1 (store |v_#valid_11| ULTIMATE.start_main_p1 1))) (let ((.cse3 (store .cse1 ULTIMATE.start_main_p2 1))) (let ((.cse2 (store .cse3 ULTIMATE.start_main_p3 1))) (let ((.cse0 (store .cse2 ULTIMATE.start_main_p4 1))) (let ((.cse4 (store .cse0 ULTIMATE.start_main_p5 1))) (let ((.cse5 (store .cse4 ULTIMATE.start_main_p6 1))) (and (= (select .cse0 ULTIMATE.start_main_p5) 0) (= 0 (select .cse1 ULTIMATE.start_main_p2)) (= (select .cse2 ULTIMATE.start_main_p4) 0) (= (select .cse3 ULTIMATE.start_main_p3) 0) (= 0 (select .cse4 ULTIMATE.start_main_p6)) (= (store (store (store (store (store (store (store (store (store |v_#memory_int_47| 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) |#memory_int|) (= (select (store .cse5 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8) 0) (= (select .cse5 ULTIMATE.start_main_p7) 0)))))))) [2019-01-31 14:44:31,954 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p9, ULTIMATE.start_main_p6]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (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_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)) (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)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (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_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_p6 ULTIMATE.start_main_p5))) [2019-01-31 14:44:36,824 WARN L181 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-01-31 14:44:37,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:37,302 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-01-31 14:44:37,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:44:37,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 14:44:37,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-01-31 14:44:48,029 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:44:48,030 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_48|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_48| ULTIMATE.start_main_p4))) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= (store |v_#memory_int_48| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p3)) (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 |v_#memory_int_48| 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)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p1)) (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_p3 ULTIMATE.start_main_p8)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p6)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_48| 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_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 .cse0) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) [2019-01-31 14:44:48,030 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, 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_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)) (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_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)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (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_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2019-01-31 14:44:50,582 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;#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]; {173#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 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_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)) (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_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)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (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_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_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2019-01-31 14:44:51,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {173#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 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_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)) (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_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)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (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_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_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (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]; {177#(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_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (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)) (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_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)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (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_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))))} is VALID [2019-01-31 14:44:51,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {177#(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_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (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)) (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_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)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (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_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))))} assume !(#memory_int[main_p1] >= 0); {167#false} is VALID [2019-01-31 14:44:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:44:51,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:44:51,510 INFO L273 TraceCheckUtils]: 2: Hoare triple {181#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {167#false} is VALID [2019-01-31 14:44:51,511 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {181#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-31 14:44:51,514 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;#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]; {185#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-01-31 14:44:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:44:51,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:44:51,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 14:44:51,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:44:51,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 14:44:51,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:44:51,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-31 14:44:52,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:44:52,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 14:44:52,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 14:44:52,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 14:44:52,731 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 6 states. [2019-01-31 14:44:53,701 WARN L181 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-01-31 14:44:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:44:54,863 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2019-01-31 14:44:54,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 14:44:54,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 14:44:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:44:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:44:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2019-01-31 14:44:54,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:44:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2019-01-31 14:44:54,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 104 transitions. [2019-01-31 14:45:19,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:45:19,755 INFO L225 Difference]: With dead ends: 71 [2019-01-31 14:45:19,756 INFO L226 Difference]: Without dead ends: 69 [2019-01-31 14:45:19,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 14:45:19,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-31 14:45:19,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 24. [2019-01-31 14:45:19,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:45:19,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 24 states. [2019-01-31 14:45:19,823 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 24 states. [2019-01-31 14:45:19,823 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 24 states. [2019-01-31 14:45:19,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:45:19,828 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2019-01-31 14:45:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2019-01-31 14:45:19,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:45:19,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:45:19,830 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 69 states. [2019-01-31 14:45:19,830 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 69 states. [2019-01-31 14:45:19,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:45:19,835 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2019-01-31 14:45:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2019-01-31 14:45:19,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:45:19,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:45:19,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:45:19,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:45:19,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-31 14:45:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 52 transitions. [2019-01-31 14:45:19,839 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 52 transitions. Word has length 3 [2019-01-31 14:45:19,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:45:19,840 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 52 transitions. [2019-01-31 14:45:19,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 14:45:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 52 transitions. [2019-01-31 14:45:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:45:19,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:45:19,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:45:19,841 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:45:19,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:45:19,841 INFO L82 PathProgramCache]: Analyzing trace with hash 30884, now seen corresponding path program 1 times [2019-01-31 14:45:19,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:45:19,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:45:19,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:45:19,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:45:19,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:45:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:45:19,977 INFO L273 TraceCheckUtils]: 0: Hoare triple {430#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;#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]; {432#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p8) 0))} is VALID [2019-01-31 14:45:19,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {432#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p8) 0))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {433#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-31 14:45:19,979 INFO L273 TraceCheckUtils]: 2: Hoare triple {433#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {431#false} is VALID [2019-01-31 14:45:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:45:19,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:45:19,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:45:19,981 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 14:45:19,981 INFO L207 CegarAbsIntRunner]: [0], [34], [39] [2019-01-31 14:45:19,983 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:45:19,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:45:20,003 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:45:20,003 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 94 root evaluator evaluations with a maximum evaluation depth of 2. Performed 94 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 14:45:20,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:45:20,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:45:20,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:45:20,004 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 14:45:20,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:45:20,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:45:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:45:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:45:20,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:45:20,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,183 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 117 treesize of output 114 [2019-01-31 14:45:20,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,284 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 101 treesize of output 104 [2019-01-31 14:45:20,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,379 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 83 treesize of output 103 [2019-01-31 14:45:20,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,571 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 68 treesize of output 105 [2019-01-31 14:45:20,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:20,868 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 56 treesize of output 116 [2019-01-31 14:45:21,008 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-31 14:45:21,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,045 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 47 treesize of output 134 [2019-01-31 14:45:21,246 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-31 14:45:21,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:21,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 113 [2019-01-31 14:45:21,453 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-31 14:45:21,515 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:45:21,599 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:45:21,665 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:45:21,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:45:21,799 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:45:21,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:45:21,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-01-31 14:45:21,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2019-01-31 14:45:21,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-01-31 14:45:21,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2019-01-31 14:45:22,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 81 [2019-01-31 14:45:22,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-31 14:45:22,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-01-31 14:45:22,212 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 45 treesize of output 159 [2019-01-31 14:45:22,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2019-01-31 14:45:22,274 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-31 14:45:22,352 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:45:22,412 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:45:22,457 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:45:22,494 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:45:22,524 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:45:22,549 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:45:22,572 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:45:22,591 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:45:22,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 14:45:22,716 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-01-31 14:45:33,178 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:45:33,179 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_50|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p9, |v_#valid_12|]. (let ((.cse4 (store |v_#valid_12| ULTIMATE.start_main_p1 1))) (let ((.cse0 (store .cse4 ULTIMATE.start_main_p2 1))) (let ((.cse5 (store .cse0 ULTIMATE.start_main_p3 1))) (let ((.cse3 (store .cse5 ULTIMATE.start_main_p4 1))) (let ((.cse1 (store .cse3 ULTIMATE.start_main_p5 1))) (let ((.cse2 (store .cse1 ULTIMATE.start_main_p6 1))) (and (= (store (store (store (store (store (store (store (store (store |v_#memory_int_50| 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) |#memory_int|) (= 0 (select .cse0 ULTIMATE.start_main_p3)) (= (select .cse1 ULTIMATE.start_main_p6) 0) (= (select .cse2 ULTIMATE.start_main_p7) 0) (= 0 (select .cse3 ULTIMATE.start_main_p5)) (= 0 (select .cse4 ULTIMATE.start_main_p2)) (= 0 (select (store .cse2 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8)) (= 0 (select .cse5 ULTIMATE.start_main_p4))))))))) [2019-01-31 14:45:33,179 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p9, ULTIMATE.start_main_p6]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (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_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)) (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)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (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_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_p6 ULTIMATE.start_main_p5))) [2019-01-31 14:45:36,970 WARN L181 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-01-31 14:45:37,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:45:37,135 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 159 [2019-01-31 14:45:37,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:45:37,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 14:45:37,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-01-31 14:45:48,426 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:45:48,427 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_51|, ULTIMATE.start_main_p8, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_51| ULTIMATE.start_main_p8))) (and (= (select |v_#memory_int_51| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (= |#memory_int| (store |v_#memory_int_51| ULTIMATE.start_main_p8 (+ .cse0 (- 1)))) (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)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p7) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p5) 0) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (= .cse0 0) (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)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p2) 0) (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)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p6) 0) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) [2019-01-31 14:45:48,427 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p6, ULTIMATE.start_main_p8]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (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)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (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)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (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)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (= (- 1) (select |#memory_int| 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_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2019-01-31 14:45:50,767 INFO L273 TraceCheckUtils]: 0: Hoare triple {430#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;#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]; {437#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 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_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)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (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_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)) (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)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (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_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)))} is VALID [2019-01-31 14:45:51,319 INFO L273 TraceCheckUtils]: 1: Hoare triple {437#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 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_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)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (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_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)) (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)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (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_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {441#(and (exists ((ULTIMATE.start_main_p8 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p8) 1))) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 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_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)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (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)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (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)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (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_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-01-31 14:45:51,321 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#(and (exists ((ULTIMATE.start_main_p8 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p8) 1))) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 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_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)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (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)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (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)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (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_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {431#false} is VALID [2019-01-31 14:45:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:45:51,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:45:51,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {445#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {431#false} is VALID [2019-01-31 14:45:51,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {449#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {445#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-31 14:45:51,347 INFO L273 TraceCheckUtils]: 0: Hoare triple {430#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;#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]; {449#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-01-31 14:45:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:45:51,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:45:51,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 14:45:51,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:45:51,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 14:45:51,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:45:51,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-31 14:45:52,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:45:52,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 14:45:52,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 14:45:52,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 14:45:52,386 INFO L87 Difference]: Start difference. First operand 24 states and 52 transitions. Second operand 6 states. [2019-01-31 14:45:53,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:45:53,469 INFO L93 Difference]: Finished difference Result 54 states and 87 transitions. [2019-01-31 14:45:53,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 14:45:53,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 14:45:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:45:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:45:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2019-01-31 14:45:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:45:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2019-01-31 14:45:53,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2019-01-31 14:46:17,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:46:17,960 INFO L225 Difference]: With dead ends: 54 [2019-01-31 14:46:17,960 INFO L226 Difference]: Without dead ends: 52 [2019-01-31 14:46:17,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 14:46:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-31 14:46:18,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 29. [2019-01-31 14:46:18,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:46:18,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 29 states. [2019-01-31 14:46:18,058 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 29 states. [2019-01-31 14:46:18,059 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 29 states. [2019-01-31 14:46:18,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:46:18,063 INFO L93 Difference]: Finished difference Result 52 states and 85 transitions. [2019-01-31 14:46:18,063 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 85 transitions. [2019-01-31 14:46:18,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:46:18,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:46:18,064 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 52 states. [2019-01-31 14:46:18,064 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 52 states. [2019-01-31 14:46:18,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:46:18,067 INFO L93 Difference]: Finished difference Result 52 states and 85 transitions. [2019-01-31 14:46:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 85 transitions. [2019-01-31 14:46:18,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:46:18,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:46:18,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:46:18,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:46:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 14:46:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 69 transitions. [2019-01-31 14:46:18,070 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 69 transitions. Word has length 3 [2019-01-31 14:46:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:46:18,070 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 69 transitions. [2019-01-31 14:46:18,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 14:46:18,071 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 69 transitions. [2019-01-31 14:46:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:46:18,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:46:18,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:46:18,072 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:46:18,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:46:18,072 INFO L82 PathProgramCache]: Analyzing trace with hash 30946, now seen corresponding path program 1 times [2019-01-31 14:46:18,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:46:18,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:46:18,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:46:18,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:46:18,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:46:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:46:18,241 INFO L273 TraceCheckUtils]: 0: Hoare triple {647#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;#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]; {649#(and (= (select |#memory_int| ULTIMATE.start_main_p9) 0) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p9 (+ (select |#memory_int| ULTIMATE.start_main_p9) 1)) ULTIMATE.start_main_p1)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)))} is VALID [2019-01-31 14:46:18,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {649#(and (= (select |#memory_int| ULTIMATE.start_main_p9) 0) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p9 (+ (select |#memory_int| ULTIMATE.start_main_p9) 1)) ULTIMATE.start_main_p1)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)))} #memory_int := #memory_int[main_p9 := #memory_int[main_p9] + 1]; {650#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-31 14:46:18,244 INFO L273 TraceCheckUtils]: 2: Hoare triple {650#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {648#false} is VALID [2019-01-31 14:46:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 14:46:18,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:46:18,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:46:18,245 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 14:46:18,245 INFO L207 CegarAbsIntRunner]: [0], [36], [39] [2019-01-31 14:46:18,246 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:46:18,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:46:18,274 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:46:18,274 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 94 root evaluator evaluations with a maximum evaluation depth of 2. Performed 94 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 14:46:18,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:46:18,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:46:18,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:46:18,275 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 14:46:18,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:46:18,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:46:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:46:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:46:18,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:46:18,387 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 30 treesize of output 33 [2019-01-31 14:46:18,410 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 33 treesize of output 39 [2019-01-31 14:46:18,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,443 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 35 treesize of output 49 [2019-01-31 14:46:18,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,502 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 37 treesize of output 63 [2019-01-31 14:46:18,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,527 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 39 treesize of output 81 [2019-01-31 14:46:18,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,562 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 41 treesize of output 103 [2019-01-31 14:46:18,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,683 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 43 treesize of output 129 [2019-01-31 14:46:18,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:18,734 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 45 treesize of output 159 [2019-01-31 14:46:18,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2019-01-31 14:46:18,884 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-31 14:46:19,002 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:46:19,077 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:46:19,142 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:46:19,202 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:46:19,237 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:46:19,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:46:19,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:46:19,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:46:19,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,381 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 117 treesize of output 114 [2019-01-31 14:46:19,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,478 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 101 treesize of output 104 [2019-01-31 14:46:19,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,576 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 83 treesize of output 103 [2019-01-31 14:46:19,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,684 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 68 treesize of output 105 [2019-01-31 14:46:19,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:19,867 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 56 treesize of output 116 [2019-01-31 14:46:20,009 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2019-01-31 14:46:20,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,049 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 47 treesize of output 134 [2019-01-31 14:46:20,219 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-01-31 14:46:20,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:20,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 113 [2019-01-31 14:46:20,273 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-31 14:46:20,337 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:46:20,402 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:46:20,478 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:46:20,546 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:46:20,618 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:46:20,684 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:46:20,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 14:46:20,824 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-01-31 14:46:31,361 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:46:31,362 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_53|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, |v_#valid_13|]. (let ((.cse4 (store |v_#valid_13| ULTIMATE.start_main_p1 1))) (let ((.cse3 (store .cse4 ULTIMATE.start_main_p2 1))) (let ((.cse5 (store .cse3 ULTIMATE.start_main_p3 1))) (let ((.cse0 (store .cse5 ULTIMATE.start_main_p4 1))) (let ((.cse1 (store .cse0 ULTIMATE.start_main_p5 1))) (let ((.cse2 (store .cse1 ULTIMATE.start_main_p6 1))) (and (= 0 (select .cse0 ULTIMATE.start_main_p5)) (= 0 (select .cse1 ULTIMATE.start_main_p6)) (= (select .cse2 ULTIMATE.start_main_p7) 0) (= (select .cse3 ULTIMATE.start_main_p3) 0) (= (select (store .cse2 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8) 0) (= 0 (select .cse4 ULTIMATE.start_main_p2)) (= |#memory_int| (store (store (store (store (store (store (store (store (store |v_#memory_int_53| 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)) (= (select .cse5 ULTIMATE.start_main_p4) 0)))))))) [2019-01-31 14:46:31,362 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (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_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)) (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)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (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_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_p6 ULTIMATE.start_main_p5))) [2019-01-31 14:46:43,746 WARN L181 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 88 [2019-01-31 14:46:43,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:46:44,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 29 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 16 case distinctions, treesize of input 56 treesize of output 190 [2019-01-31 14:46:44,018 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-01-31 14:46:44,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 256 xjuncts. [2019-01-31 14:46:48,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 64 dim-0 vars, and 9 xjuncts. [2019-01-31 14:46:48,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:168, output treesize:1239 [2019-01-31 14:47:00,618 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:47:00,618 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_54|, ULTIMATE.start_main_p9, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_54| ULTIMATE.start_main_p9))) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (= (select |v_#memory_int_54| ULTIMATE.start_main_p5) 0) (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)) (= (select |v_#memory_int_54| ULTIMATE.start_main_p8) 0) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_54| ULTIMATE.start_main_p7) 0) (= (select |v_#memory_int_54| ULTIMATE.start_main_p4) 0) (= (store |v_#memory_int_54| ULTIMATE.start_main_p9 (+ .cse0 1)) |#memory_int|) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (= .cse0 0) (= 0 (select |v_#memory_int_54| ULTIMATE.start_main_p3)) (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_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (= 0 (select |v_#memory_int_54| ULTIMATE.start_main_p2)) (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)) (= (select |v_#memory_int_54| ULTIMATE.start_main_p1) 0) (= 0 (select |v_#memory_int_54| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) [2019-01-31 14:47:00,619 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6, ULTIMATE.start_main_p9, v_prenex_6, v_prenex_4, v_prenex_5, v_prenex_1, v_prenex_2, v_prenex_3, v_prenex_7, v_prenex_50, v_prenex_54, v_prenex_56, v_prenex_55, v_prenex_52, v_prenex_53, v_prenex_51, v_prenex_8, v_prenex_12, v_prenex_14, v_prenex_10, v_prenex_9, v_prenex_11, v_prenex_13, v_prenex_21, v_prenex_17, v_prenex_20, v_prenex_18, v_prenex_16, v_prenex_19, v_prenex_15, v_prenex_22, v_prenex_26, v_prenex_28, v_prenex_27, v_prenex_24, v_prenex_23, v_prenex_25, v_prenex_48, v_prenex_45, v_prenex_43, v_prenex_44, v_prenex_47, v_prenex_46, v_prenex_49, v_prenex_36, v_prenex_41, v_prenex_39, v_prenex_37, v_prenex_38, v_prenex_40, v_prenex_42, v_prenex_29, v_prenex_34, v_prenex_35, v_prenex_31, v_prenex_32, v_prenex_30, v_prenex_33]. (let ((.cse1 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse0 (= .cse1 0))) (or (and (not (= v_prenex_6 v_prenex_4)) (not (= v_prenex_5 v_prenex_1)) (not (= ULTIMATE.start_main_p1 v_prenex_4)) (not (= v_prenex_4 v_prenex_2)) (= 0 (select |#memory_int| v_prenex_6)) (not (= ULTIMATE.start_main_p1 v_prenex_1)) (not (= ULTIMATE.start_main_p1 v_prenex_5)) (= 0 (select |#memory_int| v_prenex_2)) (not (= v_prenex_3 v_prenex_1)) .cse0 (not (= v_prenex_6 ULTIMATE.start_main_p1)) (not (= v_prenex_5 v_prenex_2)) (= 0 (select |#memory_int| v_prenex_4)) (not (= v_prenex_6 v_prenex_5)) (= (select |#memory_int| v_prenex_1) 0) (= 0 (select |#memory_int| v_prenex_3)) (not (= v_prenex_4 v_prenex_3)) (not (= v_prenex_4 v_prenex_1)) (not (= v_prenex_5 v_prenex_3)) (not (= ULTIMATE.start_main_p1 v_prenex_3)) (not (= v_prenex_2 v_prenex_1)) (not (= v_prenex_7 v_prenex_5)) (not (= v_prenex_7 v_prenex_1)) (not (= ULTIMATE.start_main_p1 v_prenex_2)) (not (= v_prenex_6 v_prenex_2)) (not (= v_prenex_6 v_prenex_3)) (not (= v_prenex_7 v_prenex_6)) (not (= v_prenex_6 v_prenex_1)) (not (= v_prenex_5 v_prenex_4)) (= (select |#memory_int| v_prenex_7) 1) (= 0 (select |#memory_int| v_prenex_5)) (not (= v_prenex_3 v_prenex_2))) (and (not (= v_prenex_50 v_prenex_54)) (not (= v_prenex_50 v_prenex_56)) (not (= v_prenex_55 v_prenex_52)) (not (= ULTIMATE.start_main_p1 v_prenex_54)) (not (= v_prenex_54 v_prenex_53)) (not (= v_prenex_51 v_prenex_54)) (= 0 (select |#memory_int| v_prenex_50)) (not (= ULTIMATE.start_main_p1 v_prenex_52)) (not (= ULTIMATE.start_main_p1 v_prenex_55)) (= 0 (select |#memory_int| v_prenex_53)) (not (= v_prenex_51 v_prenex_53)) .cse0 (not (= v_prenex_50 ULTIMATE.start_main_p1)) (not (= v_prenex_55 v_prenex_53)) (= 0 (select |#memory_int| v_prenex_54)) (not (= v_prenex_50 v_prenex_55)) (not (= v_prenex_51 ULTIMATE.start_main_p1)) (= (select |#memory_int| v_prenex_52) 0) (not (= v_prenex_54 v_prenex_52)) (not (= v_prenex_53 v_prenex_52)) (not (= v_prenex_56 v_prenex_53)) (= 1 (select |#memory_int| v_prenex_56)) (= (select |#memory_int| v_prenex_51) 0) (not (= v_prenex_51 v_prenex_55)) (not (= v_prenex_51 v_prenex_52)) (not (= ULTIMATE.start_main_p1 v_prenex_53)) (not (= v_prenex_50 v_prenex_53)) (not (= v_prenex_51 v_prenex_50)) (not (= v_prenex_50 v_prenex_52)) (not (= v_prenex_55 v_prenex_54)) (= 0 (select |#memory_int| v_prenex_55))) (and (not (= v_prenex_8 v_prenex_12)) (not (= v_prenex_8 v_prenex_14)) (not (= ULTIMATE.start_main_p1 v_prenex_12)) (not (= v_prenex_12 v_prenex_10)) (not (= v_prenex_9 v_prenex_12)) (= 0 (select |#memory_int| v_prenex_8)) (not (= v_prenex_9 v_prenex_11)) (not (= ULTIMATE.start_main_p1 v_prenex_13)) (= 0 (select |#memory_int| v_prenex_10)) (not (= v_prenex_9 v_prenex_10)) .cse0 (not (= v_prenex_8 ULTIMATE.start_main_p1)) (not (= v_prenex_13 v_prenex_10)) (= 0 (select |#memory_int| v_prenex_12)) (not (= v_prenex_8 v_prenex_13)) (not (= v_prenex_9 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| v_prenex_11)) (not (= v_prenex_12 v_prenex_11)) (not (= v_prenex_13 v_prenex_11)) (not (= ULTIMATE.start_main_p1 v_prenex_11)) (not (= v_prenex_14 v_prenex_10)) (= 1 (select |#memory_int| v_prenex_14)) (= (select |#memory_int| v_prenex_9) 0) (not (= v_prenex_9 v_prenex_13)) (not (= ULTIMATE.start_main_p1 v_prenex_10)) (not (= v_prenex_8 v_prenex_10)) (not (= v_prenex_8 v_prenex_11)) (not (= v_prenex_9 v_prenex_8)) (not (= v_prenex_9 v_prenex_14)) (not (= v_prenex_13 v_prenex_12)) (= 0 (select |#memory_int| v_prenex_13)) (not (= v_prenex_11 v_prenex_10))) (and (not (= v_prenex_21 v_prenex_17)) (not (= ULTIMATE.start_main_p1 v_prenex_20)) (not (= v_prenex_20 v_prenex_18)) (not (= v_prenex_16 v_prenex_20)) (not (= ULTIMATE.start_main_p1 v_prenex_17)) (not (= v_prenex_16 v_prenex_19)) (not (= ULTIMATE.start_main_p1 v_prenex_21)) (= 0 (select |#memory_int| v_prenex_18)) (not (= v_prenex_16 v_prenex_18)) (not (= v_prenex_19 v_prenex_17)) .cse0 (not (= v_prenex_21 v_prenex_18)) (= 0 (select |#memory_int| v_prenex_20)) (not (= v_prenex_16 ULTIMATE.start_main_p1)) (= (select |#memory_int| v_prenex_17) 0) (= 0 (select |#memory_int| v_prenex_19)) (not (= v_prenex_20 v_prenex_19)) (not (= v_prenex_20 v_prenex_17)) (not (= v_prenex_21 v_prenex_19)) (not (= ULTIMATE.start_main_p1 v_prenex_19)) (not (= v_prenex_18 v_prenex_17)) (= (select |#memory_int| v_prenex_16) 0) (not (= v_prenex_16 v_prenex_21)) (not (= v_prenex_16 v_prenex_17)) (= 1 (select |#memory_int| v_prenex_15)) (not (= ULTIMATE.start_main_p1 v_prenex_18)) (not (= v_prenex_15 v_prenex_18)) (not (= v_prenex_15 v_prenex_19)) (not (= v_prenex_16 v_prenex_15)) (not (= v_prenex_15 v_prenex_17)) (not (= v_prenex_21 v_prenex_20)) (= 0 (select |#memory_int| v_prenex_21)) (not (= v_prenex_19 v_prenex_18))) (and (not (= v_prenex_22 v_prenex_26)) (not (= v_prenex_22 v_prenex_28)) (not (= v_prenex_27 v_prenex_24)) (not (= ULTIMATE.start_main_p1 v_prenex_26)) (not (= v_prenex_23 v_prenex_26)) (= 0 (select |#memory_int| v_prenex_22)) (not (= ULTIMATE.start_main_p1 v_prenex_24)) (not (= v_prenex_23 v_prenex_25)) (not (= ULTIMATE.start_main_p1 v_prenex_27)) (not (= v_prenex_25 v_prenex_24)) .cse0 (not (= v_prenex_22 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| v_prenex_26)) (not (= v_prenex_28 v_prenex_25)) (not (= v_prenex_28 v_prenex_24)) (not (= v_prenex_22 v_prenex_27)) (not (= v_prenex_23 ULTIMATE.start_main_p1)) (= (select |#memory_int| v_prenex_24) 0) (= 0 (select |#memory_int| v_prenex_25)) (not (= v_prenex_26 v_prenex_25)) (not (= v_prenex_26 v_prenex_24)) (not (= v_prenex_27 v_prenex_25)) (not (= ULTIMATE.start_main_p1 v_prenex_25)) (= 1 (select |#memory_int| v_prenex_28)) (= (select |#memory_int| v_prenex_23) 0) (not (= v_prenex_23 v_prenex_27)) (not (= v_prenex_23 v_prenex_24)) (not (= v_prenex_22 v_prenex_25)) (not (= v_prenex_23 v_prenex_22)) (not (= v_prenex_22 v_prenex_24)) (not (= v_prenex_27 v_prenex_26)) (= 0 (select |#memory_int| v_prenex_27)) (not (= ULTIMATE.start_main_p1 v_prenex_28))) (and (not (= v_prenex_48 v_prenex_45)) (= 0 (select |#memory_int| v_prenex_43)) (not (= ULTIMATE.start_main_p1 v_prenex_45)) (not (= v_prenex_44 v_prenex_47)) (not (= ULTIMATE.start_main_p1 v_prenex_48)) (= 0 (select |#memory_int| v_prenex_46)) (not (= v_prenex_44 v_prenex_46)) (not (= v_prenex_47 v_prenex_45)) .cse0 (not (= v_prenex_43 ULTIMATE.start_main_p1)) (not (= v_prenex_48 v_prenex_46)) (not (= v_prenex_43 v_prenex_48)) (not (= v_prenex_44 ULTIMATE.start_main_p1)) (= (select |#memory_int| v_prenex_45) 0) (= 0 (select |#memory_int| v_prenex_47)) (not (= v_prenex_48 v_prenex_47)) (not (= ULTIMATE.start_main_p1 v_prenex_47)) (not (= v_prenex_46 v_prenex_45)) (= 1 (select |#memory_int| v_prenex_49)) (= (select |#memory_int| v_prenex_44) 0) (not (= v_prenex_44 v_prenex_48)) (not (= v_prenex_44 v_prenex_45)) (not (= ULTIMATE.start_main_p1 v_prenex_46)) (not (= v_prenex_43 v_prenex_46)) (not (= v_prenex_43 v_prenex_47)) (not (= v_prenex_44 v_prenex_43)) (not (= v_prenex_43 v_prenex_45)) (= 0 (select |#memory_int| v_prenex_48)) (not (= v_prenex_49 v_prenex_48)) (not (= v_prenex_47 v_prenex_46))) (and (not (= v_prenex_36 v_prenex_41)) (not (= ULTIMATE.start_main_p1 v_prenex_41)) (not (= v_prenex_41 v_prenex_39)) (not (= v_prenex_37 v_prenex_41)) (= 0 (select |#memory_int| v_prenex_36)) (not (= ULTIMATE.start_main_p1 v_prenex_38)) (not (= v_prenex_37 v_prenex_40)) (= 0 (select |#memory_int| v_prenex_39)) (not (= v_prenex_37 v_prenex_39)) (not (= v_prenex_40 v_prenex_38)) .cse0 (not (= v_prenex_36 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| v_prenex_41)) (not (= v_prenex_37 ULTIMATE.start_main_p1)) (= (select |#memory_int| v_prenex_38) 0) (= 0 (select |#memory_int| v_prenex_40)) (not (= v_prenex_41 v_prenex_40)) (not (= v_prenex_41 v_prenex_38)) (not (= ULTIMATE.start_main_p1 v_prenex_40)) (not (= v_prenex_39 v_prenex_38)) (= 1 (select |#memory_int| v_prenex_42)) (= (select |#memory_int| v_prenex_37) 0) (not (= v_prenex_42 v_prenex_41)) (not (= v_prenex_37 v_prenex_38)) (not (= ULTIMATE.start_main_p1 v_prenex_39)) (not (= v_prenex_36 v_prenex_39)) (not (= v_prenex_36 v_prenex_40)) (not (= v_prenex_37 v_prenex_36)) (not (= v_prenex_37 v_prenex_42)) (not (= v_prenex_36 v_prenex_38)) (not (= v_prenex_40 v_prenex_39))) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (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)) (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)) .cse0 (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_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)) (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)) (= 1 (select |#memory_int| ULTIMATE.start_main_p9)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (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_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_p6 ULTIMATE.start_main_p5))) (and (not (= v_prenex_29 v_prenex_34)) (not (= v_prenex_35 v_prenex_31)) (not (= v_prenex_34 v_prenex_32)) (not (= v_prenex_30 v_prenex_34)) (= 0 (select |#memory_int| v_prenex_29)) (not (= v_prenex_30 v_prenex_33)) (= 0 (select |#memory_int| v_prenex_32)) (not (= v_prenex_30 v_prenex_32)) (not (= v_prenex_33 v_prenex_31)) (not (= v_prenex_35 v_prenex_32)) (= 0 (select |#memory_int| v_prenex_34)) (not (= v_prenex_29 v_prenex_35)) (= (select |#memory_int| v_prenex_31) 0) (= 0 (select |#memory_int| v_prenex_33)) (not (= v_prenex_34 v_prenex_33)) (not (= v_prenex_34 v_prenex_31)) (not (= v_prenex_35 v_prenex_33)) (not (= v_prenex_32 v_prenex_31)) (= (select |#memory_int| v_prenex_30) 0) (not (= v_prenex_30 v_prenex_35)) (not (= v_prenex_30 v_prenex_31)) (= .cse1 1) (not (= ULTIMATE.start_main_p1 v_prenex_32)) (not (= v_prenex_29 v_prenex_32)) (not (= v_prenex_29 v_prenex_33)) (not (= v_prenex_30 v_prenex_29)) (not (= v_prenex_29 v_prenex_31)) (not (= v_prenex_35 v_prenex_34)) (= 0 (select |#memory_int| v_prenex_35)) (not (= v_prenex_33 v_prenex_32)))))) [2019-01-31 14:47:46,136 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 14:47:46,138 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2019-01-31 14:47:46,144 INFO L168 Benchmark]: Toolchain (without parser) took 212319.93 ms. Allocated memory was 140.5 MB in the beginning and 326.6 MB in the end (delta: 186.1 MB). Free memory was 107.6 MB in the beginning and 102.3 MB in the end (delta: 5.3 MB). Peak memory consumption was 191.4 MB. Max. memory is 7.1 GB. [2019-01-31 14:47:46,145 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 140.5 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:47:46,146 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.29 ms. Allocated memory is still 140.5 MB. Free memory was 107.6 MB in the beginning and 105.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-01-31 14:47:46,146 INFO L168 Benchmark]: Boogie Preprocessor took 27.09 ms. Allocated memory is still 140.5 MB. Free memory was 105.0 MB in the beginning and 103.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-31 14:47:46,147 INFO L168 Benchmark]: RCFGBuilder took 1198.25 ms. Allocated memory is still 140.5 MB. Free memory was 103.3 MB in the beginning and 69.4 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. [2019-01-31 14:47:46,148 INFO L168 Benchmark]: TraceAbstraction took 211028.91 ms. Allocated memory was 140.5 MB in the beginning and 326.6 MB in the end (delta: 186.1 MB). Free memory was 68.9 MB in the beginning and 102.3 MB in the end (delta: -33.4 MB). Peak memory consumption was 152.8 MB. Max. memory is 7.1 GB. [2019-01-31 14:47:46,151 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.18 ms. Allocated memory is still 140.5 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.29 ms. Allocated memory is still 140.5 MB. Free memory was 107.6 MB in the beginning and 105.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.09 ms. Allocated memory is still 140.5 MB. Free memory was 105.0 MB in the beginning and 103.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1198.25 ms. Allocated memory is still 140.5 MB. Free memory was 103.3 MB in the beginning and 69.4 MB in the end (delta: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 211028.91 ms. Allocated memory was 140.5 MB in the beginning and 326.6 MB in the end (delta: 186.1 MB). Free memory was 68.9 MB in the beginning and 102.3 MB in the end (delta: -33.4 MB). Peak memory consumption was 152.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...