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-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-15a42f0 [2018-12-18 22:13:12,503 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-18 22:13:12,505 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-18 22:13:12,522 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-18 22:13:12,522 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-18 22:13:12,523 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-18 22:13:12,525 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-18 22:13:12,528 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-18 22:13:12,530 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-18 22:13:12,536 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-18 22:13:12,537 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-18 22:13:12,538 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-18 22:13:12,541 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-18 22:13:12,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-18 22:13:12,543 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-18 22:13:12,545 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-18 22:13:12,547 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-18 22:13:12,550 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-18 22:13:12,552 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-18 22:13:12,555 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-18 22:13:12,556 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-18 22:13:12,558 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-18 22:13:12,563 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-18 22:13:12,563 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-18 22:13:12,563 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-18 22:13:12,564 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-18 22:13:12,565 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-18 22:13:12,565 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-18 22:13:12,566 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-18 22:13:12,570 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-18 22:13:12,570 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-18 22:13:12,571 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-18 22:13:12,571 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-18 22:13:12,571 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-18 22:13:12,574 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-18 22:13:12,575 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-18 22:13:12,575 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 [2018-12-18 22:13:12,595 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-18 22:13:12,595 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-18 22:13:12,596 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-18 22:13:12,596 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-18 22:13:12,596 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-18 22:13:12,597 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-18 22:13:12,597 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-18 22:13:12,598 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-18 22:13:12,598 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-18 22:13:12,598 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-18 22:13:12,598 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-18 22:13:12,598 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-18 22:13:12,599 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-18 22:13:12,599 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-18 22:13:12,600 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-18 22:13:12,600 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-18 22:13:12,600 INFO L133 SettingsManager]: * Use SBE=true [2018-12-18 22:13:12,601 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-18 22:13:12,602 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-18 22:13:12,603 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-18 22:13:12,603 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-18 22:13:12,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-18 22:13:12,603 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-18 22:13:12,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-18 22:13:12,603 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-18 22:13:12,604 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-18 22:13:12,604 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-18 22:13:12,604 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-18 22:13:12,605 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-18 22:13:12,605 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-18 22:13:12,605 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-18 22:13:12,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:13:12,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-18 22:13:12,606 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-18 22:13:12,606 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-18 22:13:12,606 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-18 22:13:12,606 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-18 22:13:12,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-18 22:13:12,607 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-18 22:13:12,607 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-18 22:13:12,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-18 22:13:12,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-18 22:13:12,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-18 22:13:12,682 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-18 22:13:12,683 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-18 22:13:12,684 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-limited.bpl [2018-12-18 22:13:12,684 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-limited.bpl' [2018-12-18 22:13:12,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-18 22:13:12,765 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-18 22:13:12,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-18 22:13:12,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-18 22:13:12,767 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-18 22:13:12,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:12" (1/1) ... [2018-12-18 22:13:12,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:12" (1/1) ... [2018-12-18 22:13:12,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-18 22:13:12,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-18 22:13:12,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-18 22:13:12,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-18 22:13:12,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:12" (1/1) ... [2018-12-18 22:13:12,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:12" (1/1) ... [2018-12-18 22:13:12,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:12" (1/1) ... [2018-12-18 22:13:12,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:12" (1/1) ... [2018-12-18 22:13:12,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:12" (1/1) ... [2018-12-18 22:13:12,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:12" (1/1) ... [2018-12-18 22:13:12,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:12" (1/1) ... [2018-12-18 22:13:12,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-18 22:13:12,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-18 22:13:12,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-18 22:13:12,882 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-18 22:13:12,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:13:12,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-18 22:13:12,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-18 22:13:14,136 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-18 22:13:14,136 INFO L280 CfgBuilder]: Removed 21 assue(true) statements. [2018-12-18 22:13:14,137 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:13:14 BoogieIcfgContainer [2018-12-18 22:13:14,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-18 22:13:14,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-18 22:13:14,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-18 22:13:14,142 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-18 22:13:14,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:12" (1/2) ... [2018-12-18 22:13:14,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e2fb128 and model type speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:13:14, skipping insertion in model container [2018-12-18 22:13:14,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:13:14" (2/2) ... [2018-12-18 22:13:14,146 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-9-limited.bpl [2018-12-18 22:13:14,156 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-18 22:13:14,165 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-18 22:13:14,183 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-18 22:13:14,218 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-18 22:13:14,218 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-18 22:13:14,218 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-18 22:13:14,218 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-18 22:13:14,218 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-18 22:13:14,219 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-18 22:13:14,219 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-18 22:13:14,219 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-18 22:13:14,235 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-18 22:13:14,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-18 22:13:14,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:13:14,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-18 22:13:14,247 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:13:14,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:13:14,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1000, now seen corresponding path program 1 times [2018-12-18 22:13:14,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:13:14,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:13:14,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:13:14,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:13:14,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:13:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:13:14,612 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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;#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 [2018-12-18 22:13:14,631 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 [2018-12-18 22:13:14,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:13:14,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:13:14,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 22:13:14,636 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:13:14,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:13:14,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:13:14,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 22:13:14,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:13:14,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 22:13:14,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 22:13:14,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:13:14,687 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-12-18 22:13:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:13:15,127 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2018-12-18 22:13:15,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:13:15,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:13:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:13:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:13:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2018-12-18 22:13:15,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:13:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2018-12-18 22:13:15,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2018-12-18 22:13:15,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:13:15,592 INFO L225 Difference]: With dead ends: 41 [2018-12-18 22:13:15,592 INFO L226 Difference]: Without dead ends: 36 [2018-12-18 22:13:15,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:13:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-18 22:13:15,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2018-12-18 22:13:15,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:13:15,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 20 states. [2018-12-18 22:13:15,676 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 20 states. [2018-12-18 22:13:15,677 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 20 states. [2018-12-18 22:13:15,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:13:15,687 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2018-12-18 22:13:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2018-12-18 22:13:15,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:13:15,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:13:15,689 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 36 states. [2018-12-18 22:13:15,690 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 36 states. [2018-12-18 22:13:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:13:15,703 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2018-12-18 22:13:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2018-12-18 22:13:15,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:13:15,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:13:15,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:13:15,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:13:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-18 22:13:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-18 22:13:15,716 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 2 [2018-12-18 22:13:15,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:13:15,716 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-18 22:13:15,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 22:13:15,717 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-18 22:13:15,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:13:15,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:13:15,718 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:13:15,720 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:13:15,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:13:15,720 INFO L82 PathProgramCache]: Analyzing trace with hash 30388, now seen corresponding path program 1 times [2018-12-18 22:13:15,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:13:15,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:13:15,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:13:15,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:13:15,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:13:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:13:16,128 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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;#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 [2018-12-18 22:13:16,129 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 [2018-12-18 22:13:16,130 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 [2018-12-18 22:13:16,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:13:16,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:13:16,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:13:16,131 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-18 22:13:16,134 INFO L207 CegarAbsIntRunner]: [0], [18], [39] [2018-12-18 22:13:16,170 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-18 22:13:16,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 22:13:16,272 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-18 22:13:16,273 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 110 root evaluator evaluations with a maximum evaluation depth of 3. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-18 22:13:16,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:13:16,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-18 22:13:16,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:13:16,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 22:13:16,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:13:16,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:13:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:13:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:13:16,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:13:16,908 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-12-18 22:13:16,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-12-18 22:13:16,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:16,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, 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 [2018-12-18 22:13:16,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:16,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,001 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 [2018-12-18 22:13:17,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,102 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 [2018-12-18 22:13:17,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,158 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,163 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 [2018-12-18 22:13:17,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,353 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 [2018-12-18 22:13:17,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,485 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,489 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 [2018-12-18 22:13:17,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,604 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 [2018-12-18 22:13:17,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:17,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 190 [2018-12-18 22:13:17,884 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-18 22:13:18,055 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:18,231 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:18,363 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:18,465 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:18,508 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:18,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:18,579 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:18,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:18,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:18,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:18,737 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 92 treesize of output 95 [2018-12-18 22:13:18,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 77 [2018-12-18 22:13:18,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:18,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:18,825 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 73 treesize of output 78 [2018-12-18 22:13:18,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:18,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:18,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:18,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:18,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:18,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:18,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:18,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 107 [2018-12-18 22:13:19,089 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-12-18 22:13:19,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,187 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 [2018-12-18 22:13:19,433 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2018-12-18 22:13:19,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:19,501 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 [2018-12-18 22:13:20,025 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-12-18 22:13:20,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:20,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:20,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:20,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:20,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:20,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:20,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:20,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:20,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:20,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:20,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:20,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:20,103 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 [2018-12-18 22:13:20,113 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-18 22:13:20,116 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:20,119 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:20,122 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:20,126 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:20,129 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:20,133 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:20,190 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. [2018-12-18 22:13:20,190 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:149, output treesize:70 [2018-12-18 22:13:22,358 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:13:22,358 WARN L384 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 ((.cse0 (store |v_#valid_11| ULTIMATE.start_main_p1 1))) (let ((.cse2 (store (store (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3 1) ULTIMATE.start_main_p4 1))) (let ((.cse3 (store .cse2 ULTIMATE.start_main_p5 1))) (let ((.cse1 (store .cse3 ULTIMATE.start_main_p6 1))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select .cse0 ULTIMATE.start_main_p2)) (= (select (store .cse1 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select .cse2 ULTIMATE.start_main_p5) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select .cse3 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|) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (= (select .cse1 ULTIMATE.start_main_p7) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)))))) [2018-12-18 22:13:22,359 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p9, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2018-12-18 22:13:24,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:24,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,069 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:25,105 INFO L303 Elim1Store]: Index analysis took 187 ms [2018-12-18 22:13:25,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 190 [2018-12-18 22:13:25,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 22:13:25,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-18 22:13:25,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:80, output treesize:70 [2018-12-18 22:13:27,431 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:13:27,431 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_48|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p3, ULTIMATE.start_main_p9, ULTIMATE.start_main_p7, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p2, ULTIMATE.start_main_p8]. (let ((.cse0 (select |v_#memory_int_48| ULTIMATE.start_main_p4))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p1)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p9)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p7)) (= (store |v_#memory_int_48| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p6)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p3)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p8)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 .cse0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2018-12-18 22:13:27,432 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p9, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) (- 1)) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2018-12-18 22:13:33,347 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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;#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 (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} is VALID [2018-12-18 22:13:36,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {173#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {177#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is UNKNOWN [2018-12-18 22:13:36,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {177#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] <= 0); {167#false} is VALID [2018-12-18 22:13:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:13:36,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:13:36,193 INFO L273 TraceCheckUtils]: 2: Hoare triple {181#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {167#false} is VALID [2018-12-18 22:13:36,195 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#(<= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {181#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:13:36,199 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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;#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#(<= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:13:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:13:36,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-18 22:13:36,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2018-12-18 22:13:36,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:13:36,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:13:36,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:13:36,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-18 22:13:36,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:13:36,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-18 22:13:36,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-18 22:13:36,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=29, Unknown=1, NotChecked=0, Total=56 [2018-12-18 22:13:36,233 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 4 states. [2018-12-18 22:13:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:13:36,416 INFO L93 Difference]: Finished difference Result 22 states and 48 transitions. [2018-12-18 22:13:36,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:13:36,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:13:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:13:36,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:13:36,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-12-18 22:13:36,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:13:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-12-18 22:13:36,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-12-18 22:13:36,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:13:36,470 INFO L225 Difference]: With dead ends: 22 [2018-12-18 22:13:36,470 INFO L226 Difference]: Without dead ends: 21 [2018-12-18 22:13:36,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=26, Invalid=29, Unknown=1, NotChecked=0, Total=56 [2018-12-18 22:13:36,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-18 22:13:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-18 22:13:36,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:13:36,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2018-12-18 22:13:36,476 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2018-12-18 22:13:36,477 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2018-12-18 22:13:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:13:36,479 INFO L93 Difference]: Finished difference Result 21 states and 47 transitions. [2018-12-18 22:13:36,479 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 47 transitions. [2018-12-18 22:13:36,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:13:36,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:13:36,480 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2018-12-18 22:13:36,480 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2018-12-18 22:13:36,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:13:36,483 INFO L93 Difference]: Finished difference Result 21 states and 47 transitions. [2018-12-18 22:13:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 47 transitions. [2018-12-18 22:13:36,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:13:36,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:13:36,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:13:36,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:13:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-18 22:13:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-18 22:13:36,486 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 3 [2018-12-18 22:13:36,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:13:36,487 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-18 22:13:36,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-18 22:13:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-18 22:13:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:13:36,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:13:36,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:13:36,488 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:13:36,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:13:36,489 INFO L82 PathProgramCache]: Analyzing trace with hash 30946, now seen corresponding path program 1 times [2018-12-18 22:13:36,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:13:36,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:13:36,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:13:36,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:13:36,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:13:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:13:36,650 INFO L273 TraceCheckUtils]: 0: Hoare triple {277#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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;#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]; {279#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p9 (+ (select |#memory_int| ULTIMATE.start_main_p9) 1)) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)))} is VALID [2018-12-18 22:13:36,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p9 (+ (select |#memory_int| ULTIMATE.start_main_p9) 1)) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)))} #memory_int := #memory_int[main_p9 := #memory_int[main_p9] + 1]; {280#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:13:36,663 INFO L273 TraceCheckUtils]: 2: Hoare triple {280#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {278#false} is VALID [2018-12-18 22:13:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:13:36,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:13:36,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:13:36,664 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-18 22:13:36,664 INFO L207 CegarAbsIntRunner]: [0], [36], [39] [2018-12-18 22:13:36,667 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-18 22:13:36,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 22:13:36,690 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-18 22:13:36,690 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 110 root evaluator evaluations with a maximum evaluation depth of 3. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-18 22:13:36,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:13:36,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-18 22:13:36,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:13:36,691 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 [2018-12-18 22:13:36,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:13:36,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:13:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:13:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:13:36,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:13:36,937 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-12-18 22:13:36,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:36,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:36,951 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 80 treesize of output 83 [2018-12-18 22:13:36,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2018-12-18 22:13:37,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 86 [2018-12-18 22:13:37,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,248 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 51 treesize of output 91 [2018-12-18 22:13:37,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,420 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 42 treesize of output 105 [2018-12-18 22:13:37,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2018-12-18 22:13:37,633 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-18 22:13:37,636 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:37,643 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:37,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:37,647 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:37,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:37,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-12-18 22:13:37,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,744 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 [2018-12-18 22:13:37,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:37,925 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 [2018-12-18 22:13:38,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,109 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 [2018-12-18 22:13:38,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,197 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 [2018-12-18 22:13:38,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,228 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 [2018-12-18 22:13:38,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,313 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,315 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 [2018-12-18 22:13:38,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,457 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 [2018-12-18 22:13:38,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,512 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 190 [2018-12-18 22:13:38,524 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-18 22:13:38,683 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:38,766 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:38,886 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:38,946 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:38,978 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:39,028 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:39,050 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:39,070 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:39,124 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. [2018-12-18 22:13:39,125 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 9 variables, input treesize:137, output treesize:70 [2018-12-18 22:13:41,229 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:13:41,229 WARN L384 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_p8, |v_#valid_12|]. (let ((.cse2 (store |v_#valid_12| ULTIMATE.start_main_p1 1))) (let ((.cse3 (store (store .cse2 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3 1))) (let ((.cse1 (store .cse3 ULTIMATE.start_main_p4 1))) (let ((.cse0 (store .cse1 ULTIMATE.start_main_p5 1))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (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|) (= (select .cse0 ULTIMATE.start_main_p6) 0) (= 0 (select .cse1 ULTIMATE.start_main_p5)) (= 0 (select .cse2 ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select .cse3 ULTIMATE.start_main_p4)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select (store .cse0 ULTIMATE.start_main_p6 1) ULTIMATE.start_main_p7) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)))))) [2018-12-18 22:13:41,229 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2018-12-18 22:13:41,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,398 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:41,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 196 [2018-12-18 22:13:41,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 22:13:41,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-18 22:13:41,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:80, output treesize:70 [2018-12-18 22:13:43,717 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:13:43,717 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_51|, ULTIMATE.start_main_p9, ULTIMATE.start_main_p3, ULTIMATE.start_main_p8, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7]. (let ((.cse0 (select |v_#memory_int_51| ULTIMATE.start_main_p9))) (and (= (select |v_#memory_int_51| ULTIMATE.start_main_p3) 0) (= (select |v_#memory_int_51| ULTIMATE.start_main_p8) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= .cse0 0) (= (select |v_#memory_int_51| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |v_#memory_int_51| ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |v_#memory_int_51| ULTIMATE.start_main_p7) 0) (= (select |v_#memory_int_51| ULTIMATE.start_main_p5) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (= (select |v_#memory_int_51| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select |v_#memory_int_51| ULTIMATE.start_main_p6) 0) (= (store |v_#memory_int_51| ULTIMATE.start_main_p9 (+ .cse0 1)) |#memory_int|))) [2018-12-18 22:13:43,717 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p9, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 1 (select |#memory_int| ULTIMATE.start_main_p9)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2018-12-18 22:13:51,700 INFO L273 TraceCheckUtils]: 0: Hoare triple {277#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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;#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]; {284#(and (= (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_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)))} is UNKNOWN [2018-12-18 22:13:54,633 INFO L273 TraceCheckUtils]: 1: Hoare triple {284#(and (= (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_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)))} #memory_int := #memory_int[main_p9 := #memory_int[main_p9] + 1]; {288#(and (= (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_p8 Int) (ULTIMATE.start_main_p9 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 1 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} is UNKNOWN [2018-12-18 22:13:54,634 INFO L273 TraceCheckUtils]: 2: Hoare triple {288#(and (= (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_p8 Int) (ULTIMATE.start_main_p9 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 1 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} assume !(#memory_int[main_p1] <= 0); {278#false} is VALID [2018-12-18 22:13:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:13:54,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:13:54,659 INFO L273 TraceCheckUtils]: 2: Hoare triple {292#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {278#false} is VALID [2018-12-18 22:13:54,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {296#(<= (select (store |#memory_int| ULTIMATE.start_main_p9 (+ (select |#memory_int| ULTIMATE.start_main_p9) 1)) ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p9 := #memory_int[main_p9] + 1]; {292#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:13:54,664 INFO L273 TraceCheckUtils]: 0: Hoare triple {277#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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;#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]; {296#(<= (select (store |#memory_int| ULTIMATE.start_main_p9 (+ (select |#memory_int| ULTIMATE.start_main_p9) 1)) ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:13:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:13:54,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 22:13:54,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-18 22:13:54,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 22:13:54,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-18 22:13:54,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:13:54,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-18 22:13:57,249 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-18 22:13:57,250 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:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") 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.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:666) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:538) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:455) 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) ... 25 more [2018-12-18 22:13:57,257 INFO L168 Benchmark]: Toolchain (without parser) took 44490.45 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 815.8 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -545.7 MB). Peak memory consumption was 270.1 MB. Max. memory is 7.1 GB. [2018-12-18 22:13:57,259 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:13:57,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:13:57,260 INFO L168 Benchmark]: Boogie Preprocessor took 33.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:13:57,260 INFO L168 Benchmark]: RCFGBuilder took 1255.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-12-18 22:13:57,262 INFO L168 Benchmark]: TraceAbstraction took 43115.17 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 815.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -588.0 MB). Peak memory consumption was 227.8 MB. Max. memory is 7.1 GB. [2018-12-18 22:13:57,269 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.43 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.33 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1255.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43115.17 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 815.8 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -588.0 MB). Peak memory consumption was 227.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:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : 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...