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-10-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-824f902 [2018-12-19 12:06:52,063 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-19 12:06:52,065 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-19 12:06:52,077 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-19 12:06:52,078 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-19 12:06:52,079 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-19 12:06:52,080 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-19 12:06:52,084 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-19 12:06:52,090 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-19 12:06:52,091 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-19 12:06:52,092 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-19 12:06:52,092 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-19 12:06:52,096 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-19 12:06:52,097 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-19 12:06:52,098 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-19 12:06:52,102 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-19 12:06:52,103 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-19 12:06:52,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-19 12:06:52,110 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-19 12:06:52,115 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-19 12:06:52,117 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-19 12:06:52,118 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-19 12:06:52,124 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-19 12:06:52,124 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-19 12:06:52,124 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-19 12:06:52,126 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-19 12:06:52,127 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-19 12:06:52,129 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-19 12:06:52,130 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-19 12:06:52,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-19 12:06:52,132 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-19 12:06:52,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-19 12:06:52,133 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-19 12:06:52,136 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-19 12:06:52,137 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-19 12:06:52,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-19 12:06:52,138 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-19 12:06:52,160 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-19 12:06:52,160 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-19 12:06:52,162 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-19 12:06:52,162 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-19 12:06:52,162 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-19 12:06:52,162 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-19 12:06:52,162 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-19 12:06:52,163 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-19 12:06:52,163 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-19 12:06:52,163 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-19 12:06:52,163 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-19 12:06:52,163 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-19 12:06:52,164 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-19 12:06:52,164 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-19 12:06:52,165 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-19 12:06:52,165 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-19 12:06:52,165 INFO L133 SettingsManager]: * Use SBE=true [2018-12-19 12:06:52,166 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-19 12:06:52,166 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-19 12:06:52,166 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-19 12:06:52,166 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-19 12:06:52,167 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-19 12:06:52,167 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-19 12:06:52,167 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-19 12:06:52,167 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-19 12:06:52,167 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-19 12:06:52,168 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-19 12:06:52,168 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-19 12:06:52,168 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-19 12:06:52,168 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-19 12:06:52,168 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-19 12:06:52,169 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-19 12:06:52,169 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-19 12:06:52,169 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-19 12:06:52,169 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-19 12:06:52,169 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-19 12:06:52,170 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-19 12:06:52,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-19 12:06:52,170 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-19 12:06:52,170 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-19 12:06:52,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-19 12:06:52,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-19 12:06:52,217 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-19 12:06:52,219 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-19 12:06:52,220 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-19 12:06:52,220 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-limited.bpl [2018-12-19 12:06:52,221 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-limited.bpl' [2018-12-19 12:06:52,283 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-19 12:06:52,288 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-19 12:06:52,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-19 12:06:52,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-19 12:06:52,289 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-19 12:06:52,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:06:52" (1/1) ... [2018-12-19 12:06:52,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:06:52" (1/1) ... [2018-12-19 12:06:52,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-19 12:06:52,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-19 12:06:52,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-19 12:06:52,374 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-19 12:06:52,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:06:52" (1/1) ... [2018-12-19 12:06:52,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:06:52" (1/1) ... [2018-12-19 12:06:52,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:06:52" (1/1) ... [2018-12-19 12:06:52,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:06:52" (1/1) ... [2018-12-19 12:06:52,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:06:52" (1/1) ... [2018-12-19 12:06:52,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:06:52" (1/1) ... [2018-12-19 12:06:52,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:06:52" (1/1) ... [2018-12-19 12:06:52,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-19 12:06:52,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-19 12:06:52,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-19 12:06:52,423 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-19 12:06:52,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:06:52" (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-19 12:06:52,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-19 12:06:52,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-19 12:06:53,660 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-19 12:06:53,661 INFO L280 CfgBuilder]: Removed 23 assue(true) statements. [2018-12-19 12:06:53,662 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:06:53 BoogieIcfgContainer [2018-12-19 12:06:53,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-19 12:06:53,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-19 12:06:53,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-19 12:06:53,671 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-19 12:06:53,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:06:52" (1/2) ... [2018-12-19 12:06:53,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa1121b and model type speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:06:53, skipping insertion in model container [2018-12-19 12:06:53,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:06:53" (2/2) ... [2018-12-19 12:06:53,680 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-10-limited.bpl [2018-12-19 12:06:53,701 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-19 12:06:53,721 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-12-19 12:06:53,760 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-12-19 12:06:53,834 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-19 12:06:53,835 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-19 12:06:53,835 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-19 12:06:53,835 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-19 12:06:53,835 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-19 12:06:53,836 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-19 12:06:53,836 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-19 12:06:53,836 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-19 12:06:53,869 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-12-19 12:06:53,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-19 12:06:53,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:06:53,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-19 12:06:53,903 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr9ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:06:53,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:06:53,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1004, now seen corresponding path program 1 times [2018-12-19 12:06:53,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:06:54,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:06:54,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:06:54,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:06:54,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:06:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:06:54,330 INFO L273 TraceCheckUtils]: 0: Hoare triple {26#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p10 := malloc_ptr;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;assume main_p9 < main_p10;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {28#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 12:06:54,351 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {27#false} is VALID [2018-12-19 12:06:54,354 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-19 12:06:54,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 12:06:54,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-19 12:06:54,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:06:54,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-19 12:06:54,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:06:54,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-19 12:06:54,399 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-19 12:06:54,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-19 12:06:54,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-19 12:06:54,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 12:06:54,412 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-12-19 12:06:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:06:55,161 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2018-12-19 12:06:55,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 12:06:55,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-19 12:06:55,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:06:55,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:06:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-12-19 12:06:55,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:06:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-12-19 12:06:55,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2018-12-19 12:06:55,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:06:55,437 INFO L225 Difference]: With dead ends: 45 [2018-12-19 12:06:55,438 INFO L226 Difference]: Without dead ends: 40 [2018-12-19 12:06:55,445 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-19 12:06:55,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-19 12:06:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2018-12-19 12:06:55,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:06:55,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 22 states. [2018-12-19 12:06:55,563 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 22 states. [2018-12-19 12:06:55,564 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 22 states. [2018-12-19 12:06:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:06:55,572 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2018-12-19 12:06:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2018-12-19 12:06:55,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:06:55,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:06:55,575 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 40 states. [2018-12-19 12:06:55,576 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 40 states. [2018-12-19 12:06:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:06:55,582 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2018-12-19 12:06:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2018-12-19 12:06:55,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:06:55,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:06:55,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:06:55,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:06:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-19 12:06:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2018-12-19 12:06:55,593 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 41 transitions. Word has length 2 [2018-12-19 12:06:55,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:06:55,594 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 41 transitions. [2018-12-19 12:06:55,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-19 12:06:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 41 transitions. [2018-12-19 12:06:55,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-19 12:06:55,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:06:55,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-19 12:06:55,597 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr9ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:06:55,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:06:55,598 INFO L82 PathProgramCache]: Analyzing trace with hash 30392, now seen corresponding path program 1 times [2018-12-19 12:06:55,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:06:55,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:06:55,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:06:55,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:06:55,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:06:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:06:56,145 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-19 12:06:56,205 INFO L273 TraceCheckUtils]: 0: Hoare triple {182#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p10 := malloc_ptr;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;assume main_p9 < main_p10;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {184#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2018-12-19 12:06:56,207 INFO L273 TraceCheckUtils]: 1: Hoare triple {184#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {185#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-19 12:06:56,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {185#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {183#false} is VALID [2018-12-19 12:06:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:06:56,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:06:56,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:06:56,214 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-19 12:06:56,218 INFO L207 CegarAbsIntRunner]: [0], [18], [43] [2018-12-19 12:06:56,291 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-19 12:06:56,291 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:06:56,450 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:06:56,452 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 122 root evaluator evaluations with a maximum evaluation depth of 3. Performed 122 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-19 12:06:56,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:06:56,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:06:56,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:06:56,462 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-19 12:06:56,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:06:56,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:06:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:06:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:06:56,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:06:57,455 WARN L181 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-12-19 12:06:57,511 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 33 treesize of output 36 [2018-12-19 12:06:57,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 42 [2018-12-19 12:06:57,604 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 52 [2018-12-19 12:06:57,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 66 [2018-12-19 12:06:57,738 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,742 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 84 [2018-12-19 12:06:57,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 106 [2018-12-19 12:06:57,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:57,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 132 [2018-12-19 12:06:58,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 162 [2018-12-19 12:06:58,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 196 [2018-12-19 12:06:58,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,510 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:58,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 231 [2018-12-19 12:06:58,529 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-19 12:06:58,781 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:58,910 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:59,003 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:59,077 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:59,155 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:59,268 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:59,314 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:59,379 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:59,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:06:59,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,637 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-19 12:06:59,681 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-19 12:06:59,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:06:59,951 INFO L303 Elim1Store]: Index analysis took 132 ms [2018-12-19 12:06:59,952 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 70 treesize of output 98 [2018-12-19 12:06:59,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 87 [2018-12-19 12:07:00,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,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, 16 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 121 [2018-12-19 12:07:00,389 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-12-19 12:07:00,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,461 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 50 treesize of output 137 [2018-12-19 12:07:00,526 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 53 treesize of output 134 [2018-12-19 12:07:00,751 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-12-19 12:07:00,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:00,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 30 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-19 12:07:00,837 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:00,841 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:00,844 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:00,848 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:00,851 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:00,855 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:00,859 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:00,862 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-19 12:07:00,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:00,938 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 10 variables, input treesize:155, output treesize:78 [2018-12-19 12:07:03,705 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:03,706 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_52|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p9, ULTIMATE.start_main_p10, |v_#valid_12|]. (let ((.cse1 (store |v_#valid_12| ULTIMATE.start_main_p1 1))) (let ((.cse2 (store (store .cse1 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3 1))) (let ((.cse0 (store (store .cse2 ULTIMATE.start_main_p4 1) ULTIMATE.start_main_p5 1))) (let ((.cse3 (store .cse0 ULTIMATE.start_main_p6 1))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select .cse0 ULTIMATE.start_main_p6) 0) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= (store (store (store (store (store (store (store (store (store (store |v_#memory_int_52| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) ULTIMATE.start_main_p4 0) ULTIMATE.start_main_p5 0) ULTIMATE.start_main_p6 0) ULTIMATE.start_main_p7 0) ULTIMATE.start_main_p8 0) ULTIMATE.start_main_p9 0) ULTIMATE.start_main_p10 0) |#memory_int|) (= 0 (select .cse1 ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select .cse2 ULTIMATE.start_main_p4)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select .cse3 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) (= 0 (select (store (store .cse3 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8 1) ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)))))) [2018-12-19 12:07:03,706 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p10, ULTIMATE.start_main_p9, 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_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 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-19 12:07:06,180 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-12-19 12:07:06,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,301 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-19 12:07:06,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 231 [2018-12-19 12:07:06,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-19 12:07:06,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2018-12-19 12:07:06,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:88, output treesize:78 [2018-12-19 12:07:09,063 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-19 12:07:09,064 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_53|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p9, ULTIMATE.start_main_p3, ULTIMATE.start_main_p7, ULTIMATE.start_main_p10, ULTIMATE.start_main_p8, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_53| ULTIMATE.start_main_p4))) (and (= (select |v_#memory_int_53| ULTIMATE.start_main_p9) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_53| ULTIMATE.start_main_p7) 0) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= (select |v_#memory_int_53| ULTIMATE.start_main_p8) 0) (= .cse0 0) (= (select |v_#memory_int_53| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |v_#memory_int_53| ULTIMATE.start_main_p5) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (store |v_#memory_int_53| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= (select |v_#memory_int_53| ULTIMATE.start_main_p6) 0) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (= (select |v_#memory_int_53| ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |v_#memory_int_53| ULTIMATE.start_main_p10)) (= (select |v_#memory_int_53| ULTIMATE.start_main_p1) 0))) [2018-12-19 12:07:09,064 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p10, ULTIMATE.start_main_p9, 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_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 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-19 12:07:15,049 INFO L273 TraceCheckUtils]: 0: Hoare triple {182#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p10 := malloc_ptr;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;assume main_p9 < main_p10;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {189#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 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_p10)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (< 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)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (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-19 12:07:17,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 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_p10)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (< 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)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (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]; {193#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 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_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 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)))))} is UNKNOWN [2018-12-19 12:07:17,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {193#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 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_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 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)))))} assume !(#memory_int[main_p1] >= 0); {183#false} is VALID [2018-12-19 12:07:17,623 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-19 12:07:17,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:07:17,684 INFO L273 TraceCheckUtils]: 2: Hoare triple {197#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {183#false} is VALID [2018-12-19 12:07:17,690 INFO L273 TraceCheckUtils]: 1: Hoare triple {201#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {197#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:17,693 INFO L273 TraceCheckUtils]: 0: Hoare triple {182#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p10 := malloc_ptr;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;assume main_p9 < main_p10;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {201#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))} is VALID [2018-12-19 12:07:17,694 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-19 12:07:17,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:07:17,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-19 12:07:17,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:07:17,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-19 12:07:17,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:07:17,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-19 12:07:20,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 5 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-12-19 12:07:20,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-19 12:07:20,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-19 12:07:20,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=31, Unknown=1, NotChecked=0, Total=56 [2018-12-19 12:07:20,354 INFO L87 Difference]: Start difference. First operand 22 states and 41 transitions. Second operand 6 states. [2018-12-19 12:07:25,802 WARN L181 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-12-19 12:07:30,118 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-19 12:07:30,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 12:07:30,120 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.predicates.PredicateUtils.isInductiveHelper(PredicateUtils.java:346) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:208) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:163) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.reviewInductiveInternal(EfficientHoareTripleChecker.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) 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) ... 43 more [2018-12-19 12:07:30,125 INFO L168 Benchmark]: Toolchain (without parser) took 37838.74 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 648.0 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -55.4 MB). Peak memory consumption was 592.6 MB. Max. memory is 7.1 GB. [2018-12-19 12:07:30,127 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 12:07:30,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 12:07:30,128 INFO L168 Benchmark]: Boogie Preprocessor took 48.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 12:07:30,128 INFO L168 Benchmark]: RCFGBuilder took 1239.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-12-19 12:07:30,129 INFO L168 Benchmark]: TraceAbstraction took 36459.63 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 648.0 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -108.3 MB). Peak memory consumption was 539.7 MB. Max. memory is 7.1 GB. [2018-12-19 12:07:30,133 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.63 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1239.91 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 36459.63 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 648.0 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -108.3 MB). Peak memory consumption was 539.7 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...