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-7-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:18:01,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:18:01,915 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:18:01,927 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:18:01,928 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:18:01,929 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:18:01,930 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:18:01,932 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:18:01,934 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:18:01,935 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:18:01,936 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:18:01,936 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:18:01,937 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:18:01,938 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:18:01,940 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:18:01,940 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:18:01,941 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:18:01,943 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:18:01,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:18:01,948 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:18:01,949 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:18:01,950 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:18:01,953 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:18:01,953 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:18:01,954 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:18:01,955 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:18:01,956 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:18:01,957 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:18:01,958 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:18:01,959 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:18:01,959 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:18:01,960 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:18:01,961 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:18:01,961 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:18:01,962 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:18:01,963 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:18:01,963 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:18:01,977 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:18:01,977 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:18:01,978 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:18:01,978 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:18:01,978 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:18:01,979 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:18:01,979 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:18:01,979 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:18:01,979 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 13:18:01,980 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:18:01,980 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 13:18:01,980 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 13:18:01,980 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:18:01,981 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:18:01,981 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:18:01,982 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:18:01,982 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:18:01,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:18:01,982 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:18:01,982 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:18:01,983 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:18:01,983 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:18:01,983 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:18:01,983 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:18:01,983 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:18:01,983 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:18:01,984 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:18:01,984 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:18:01,984 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:18:01,984 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:18:01,984 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:18:01,985 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:18:01,985 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:18:01,985 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:18:01,985 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:18:01,985 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:18:01,986 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:18:01,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:18:01,986 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:18:01,986 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:18:02,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:18:02,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:18:02,031 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:18:02,032 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:18:02,033 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:18:02,034 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl [2019-02-28 13:18:02,034 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl' [2019-02-28 13:18:02,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:18:02,078 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:18:02,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:18:02,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:18:02,080 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:18:02,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:18:02" (1/1) ... [2019-02-28 13:18:02,115 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:18:02" (1/1) ... [2019-02-28 13:18:02,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:18:02,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:18:02,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:18:02,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:18:02,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:18:02" (1/1) ... [2019-02-28 13:18:02,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:18:02" (1/1) ... [2019-02-28 13:18:02,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:18:02" (1/1) ... [2019-02-28 13:18:02,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:18:02" (1/1) ... [2019-02-28 13:18:02,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:18:02" (1/1) ... [2019-02-28 13:18:02,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:18:02" (1/1) ... [2019-02-28 13:18:02,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:18:02" (1/1) ... [2019-02-28 13:18:02,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:18:02,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:18:02,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:18:02,178 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:18:02,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:18: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:18:02,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:18:02,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:18:03,154 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:18:03,155 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-02-28 13:18:03,156 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:18:03 BoogieIcfgContainer [2019-02-28 13:18:03,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:18:03,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:18:03,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:18:03,161 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:18:03,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:18:02" (1/2) ... [2019-02-28 13:18:03,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a55b3e and model type speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:18:03, skipping insertion in model container [2019-02-28 13:18:03,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:18:03" (2/2) ... [2019-02-28 13:18:03,165 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-limited.bpl [2019-02-28 13:18:03,175 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:18:03,183 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-02-28 13:18:03,201 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-02-28 13:18:03,240 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:18:03,240 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:18:03,241 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:18:03,241 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:18:03,241 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:18:03,241 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:18:03,241 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:18:03,241 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:18:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-02-28 13:18:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 13:18:03,275 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:18:03,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 13:18:03,280 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:18:03,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:18:03,286 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-02-28 13:18:03,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:18:03,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:03,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:18:03,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:03,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:18:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:03,595 INFO L273 TraceCheckUtils]: 0: Hoare triple {20#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;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;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;#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]; {22#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:18:03,614 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {21#false} is VALID [2019-02-28 13:18:03,617 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:18:03,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:18:03,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:18:03,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:18:03,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:18:03,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:18:03,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:18:03,676 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:18:03,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:18:03,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:18:03,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:18:03,685 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-02-28 13:18:04,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:04,181 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-02-28 13:18:04,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:18:04,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:18:04,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:18:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:18:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2019-02-28 13:18:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:18:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2019-02-28 13:18:04,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2019-02-28 13:18:04,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:18:04,426 INFO L225 Difference]: With dead ends: 33 [2019-02-28 13:18:04,426 INFO L226 Difference]: Without dead ends: 28 [2019-02-28 13:18:04,430 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:18:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-28 13:18:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-02-28 13:18:04,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:18:04,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 16 states. [2019-02-28 13:18:04,516 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 16 states. [2019-02-28 13:18:04,516 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 16 states. [2019-02-28 13:18:04,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:04,525 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-28 13:18:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-02-28 13:18:04,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:18:04,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:18:04,526 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 28 states. [2019-02-28 13:18:04,528 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 28 states. [2019-02-28 13:18:04,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:04,532 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-28 13:18:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-02-28 13:18:04,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:18:04,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:18:04,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:18:04,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:18:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 13:18:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-02-28 13:18:04,537 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-02-28 13:18:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:18:04,538 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-02-28 13:18:04,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:18:04,539 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-02-28 13:18:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:18:04,539 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:18:04,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:18:04,540 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:18:04,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:18:04,540 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-02-28 13:18:04,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:18:04,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:04,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:18:04,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:04,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:18:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:04,621 INFO L273 TraceCheckUtils]: 0: Hoare triple {134#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;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;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;#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]; {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-28 13:18:04,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-28 13:18:04,626 INFO L273 TraceCheckUtils]: 2: Hoare triple {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {135#false} is VALID [2019-02-28 13:18:04,626 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:18:04,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:18:04,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:18:04,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:18:04,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:18:04,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:18:04,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:18:04,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:18:04,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:18:04,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:18:04,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:18:04,677 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-02-28 13:18:05,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:05,272 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-28 13:18:05,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:18:05,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:18:05,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:18:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:18:05,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2019-02-28 13:18:05,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:18:05,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2019-02-28 13:18:05,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2019-02-28 13:18:05,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:18:05,407 INFO L225 Difference]: With dead ends: 28 [2019-02-28 13:18:05,407 INFO L226 Difference]: Without dead ends: 27 [2019-02-28 13:18:05,408 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:18:05,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-28 13:18:05,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-02-28 13:18:05,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:18:05,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 17 states. [2019-02-28 13:18:05,416 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 17 states. [2019-02-28 13:18:05,417 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 17 states. [2019-02-28 13:18:05,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:05,419 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2019-02-28 13:18:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2019-02-28 13:18:05,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:18:05,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:18:05,420 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 27 states. [2019-02-28 13:18:05,421 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 27 states. [2019-02-28 13:18:05,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:05,423 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2019-02-28 13:18:05,423 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2019-02-28 13:18:05,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:18:05,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:18:05,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:18:05,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:18:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 13:18:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-02-28 13:18:05,426 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-02-28 13:18:05,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:18:05,427 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-02-28 13:18:05,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:18:05,427 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-02-28 13:18:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:18:05,427 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:18:05,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:18:05,428 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:18:05,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:18:05,429 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-02-28 13:18:05,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:18:05,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:05,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:18:05,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:05,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:18:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:05,824 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-28 13:18:05,880 INFO L273 TraceCheckUtils]: 0: Hoare triple {242#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;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;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;#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]; {244#(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:18:05,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {244#(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]; {245#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:18:05,883 INFO L273 TraceCheckUtils]: 2: Hoare triple {245#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {243#false} is VALID [2019-02-28 13:18:05,883 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:18:05,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:18:05,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:18:05,884 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:18:05,887 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-02-28 13:18:05,926 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:18:05,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:18:06,017 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:18:06,018 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 86 root evaluator evaluations with a maximum evaluation depth of 3. Performed 86 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:18:06,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:18:06,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:18:06,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:18:06,025 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:18:06,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:18:06,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:18:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:06,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 13:18:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:06,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:18:06,337 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,340 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,342 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,345 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,347 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,375 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,414 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,421 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-02-28 13:18:06,424 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:06,431 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:06,433 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:06,629 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 24 treesize of output 27 [2019-02-28 13:18:06,652 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,654 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 27 treesize of output 29 [2019-02-28 13:18:06,768 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,770 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,772 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,775 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 29 treesize of output 31 [2019-02-28 13:18:06,804 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,807 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,809 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,810 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,811 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,812 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,816 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 31 treesize of output 33 [2019-02-28 13:18:06,854 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,856 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,857 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,858 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,860 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,867 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,868 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,869 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,870 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,871 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,875 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 33 treesize of output 35 [2019-02-28 13:18:06,921 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,922 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,923 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,924 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,925 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,929 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,931 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,933 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,943 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,944 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,947 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 35 treesize of output 37 [2019-02-28 13:18:06,980 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,981 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,983 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,984 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,984 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,986 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,987 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,992 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,993 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,994 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,995 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,996 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:06,998 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,000 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,002 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,004 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,005 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,006 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,008 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,009 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,011 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,014 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-02-28 13:18:07,028 INFO L315 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:07,066 INFO L315 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:07,087 INFO L315 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:07,104 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:07,122 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:07,201 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:07,251 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:07,295 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 13:18:07,295 INFO L209 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:71, output treesize:54 [2019-02-28 13:18:07,656 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:18:07,657 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_37|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, |v_#valid_9|]. (let ((.cse0 (store |v_#valid_9| ULTIMATE.start_main_p1 1))) (and (= (select .cse0 ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select (store (store (store (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3 1) ULTIMATE.start_main_p4 1) ULTIMATE.start_main_p5 1) ULTIMATE.start_main_p6) 0) (= |#memory_int| (store (store (store (store (store (store (store |v_#memory_int_37| 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_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) [2019-02-28 13:18:07,657 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< 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:18:07,899 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,901 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,902 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,904 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,905 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,907 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,908 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,909 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,912 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,914 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,918 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,920 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,927 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,929 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,931 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,933 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,945 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:07,948 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2019-02-28 13:18:07,956 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:08,002 INFO L315 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-28 13:18:08,003 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:56