java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:20:02,757 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:20:02,759 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:20:02,770 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:20:02,771 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:20:02,772 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:20:02,773 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:20:02,775 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:20:02,777 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:20:02,777 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:20:02,778 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:20:02,779 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:20:02,779 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:20:02,780 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:20:02,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:20:02,782 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:20:02,783 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:20:02,785 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:20:02,787 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:20:02,788 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:20:02,789 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:20:02,791 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:20:02,793 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:20:02,793 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:20:02,793 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:20:02,794 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:20:02,795 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:20:02,796 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:20:02,797 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:20:02,798 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:20:02,798 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:20:02,799 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:20:02,799 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:20:02,799 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:20:02,800 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:20:02,801 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:20:02,801 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:20:02,819 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:20:02,819 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:20:02,820 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:20:02,820 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:20:02,820 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:20:02,821 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:20:02,821 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:20:02,821 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:20:02,821 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 13:20:02,821 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:20:02,822 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 13:20:02,822 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 13:20:02,823 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:20:02,823 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:20:02,823 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:20:02,824 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:20:02,824 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:20:02,824 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:20:02,824 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:20:02,824 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:20:02,825 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:20:02,826 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:20:02,826 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:20:02,827 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:20:02,827 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:20:02,827 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:20:02,827 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:20:02,827 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:20:02,828 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:20:02,828 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:20:02,828 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:20:02,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:20:02,828 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:20:02,829 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:20:02,829 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:20:02,829 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:20:02,829 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:20:02,829 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:20:02,830 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:20:02,831 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:20:02,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:20:02,898 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:20:02,901 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:20:02,903 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:20:02,903 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:20:02,904 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-limited.bpl [2019-02-28 13:20:02,904 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-limited.bpl' [2019-02-28 13:20:02,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:20:02,956 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:20:02,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:20:02,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:20:02,958 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:20:02,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:20:02" (1/1) ... [2019-02-28 13:20:02,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:20:02" (1/1) ... [2019-02-28 13:20:03,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:20:03,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:20:03,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:20:03,019 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:20:03,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:20:02" (1/1) ... [2019-02-28 13:20:03,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:20:02" (1/1) ... [2019-02-28 13:20:03,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:20:02" (1/1) ... [2019-02-28 13:20:03,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:20:02" (1/1) ... [2019-02-28 13:20:03,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:20:02" (1/1) ... [2019-02-28 13:20:03,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:20:02" (1/1) ... [2019-02-28 13:20:03,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:20:02" (1/1) ... [2019-02-28 13:20:03,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:20:03,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:20:03,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:20:03,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:20:03,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:20:02" (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:20:03,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:20:03,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:20:04,268 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:20:04,269 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-02-28 13:20:04,270 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:20:04 BoogieIcfgContainer [2019-02-28 13:20:04,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:20:04,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:20:04,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:20:04,275 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:20:04,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:20:02" (1/2) ... [2019-02-28 13:20:04,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12965873 and model type speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:20:04, skipping insertion in model container [2019-02-28 13:20:04,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:20:04" (2/2) ... [2019-02-28 13:20:04,278 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-9-limited.bpl [2019-02-28 13:20:04,288 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:20:04,298 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-02-28 13:20:04,314 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-02-28 13:20:04,356 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:20:04,356 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:20:04,356 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:20:04,357 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:20:04,357 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:20:04,357 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:20:04,357 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:20:04,357 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:20:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-02-28 13:20:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 13:20:04,379 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:20:04,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 13:20:04,382 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:20:04,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:20:04,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1000, now seen corresponding path program 1 times [2019-02-28 13:20:04,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:20:04,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:20:04,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:20:04,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:20:04,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:20:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:20:04,641 INFO L273 TraceCheckUtils]: 0: Hoare triple {24#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {26#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:20:04,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {25#false} is VALID [2019-02-28 13:20:04,659 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:20:04,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:20:04,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:20:04,663 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:20:04,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:20:04,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:20:04,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:20:04,705 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:20:04,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:20:04,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:20:04,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:20:04,718 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-02-28 13:20:05,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:20:05,105 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2019-02-28 13:20:05,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:20:05,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:20:05,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:20:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:20:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2019-02-28 13:20:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:20:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2019-02-28 13:20:05,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2019-02-28 13:20:05,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:20:05,502 INFO L225 Difference]: With dead ends: 41 [2019-02-28 13:20:05,503 INFO L226 Difference]: Without dead ends: 36 [2019-02-28 13:20:05,506 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:20:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-28 13:20:05,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2019-02-28 13:20:05,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:20:05,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 20 states. [2019-02-28 13:20:05,577 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 20 states. [2019-02-28 13:20:05,577 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 20 states. [2019-02-28 13:20:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:20:05,582 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2019-02-28 13:20:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-02-28 13:20:05,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:20:05,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:20:05,584 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 36 states. [2019-02-28 13:20:05,584 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 36 states. [2019-02-28 13:20:05,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:20:05,589 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2019-02-28 13:20:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-02-28 13:20:05,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:20:05,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:20:05,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:20:05,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:20:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-28 13:20:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2019-02-28 13:20:05,594 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 2 [2019-02-28 13:20:05,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:20:05,594 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2019-02-28 13:20:05,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:20:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2019-02-28 13:20:05,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:20:05,595 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:20:05,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:20:05,596 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:20:05,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:20:05,597 INFO L82 PathProgramCache]: Analyzing trace with hash 30388, now seen corresponding path program 1 times [2019-02-28 13:20:05,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:20:05,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:20:05,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:20:05,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:20:05,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:20:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:20:05,781 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0]; {168#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2019-02-28 13:20:05,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {169#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:20:05,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {169#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {167#false} is VALID [2019-02-28 13:20:05,783 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:20:05,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:20:05,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:20:05,785 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:20:05,787 INFO L207 CegarAbsIntRunner]: [0], [18], [39] [2019-02-28 13:20:05,820 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:20:05,821 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:20:05,914 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:20:05,916 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 110 root evaluator evaluations with a maximum evaluation depth of 3. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 13:20:05,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:20:05,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:20:05,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:20:05,921 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:20:05,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:20:05,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:20:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:20:05,956 WARN L254 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-28 13:20:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:20:05,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:20:06,323 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 30 treesize of output 33 [2019-02-28 13:20:06,353 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,355 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 33 treesize of output 35 [2019-02-28 13:20:06,432 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,435 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,436 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,439 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 35 treesize of output 37 [2019-02-28 13:20:06,460 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,463 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,465 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,467 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,469 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,480 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,482 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 37 treesize of output 39 [2019-02-28 13:20:06,563 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,565 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,569 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,573 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,574 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,583 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,586 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,588 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,589 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,591 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,594 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 39 treesize of output 41 [2019-02-28 13:20:06,658 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,660 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,662 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,665 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,666 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,667 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,669 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,671 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,672 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,678 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,679 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,680 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,682 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,684 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,686 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,691 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 41 treesize of output 43 [2019-02-28 13:20:06,744 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,746 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,748 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,751 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,753 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,755 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,757 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,759 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,761 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,763 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,765 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,767 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,773 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,774 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,775 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,777 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,783 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,785 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,786 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,787 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,790 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 43 treesize of output 45 [2019-02-28 13:20:06,830 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,834 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,835 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,836 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,837 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,839 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,842 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,844 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,845 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,847 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,849 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,851 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,854 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,856 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,858 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,860 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,862 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,879 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,887 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,906 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,908 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,913 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,915 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,916 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,918 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,922 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2019-02-28 13:20:06,955 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,957 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,958 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,960 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,961 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,963 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,965 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,986 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,994 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,995 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:06,996 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,009 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,010 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,012 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,019 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,021 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,049 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,050 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,051 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,055 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,080 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,086 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,091 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,092 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,093 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,096 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,100 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,104 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,105 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,106 INFO L289 Elim1Store]: Index analysis took 153 ms [2019-02-28 13:20:07,110 INFO L442 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 46 [2019-02-28 13:20:07,113 INFO L315 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-28 13:20:07,142 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:20:07,173 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:20:07,235 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:20:07,270 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:20:07,303 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:20:07,332 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:20:07,363 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:20:07,395 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:20:07,519 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,520 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,522 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,524 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,525 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,541 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,546 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,547 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,548 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,562 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,580 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,581 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,583 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,595 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,597 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,599 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,619 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,620 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,622 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,626 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,628 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,630 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,632 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,660 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,662 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,664 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,665 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,667 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,669 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,670 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,672 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,673 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,674 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:07,677 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-02-28 13:20:07,679 INFO L315 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-28 13:20:07,683 INFO L315 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:20:07,685 INFO L315 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:20:07,686 INFO L315 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:20:07,689 INFO L315 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:20:07,693 INFO L315 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:20:07,777 INFO L315 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-28 13:20:07,778 INFO L209 ElimStorePlain]: Needed 16 recursive calls to eliminate 9 variables, input treesize:149, output treesize:70 [2019-02-28 13:20:30,287 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:20:30,288 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_47|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p9, |v_#valid_11|]. (let ((.cse0 (store |v_#valid_11| ULTIMATE.start_main_p1 1))) (let ((.cse2 (store (store (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3 1) ULTIMATE.start_main_p4 1))) (let ((.cse3 (store .cse2 ULTIMATE.start_main_p5 1))) (let ((.cse1 (store .cse3 ULTIMATE.start_main_p6 1))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select .cse0 ULTIMATE.start_main_p2)) (= (select (store .cse1 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select .cse2 ULTIMATE.start_main_p5) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select .cse3 ULTIMATE.start_main_p6)) (= (store (store (store (store (store (store (store (store (store |v_#memory_int_47| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) ULTIMATE.start_main_p4 0) ULTIMATE.start_main_p5 0) ULTIMATE.start_main_p6 0) ULTIMATE.start_main_p7 0) ULTIMATE.start_main_p8 0) ULTIMATE.start_main_p9 0) |#memory_int|) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (= (select .cse1 ULTIMATE.start_main_p7) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)))))) [2019-02-28 13:20:30,288 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p9, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-28 13:20:32,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:32,982 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:32,983 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:32,985 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:32,986 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:32,987 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:32,989 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:32,990 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:32,991 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:32,993 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:32,994 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:32,995 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:32,997 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:32,998 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:32,999 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,003 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,004 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,005 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,006 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,007 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,008 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,009 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,010 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,011 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,013 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,014 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,015 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,017 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,018 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,019 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,021 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,022 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,023 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,025 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,026 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,027 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:20:33,030 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2019-02-28 13:20:33,042 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:20:33,114 INFO L315 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. [2019-02-28 13:20:33,114 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:80, output treesize:72