java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-15a42f0 [2018-12-18 22:13:16,369 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-18 22:13:16,371 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-18 22:13:16,388 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-18 22:13:16,388 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-18 22:13:16,389 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-18 22:13:16,391 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-18 22:13:16,394 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-18 22:13:16,395 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-18 22:13:16,397 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-18 22:13:16,398 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-18 22:13:16,398 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-18 22:13:16,401 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-18 22:13:16,402 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-18 22:13:16,403 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-18 22:13:16,404 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-18 22:13:16,405 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-18 22:13:16,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-18 22:13:16,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-18 22:13:16,411 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-18 22:13:16,412 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-18 22:13:16,413 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-18 22:13:16,416 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-18 22:13:16,416 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-18 22:13:16,416 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-18 22:13:16,417 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-18 22:13:16,418 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-18 22:13:16,419 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-18 22:13:16,420 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-18 22:13:16,421 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-18 22:13:16,421 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-18 22:13:16,422 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-18 22:13:16,422 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-18 22:13:16,423 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-18 22:13:16,424 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-18 22:13:16,424 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-18 22:13:16,425 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:16,441 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-18 22:13:16,441 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-18 22:13:16,443 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-18 22:13:16,443 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-18 22:13:16,443 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-18 22:13:16,443 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-18 22:13:16,444 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-18 22:13:16,447 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-18 22:13:16,447 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-18 22:13:16,447 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-18 22:13:16,447 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-18 22:13:16,447 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-18 22:13:16,448 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-18 22:13:16,448 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-18 22:13:16,448 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-18 22:13:16,450 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-18 22:13:16,450 INFO L133 SettingsManager]: * Use SBE=true [2018-12-18 22:13:16,450 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-18 22:13:16,450 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-18 22:13:16,450 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-18 22:13:16,452 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-18 22:13:16,452 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-18 22:13:16,452 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-18 22:13:16,453 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-18 22:13:16,453 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-18 22:13:16,453 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-18 22:13:16,453 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-18 22:13:16,453 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-18 22:13:16,454 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-18 22:13:16,454 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-18 22:13:16,454 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-18 22:13:16,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:13:16,454 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-18 22:13:16,455 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-18 22:13:16,455 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-18 22:13:16,455 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-18 22:13:16,455 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-18 22:13:16,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-18 22:13:16,455 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-18 22:13:16,456 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-18 22:13:16,498 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-18 22:13:16,510 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-18 22:13:16,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-18 22:13:16,517 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-18 22:13:16,518 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-18 22:13:16,518 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl [2018-12-18 22:13:16,519 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl' [2018-12-18 22:13:16,565 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-18 22:13:16,567 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-18 22:13:16,571 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-18 22:13:16,571 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-18 22:13:16,572 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-18 22:13:16,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:16" (1/1) ... [2018-12-18 22:13:16,611 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:16" (1/1) ... [2018-12-18 22:13:16,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-18 22:13:16,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-18 22:13:16,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-18 22:13:16,664 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-18 22:13:16,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:16" (1/1) ... [2018-12-18 22:13:16,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:16" (1/1) ... [2018-12-18 22:13:16,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:16" (1/1) ... [2018-12-18 22:13:16,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:16" (1/1) ... [2018-12-18 22:13:16,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:16" (1/1) ... [2018-12-18 22:13:16,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:16" (1/1) ... [2018-12-18 22:13:16,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:16" (1/1) ... [2018-12-18 22:13:16,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-18 22:13:16,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-18 22:13:16,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-18 22:13:16,709 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-18 22:13:16,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:16" (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:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-18 22:13:16,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-18 22:13:17,992 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-18 22:13:17,992 INFO L280 CfgBuilder]: Removed 21 assue(true) statements. [2018-12-18 22:13:17,993 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:13:17 BoogieIcfgContainer [2018-12-18 22:13:17,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-18 22:13:17,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-18 22:13:17,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-18 22:13:17,998 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-18 22:13:17,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:13:16" (1/2) ... [2018-12-18 22:13:17,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@371d3e96 and model type speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:13:17, skipping insertion in model container [2018-12-18 22:13:17,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:13:17" (2/2) ... [2018-12-18 22:13:18,001 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-9-unlimited.bpl [2018-12-18 22:13:18,012 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-18 22:13:18,021 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-12-18 22:13:18,039 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-12-18 22:13:18,076 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-18 22:13:18,076 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-18 22:13:18,077 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-18 22:13:18,077 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-18 22:13:18,077 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-18 22:13:18,077 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-18 22:13:18,078 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-18 22:13:18,078 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-18 22:13:18,094 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-18 22:13:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-18 22:13:18,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:13:18,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-18 22:13:18,105 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:13:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:13:18,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1000, now seen corresponding path program 1 times [2018-12-18 22:13:18,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:13:18,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:13:18,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:13:18,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:13:18,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:13:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:13:18,438 INFO L273 TraceCheckUtils]: 0: Hoare triple {24#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {26#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:13:18,457 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:18,461 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:18,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:13:18,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 22:13:18,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:13:18,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:13:18,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:13:18,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 22:13:18,516 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:18,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 22:13:18,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 22:13:18,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:13:18,530 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-12-18 22:13:19,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:13:19,100 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2018-12-18 22:13:19,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:13:19,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:13:19,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:13:19,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:13:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2018-12-18 22:13:19,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:13:19,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2018-12-18 22:13:19,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2018-12-18 22:13:19,590 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:19,603 INFO L225 Difference]: With dead ends: 41 [2018-12-18 22:13:19,604 INFO L226 Difference]: Without dead ends: 36 [2018-12-18 22:13:19,608 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:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-18 22:13:19,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2018-12-18 22:13:19,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:13:19,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 20 states. [2018-12-18 22:13:19,656 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 20 states. [2018-12-18 22:13:19,656 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 20 states. [2018-12-18 22:13:19,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:13:19,661 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2018-12-18 22:13:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2018-12-18 22:13:19,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:13:19,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:13:19,663 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 36 states. [2018-12-18 22:13:19,664 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 36 states. [2018-12-18 22:13:19,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:13:19,668 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2018-12-18 22:13:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2018-12-18 22:13:19,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:13:19,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:13:19,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:13:19,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:13:19,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-18 22:13:19,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-18 22:13:19,675 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 2 [2018-12-18 22:13:19,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:13:19,675 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-18 22:13:19,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 22:13:19,675 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-18 22:13:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:13:19,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:13:19,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:13:19,677 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:13:19,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:13:19,678 INFO L82 PathProgramCache]: Analyzing trace with hash 30388, now seen corresponding path program 1 times [2018-12-18 22:13:19,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:13:19,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:13:19,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:13:19,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:13:19,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:13:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:13:20,128 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2018-12-18 22:13:20,188 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {168#(or (and (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p4) 0)) (= 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-18 22:13:20,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#(or (and (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p4) 0)) (= 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]; {169#(or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (<= (+ (select |#memory_int| ULTIMATE.start_main_p1) 1) 0))} is VALID [2018-12-18 22:13:20,192 INFO L273 TraceCheckUtils]: 2: Hoare triple {169#(or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (<= (+ (select |#memory_int| ULTIMATE.start_main_p1) 1) 0))} assume !(#memory_int[main_p1] <= 0); {167#false} is VALID [2018-12-18 22:13:20,193 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:20,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:13:20,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:13:20,195 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-18 22:13:20,198 INFO L207 CegarAbsIntRunner]: [0], [18], [39] [2018-12-18 22:13:20,239 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-18 22:13:20,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 22:13:20,377 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-18 22:13:20,379 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 94 root evaluator evaluations with a maximum evaluation depth of 2. Performed 94 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-18 22:13:20,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:13:20,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-18 22:13:20,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:13:20,386 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:20,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:13:20,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:13:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:13:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:13:20,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:13:20,989 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-18 22:13:21,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2018-12-18 22:13:21,034 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:21,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,060 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:21,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,118 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:21,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,195 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:21,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,289 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:21,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,445 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,451 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:21,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:21,681 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:21,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2018-12-18 22:13:21,809 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-18 22:13:21,950 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:22,060 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:22,215 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:22,286 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:22,324 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:22,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:22,440 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:22,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:22,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:22,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 114 [2018-12-18 22:13:22,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:22,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:22,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 104 [2018-12-18 22:13:23,024 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-12-18 22:13:23,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,055 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,059 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 103 [2018-12-18 22:13:23,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 105 [2018-12-18 22:13:23,480 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-12-18 22:13:23,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,538 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,545 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:23,789 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2018-12-18 22:13:23,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,837 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:23,840 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:24,044 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2018-12-18 22:13:24,138 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:24,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:24,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:24,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:24,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:24,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:24,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:24,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:24,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:24,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:24,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:24,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:24,187 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:24,195 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-18 22:13:24,267 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:24,340 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:24,414 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:24,487 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:24,562 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:24,636 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:24,793 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:24,794 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2018-12-18 22:13:27,575 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:13:27,576 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 ((.cse1 (store |v_#valid_11| ULTIMATE.start_main_p1 1))) (let ((.cse3 (store .cse1 ULTIMATE.start_main_p2 1))) (let ((.cse2 (store .cse3 ULTIMATE.start_main_p3 1))) (let ((.cse0 (store .cse2 ULTIMATE.start_main_p4 1))) (let ((.cse4 (store .cse0 ULTIMATE.start_main_p5 1))) (let ((.cse5 (store .cse4 ULTIMATE.start_main_p6 1))) (and (= (select .cse0 ULTIMATE.start_main_p5) 0) (= 0 (select .cse1 ULTIMATE.start_main_p2)) (= (select .cse2 ULTIMATE.start_main_p4) 0) (= (select .cse3 ULTIMATE.start_main_p3) 0) (= 0 (select .cse4 ULTIMATE.start_main_p6)) (= (store (store (store (store (store (store (store (store (store |v_#memory_int_47| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) ULTIMATE.start_main_p4 0) ULTIMATE.start_main_p5 0) ULTIMATE.start_main_p6 0) ULTIMATE.start_main_p7 0) ULTIMATE.start_main_p8 0) ULTIMATE.start_main_p9 0) |#memory_int|) (= (select (store .cse5 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8) 0) (= (select .cse5 ULTIMATE.start_main_p7) 0)))))))) [2018-12-18 22:13:27,576 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p9, ULTIMATE.start_main_p6]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2018-12-18 22:13:30,993 WARN L181 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2018-12-18 22:13:31,589 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:31,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2018-12-18 22:13:31,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 22:13:31,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-12-18 22:13:31,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2018-12-18 22:13:34,212 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:13:34,212 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_48|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_48| ULTIMATE.start_main_p4))) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= (store |v_#memory_int_48| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p6)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 .cse0) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) [2018-12-18 22:13:34,213 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6, ULTIMATE.start_main_p8, ULTIMATE.start_main_p4]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) (- 1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2018-12-18 22:13:36,815 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {173#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2018-12-18 22:13:37,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {173#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {177#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0)) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))))} is VALID [2018-12-18 22:13:37,579 INFO L273 TraceCheckUtils]: 2: Hoare triple {177#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0)) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))))} assume !(#memory_int[main_p1] <= 0); {167#false} is VALID [2018-12-18 22:13:37,580 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:37,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:13:37,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {169#(or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (<= (+ (select |#memory_int| ULTIMATE.start_main_p1) 1) 0))} assume !(#memory_int[main_p1] <= 0); {167#false} is VALID [2018-12-18 22:13:37,628 INFO L273 TraceCheckUtils]: 1: Hoare triple {184#(or (= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 1) 0))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {169#(or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (<= (+ (select |#memory_int| ULTIMATE.start_main_p1) 1) 0))} is VALID [2018-12-18 22:13:37,630 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {184#(or (= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 1) 0))} is VALID [2018-12-18 22:13:37,631 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:37,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-18 22:13:37,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-18 22:13:37,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:13:37,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:13:37,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:13:37,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-18 22:13:37,660 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:37,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-18 22:13:37,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-18 22:13:37,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-18 22:13:37,661 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 4 states. [2018-12-18 22:13:37,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:13:37,829 INFO L93 Difference]: Finished difference Result 22 states and 48 transitions. [2018-12-18 22:13:37,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:13:37,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:13:37,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:13:37,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:13:37,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-12-18 22:13:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:13:37,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-12-18 22:13:37,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-12-18 22:13:37,891 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:37,894 INFO L225 Difference]: With dead ends: 22 [2018-12-18 22:13:37,894 INFO L226 Difference]: Without dead ends: 21 [2018-12-18 22:13:37,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-18 22:13:37,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-18 22:13:37,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-18 22:13:37,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:13:37,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2018-12-18 22:13:37,906 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2018-12-18 22:13:37,906 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2018-12-18 22:13:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:13:37,909 INFO L93 Difference]: Finished difference Result 21 states and 47 transitions. [2018-12-18 22:13:37,910 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 47 transitions. [2018-12-18 22:13:37,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:13:37,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:13:37,911 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2018-12-18 22:13:37,911 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2018-12-18 22:13:37,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:13:37,914 INFO L93 Difference]: Finished difference Result 21 states and 47 transitions. [2018-12-18 22:13:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 47 transitions. [2018-12-18 22:13:37,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:13:37,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:13:37,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:13:37,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:13:37,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-18 22:13:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-18 22:13:37,917 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 3 [2018-12-18 22:13:37,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:13:37,918 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-18 22:13:37,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-18 22:13:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-18 22:13:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:13:37,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:13:37,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:13:37,919 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:13:37,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:13:37,920 INFO L82 PathProgramCache]: Analyzing trace with hash 30946, now seen corresponding path program 1 times [2018-12-18 22:13:37,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:13:37,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:13:37,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:13:37,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:13:37,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:13:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:13:38,113 INFO L273 TraceCheckUtils]: 0: Hoare triple {276#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {278#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p9 (+ (select |#memory_int| ULTIMATE.start_main_p9) 1)) ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p9) 0))} is VALID [2018-12-18 22:13:38,115 INFO L273 TraceCheckUtils]: 1: Hoare triple {278#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p9 (+ (select |#memory_int| ULTIMATE.start_main_p9) 1)) ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p9) 0))} #memory_int := #memory_int[main_p9 := #memory_int[main_p9] + 1]; {279#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:13:38,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {277#false} is VALID [2018-12-18 22:13:38,116 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:38,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:13:38,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:13:38,116 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-18 22:13:38,117 INFO L207 CegarAbsIntRunner]: [0], [36], [39] [2018-12-18 22:13:38,120 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-18 22:13:38,120 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 22:13:38,145 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-18 22:13:38,145 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 94 root evaluator evaluations with a maximum evaluation depth of 2. Performed 94 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-18 22:13:38,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:13:38,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-18 22:13:38,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:13:38,146 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:38,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:13:38,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:13:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:13:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:13:38,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:13:38,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 140 [2018-12-18 22:13:38,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 127 [2018-12-18 22:13:38,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 123 [2018-12-18 22:13:38,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:38,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 122 [2018-12-18 22:13:39,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 130 [2018-12-18 22:13:39,287 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-18 22:13:39,316 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,318 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,322 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,324 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 145 [2018-12-18 22:13:39,514 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-12-18 22:13:39,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,559 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,560 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,561 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,565 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:39,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 167 [2018-12-18 22:13:39,967 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2018-12-18 22:13:40,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:40,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:40,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:40,012 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:40,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:40,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:40,015 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:40,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:40,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:40,019 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:40,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:40,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:40,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:40,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:40,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 145 [2018-12-18 22:13:40,033 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-18 22:13:40,122 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:40,211 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:40,303 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:40,447 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:40,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:40,637 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:40,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:40,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 8 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:40,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, 15 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:40,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 21 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:41,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 26 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:41,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 30 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:41,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 33 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:41,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 35 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:41,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 36 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:41,324 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:41,340 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-18 22:13:41,449 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:41,515 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:41,567 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:41,610 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:41,646 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:41,673 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:41,696 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:41,719 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:13:41,945 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:41,945 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:179, output treesize:190 [2018-12-18 22:13:44,168 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:13:44,169 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 ((.cse4 (store |v_#valid_12| ULTIMATE.start_main_p1 1))) (let ((.cse0 (store .cse4 ULTIMATE.start_main_p2 1))) (let ((.cse6 (store .cse0 ULTIMATE.start_main_p3 1))) (let ((.cse3 (store .cse6 ULTIMATE.start_main_p4 1))) (let ((.cse1 (store .cse3 ULTIMATE.start_main_p5 1))) (let ((.cse2 (store .cse1 ULTIMATE.start_main_p6 1))) (let ((.cse5 (store .cse2 ULTIMATE.start_main_p7 1))) (and (= (store (store (store (store (store (store (store (store (store |v_#memory_int_50| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) ULTIMATE.start_main_p4 0) ULTIMATE.start_main_p5 0) ULTIMATE.start_main_p6 0) ULTIMATE.start_main_p7 0) ULTIMATE.start_main_p8 0) ULTIMATE.start_main_p9 0) |#memory_int|) (= 0 (select .cse0 ULTIMATE.start_main_p3)) (= (select .cse1 ULTIMATE.start_main_p6) 0) (= (select .cse2 ULTIMATE.start_main_p7) 0) (= 0 (select .cse3 ULTIMATE.start_main_p5)) (= 0 (select .cse4 ULTIMATE.start_main_p2)) (= 0 (select .cse5 ULTIMATE.start_main_p8)) (= 0 (select .cse6 ULTIMATE.start_main_p4)) (= 0 (select (store .cse5 ULTIMATE.start_main_p8 1) ULTIMATE.start_main_p9)))))))))) [2018-12-18 22:13:44,169 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2018-12-18 22:13:47,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:13:47,437 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:47,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 22:13:47,679 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:47,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:200, output treesize:158 [2018-12-18 22:13:50,069 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:13:50,070 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_51|, ULTIMATE.start_main_p9, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_51| ULTIMATE.start_main_p9))) (and (= (select |v_#memory_int_51| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p9)) (= .cse0 0) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p7) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p5) 0) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p8) 0) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p2) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p6) 0) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)) (= (store |v_#memory_int_51| ULTIMATE.start_main_p9 (+ .cse0 1)) |#memory_int|))) [2018-12-18 22:13:50,070 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6, ULTIMATE.start_main_p9]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= 1 (select |#memory_int| ULTIMATE.start_main_p9)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2018-12-18 22:13:55,604 INFO L273 TraceCheckUtils]: 0: Hoare triple {276#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {283#(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 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p9 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p9)))} is UNKNOWN [2018-12-18 22:13:56,565 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:56,766 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-18 22:13:56,768 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.singletracecheck.TraceCheckUtils.checkInductivityAtPosition(TraceCheckUtils.java:272) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 36 more [2018-12-18 22:13:56,773 INFO L168 Benchmark]: Toolchain (without parser) took 40207.30 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 824.7 MB). Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: -88.2 MB). Peak memory consumption was 736.5 MB. Max. memory is 7.1 GB. [2018-12-18 22:13:56,775 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 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:56,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.55 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:56,776 INFO L168 Benchmark]: Boogie Preprocessor took 45.30 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:56,776 INFO L168 Benchmark]: RCFGBuilder took 1284.16 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:56,777 INFO L168 Benchmark]: TraceAbstraction took 38777.76 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 824.7 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -130.5 MB). Peak memory consumption was 694.2 MB. Max. memory is 7.1 GB. [2018-12-18 22:13:56,780 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.17 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 91.55 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 45.30 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 1284.16 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 38777.76 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 824.7 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -130.5 MB). Peak memory consumption was 694.2 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...