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-8-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:19:51,404 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:19:51,407 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:19:51,420 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:19:51,420 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:19:51,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:19:51,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:19:51,425 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:19:51,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:19:51,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:19:51,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:19:51,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:19:51,430 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:19:51,431 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:19:51,432 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:19:51,433 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:19:51,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:19:51,435 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:19:51,438 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:19:51,439 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:19:51,440 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:19:51,441 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:19:51,444 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:19:51,444 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:19:51,444 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:19:51,445 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:19:51,446 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:19:51,447 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:19:51,448 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:19:51,449 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:19:51,450 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:19:51,450 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:19:51,450 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:19:51,451 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:19:51,452 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:19:51,458 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:19:51,459 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-28 13:19:51,481 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:19:51,481 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:19:51,482 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:19:51,483 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:19:51,483 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:19:51,483 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:19:51,483 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:19:51,483 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:19:51,484 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 13:19:51,484 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:19:51,484 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 13:19:51,484 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 13:19:51,484 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:19:51,485 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:19:51,486 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:19:51,486 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:19:51,487 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:19:51,488 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:19:51,489 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:19:51,489 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:19:51,489 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:19:51,489 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:19:51,489 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:19:51,490 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:19:51,490 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:19:51,491 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:19:51,491 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:19:51,491 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:19:51,491 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:19:51,491 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:19:51,492 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:19:51,492 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:19:51,492 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:19:51,492 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:19:51,492 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:19:51,493 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:19:51,493 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:19:51,493 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:19:51,494 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:19:51,494 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:19:51,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:19:51,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:19:51,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:19:51,554 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:19:51,555 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:19:51,556 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-unlimited.bpl [2019-02-28 13:19:51,556 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-unlimited.bpl' [2019-02-28 13:19:51,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:19:51,618 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:19:51,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:19:51,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:19:51,620 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:19:51,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:19:51" (1/1) ... [2019-02-28 13:19:51,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:19:51" (1/1) ... [2019-02-28 13:19:51,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:19:51,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:19:51,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:19:51,698 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:19:51,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:19:51" (1/1) ... [2019-02-28 13:19:51,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:19:51" (1/1) ... [2019-02-28 13:19:51,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:19:51" (1/1) ... [2019-02-28 13:19:51,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:19:51" (1/1) ... [2019-02-28 13:19:51,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:19:51" (1/1) ... [2019-02-28 13:19:51,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:19:51" (1/1) ... [2019-02-28 13:19:51,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:19:51" (1/1) ... [2019-02-28 13:19:51,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:19:51,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:19:51,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:19:51,747 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:19:51,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:19:51" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:19:51,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:19:51,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:19:52,905 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:19:52,906 INFO L286 CfgBuilder]: Removed 19 assue(true) statements. [2019-02-28 13:19:52,907 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:19:52 BoogieIcfgContainer [2019-02-28 13:19:52,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:19:52,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:19:52,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:19:52,912 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:19:52,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:19:51" (1/2) ... [2019-02-28 13:19:52,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48698428 and model type speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:19:52, skipping insertion in model container [2019-02-28 13:19:52,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:19:52" (2/2) ... [2019-02-28 13:19:52,916 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-8-unlimited.bpl [2019-02-28 13:19:52,926 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:19:52,935 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-02-28 13:19:52,952 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-02-28 13:19:52,986 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:19:52,987 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:19:52,987 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:19:52,987 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:19:52,987 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:19:52,987 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:19:52,988 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:19:52,988 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:19:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-02-28 13:19:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 13:19:53,011 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:19:53,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 13:19:53,015 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:19:53,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:19:53,021 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-02-28 13:19:53,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:19:53,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:19:53,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:19:53,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:19:53,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:19:53,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:19:53,301 INFO L273 TraceCheckUtils]: 0: Hoare triple {22#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8;malloc_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;#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]; {24#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:19:53,309 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {23#false} is VALID [2019-02-28 13:19:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:19:53,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:19:53,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:19:53,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:19:53,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:19:53,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:19:53,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:19:53,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:19:53,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:19:53,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:19:53,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:19:53,369 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-02-28 13:19:53,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:19:53,891 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-02-28 13:19:53,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:19:53,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:19:53,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:19:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:19:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2019-02-28 13:19:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:19:53,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2019-02-28 13:19:53,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2019-02-28 13:19:54,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:19:54,065 INFO L225 Difference]: With dead ends: 37 [2019-02-28 13:19:54,065 INFO L226 Difference]: Without dead ends: 32 [2019-02-28 13:19:54,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:19:54,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-28 13:19:54,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2019-02-28 13:19:54,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:19:54,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 18 states. [2019-02-28 13:19:54,143 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 18 states. [2019-02-28 13:19:54,143 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 18 states. [2019-02-28 13:19:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:19:54,148 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2019-02-28 13:19:54,148 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-02-28 13:19:54,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:19:54,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:19:54,149 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 32 states. [2019-02-28 13:19:54,150 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 32 states. [2019-02-28 13:19:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:19:54,154 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2019-02-28 13:19:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-02-28 13:19:54,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:19:54,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:19:54,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:19:54,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:19:54,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-28 13:19:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2019-02-28 13:19:54,161 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 2 [2019-02-28 13:19:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:19:54,161 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2019-02-28 13:19:54,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:19:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2019-02-28 13:19:54,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:19:54,163 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:19:54,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:19:54,164 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:19:54,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:19:54,164 INFO L82 PathProgramCache]: Analyzing trace with hash 30818, now seen corresponding path program 1 times [2019-02-28 13:19:54,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:19:54,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:19:54,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:19:54,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:19:54,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:19:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:19:54,567 INFO L273 TraceCheckUtils]: 0: Hoare triple {150#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8;malloc_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;#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]; {152#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)))} is VALID [2019-02-28 13:19:54,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {152#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {153#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:19:54,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {153#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {151#false} is VALID [2019-02-28 13:19:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:19:54,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:19:54,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:19:54,602 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:19:54,604 INFO L207 CegarAbsIntRunner]: [0], [32], [35] [2019-02-28 13:19:54,640 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:19:54,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:19:54,749 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:19:54,750 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 84 root evaluator evaluations with a maximum evaluation depth of 2. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 13:19:54,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:19:54,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:19:54,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:19:54,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:19:54,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:19:54,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:19:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:19:54,786 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-28 13:19:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:19:54,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:19:55,072 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-02-28 13:19:55,161 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,164 INFO L442 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 30 treesize of output 32 [2019-02-28 13:19:55,242 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,268 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,294 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,296 INFO L442 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 32 treesize of output 34 [2019-02-28 13:19:55,361 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,366 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,371 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,373 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,375 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,377 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,380 INFO L442 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 34 treesize of output 36 [2019-02-28 13:19:55,461 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,477 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,479 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,482 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,484 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,485 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,487 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,489 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,491 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,494 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,497 INFO L442 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 36 treesize of output 38 [2019-02-28 13:19:55,521 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,522 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,523 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,526 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,527 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,528 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,529 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,531 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,538 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,548 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,550 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,551 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,552 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,555 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,557 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,562 INFO L442 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 38 treesize of output 40 [2019-02-28 13:19:55,605 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,607 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,609 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,610 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,611 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,613 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,614 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,616 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,623 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,625 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,626 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,631 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,633 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,636 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,663 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,686 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,689 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,693 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,695 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,696 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,697 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,702 INFO L442 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 40 treesize of output 42 [2019-02-28 13:19:55,753 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,757 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,759 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,760 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,761 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,763 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,765 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,766 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,768 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,770 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,774 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,778 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,779 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,781 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,783 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,785 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,787 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,788 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,790 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,792 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,798 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,799 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,800 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,802 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,803 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,805 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,807 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:19:55,812 INFO L442 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2019-02-28 13:19:55,820 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 13:19:55,843 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:19:55,875 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:19:55,906 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:19:55,935 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:19:56,006 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:19:56,029 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:19:56,070 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:19:56,441 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 22 [2019-02-28 13:19:56,464 INFO L315 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-28 13:19:56,475 INFO L315 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:19:56,504 INFO L315 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:19:56,536 INFO L315 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:19:56,590 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:19:56,655 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:19:56,732 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:19:56,859 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:19:56,992 INFO L315 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-28 13:19:56,993 INFO L209 ElimStorePlain]: Needed 17 recursive calls to eliminate 8 variables, input treesize:147, output treesize:153 [2019-02-28 13:19:58,130 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:19:58,131 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_42|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, |v_#valid_10|]. (let ((.cse5 (store |v_#valid_10| ULTIMATE.start_main_p1 1))) (let ((.cse4 (store .cse5 ULTIMATE.start_main_p2 1))) (let ((.cse2 (store .cse4 ULTIMATE.start_main_p3 1))) (let ((.cse0 (store .cse2 ULTIMATE.start_main_p4 1))) (let ((.cse3 (store .cse0 ULTIMATE.start_main_p5 1))) (let ((.cse1 (store .cse3 ULTIMATE.start_main_p6 1))) (and (= (select .cse0 ULTIMATE.start_main_p5) 0) (= 0 (select .cse1 ULTIMATE.start_main_p7)) (= 0 (select .cse2 ULTIMATE.start_main_p4)) (= (select .cse3 ULTIMATE.start_main_p6) 0) (= (store (store (store (store (store (store (store (store |v_#memory_int_42| 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) |#memory_int|) (= 0 (select .cse4 ULTIMATE.start_main_p3)) (= (select .cse5 ULTIMATE.start_main_p2) 0) (= (select (store .cse1 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8) 0)))))))) [2019-02-28 13:19:58,131 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_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)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2019-02-28 13:19:59,790 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2019-02-28 13:19:59,793 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:19:59,929 INFO L315 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-28 13:19:59,930 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:127