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-f57a05f [2019-01-07 18:31:28,166 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 18:31:28,168 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 18:31:28,180 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 18:31:28,181 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 18:31:28,182 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 18:31:28,183 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 18:31:28,185 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 18:31:28,187 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 18:31:28,188 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 18:31:28,189 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 18:31:28,190 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 18:31:28,191 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 18:31:28,192 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 18:31:28,193 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 18:31:28,194 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 18:31:28,195 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 18:31:28,197 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 18:31:28,200 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 18:31:28,202 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 18:31:28,203 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 18:31:28,205 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 18:31:28,208 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 18:31:28,208 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 18:31:28,209 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 18:31:28,210 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 18:31:28,211 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 18:31:28,212 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 18:31:28,213 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 18:31:28,215 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 18:31:28,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 18:31:28,216 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 18:31:28,216 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 18:31:28,217 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 18:31:28,218 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 18:31:28,219 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 18:31:28,219 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-01-07 18:31:28,234 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 18:31:28,234 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 18:31:28,235 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 18:31:28,236 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 18:31:28,236 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 18:31:28,236 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 18:31:28,237 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 18:31:28,237 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 18:31:28,237 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 18:31:28,237 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 18:31:28,238 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 18:31:28,238 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 18:31:28,238 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 18:31:28,239 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 18:31:28,239 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 18:31:28,240 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 18:31:28,240 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 18:31:28,240 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 18:31:28,241 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 18:31:28,241 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 18:31:28,241 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 18:31:28,241 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 18:31:28,242 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 18:31:28,242 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 18:31:28,242 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 18:31:28,242 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 18:31:28,242 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 18:31:28,243 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 18:31:28,243 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 18:31:28,243 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 18:31:28,244 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 18:31:28,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 18:31:28,244 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 18:31:28,244 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 18:31:28,245 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 18:31:28,245 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 18:31:28,245 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 18:31:28,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 18:31:28,246 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 18:31:28,246 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 18:31:28,280 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 18:31:28,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 18:31:28,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 18:31:28,311 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 18:31:28,311 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 18:31:28,312 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-01-07 18:31:28,312 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl' [2019-01-07 18:31:28,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 18:31:28,361 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 18:31:28,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 18:31:28,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 18:31:28,362 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 18:31:28,381 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 07.01 06:31:28" (1/1) ... [2019-01-07 18:31:28,394 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 07.01 06:31:28" (1/1) ... [2019-01-07 18:31:28,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 18:31:28,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 18:31:28,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 18:31:28,430 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 18:31:28,443 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 07.01 06:31:28" (1/1) ... [2019-01-07 18:31:28,443 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 07.01 06:31:28" (1/1) ... [2019-01-07 18:31:28,445 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 07.01 06:31:28" (1/1) ... [2019-01-07 18:31:28,446 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 07.01 06:31:28" (1/1) ... [2019-01-07 18:31:28,450 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 07.01 06:31:28" (1/1) ... [2019-01-07 18:31:28,455 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 07.01 06:31:28" (1/1) ... [2019-01-07 18:31:28,457 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 07.01 06:31:28" (1/1) ... [2019-01-07 18:31:28,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 18:31:28,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 18:31:28,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 18:31:28,463 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 18:31:28,465 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 07.01 06:31:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 18:31:28,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 18:31:28,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 18:31:29,601 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 18:31:29,602 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-07 18:31:29,603 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 06:31:29 BoogieIcfgContainer [2019-01-07 18:31:29,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 18:31:29,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 18:31:29,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 18:31:29,608 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 18:31:29,609 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 07.01 06:31:28" (1/2) ... [2019-01-07 18:31:29,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165aae8b and model type speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 06:31:29, skipping insertion in model container [2019-01-07 18:31:29,610 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 07.01 06:31:29" (2/2) ... [2019-01-07 18:31:29,612 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-limited.bpl [2019-01-07 18:31:29,623 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 18:31:29,633 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-01-07 18:31:29,653 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-01-07 18:31:29,691 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 18:31:29,691 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 18:31:29,692 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 18:31:29,692 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 18:31:29,692 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 18:31:29,692 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 18:31:29,693 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 18:31:29,693 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 18:31:29,711 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-01-07 18:31:29,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 18:31:29,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:31:29,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 18:31:29,722 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:31:29,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:31:29,728 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-01-07 18:31:29,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:31:29,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:31:29,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:31:29,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:31:29,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:31:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:31:29,988 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-01-07 18:31:30,005 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-01-07 18:31:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:31:30,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 18:31:30,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 18:31:30,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 18:31:30,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 18:31:30,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:31:30,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 18:31:30,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:31:30,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 18:31:30,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 18:31:30,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 18:31:30,071 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-01-07 18:31:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:31:30,492 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-01-07 18:31:30,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 18:31:30,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 18:31:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:31:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 18:31:30,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2019-01-07 18:31:30,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 18:31:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2019-01-07 18:31:30,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2019-01-07 18:31:30,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:31:30,703 INFO L225 Difference]: With dead ends: 33 [2019-01-07 18:31:30,703 INFO L226 Difference]: Without dead ends: 28 [2019-01-07 18:31:30,707 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-01-07 18:31:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-07 18:31:30,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-01-07 18:31:30,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:31:30,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 16 states. [2019-01-07 18:31:30,784 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 16 states. [2019-01-07 18:31:30,785 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 16 states. [2019-01-07 18:31:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:31:30,795 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-01-07 18:31:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-01-07 18:31:30,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:31:30,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:31:30,797 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 28 states. [2019-01-07 18:31:30,798 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 28 states. [2019-01-07 18:31:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:31:30,810 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-01-07 18:31:30,810 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-01-07 18:31:30,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:31:30,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:31:30,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:31:30,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:31:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 18:31:30,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-01-07 18:31:30,820 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-01-07 18:31:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:31:30,821 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-01-07 18:31:30,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 18:31:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-01-07 18:31:30,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 18:31:30,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:31:30,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 18:31:30,823 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:31:30,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:31:30,824 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-01-07 18:31:30,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:31:30,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:31:30,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:31:30,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:31:30,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:31:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:31:30,921 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-01-07 18:31:30,926 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-01-07 18:31:30,931 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-01-07 18:31:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:31:30,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 18:31:30,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 18:31:30,932 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 18:31:30,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 18:31:30,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:31:30,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 18:31:30,969 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:31:30,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 18:31:30,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 18:31:30,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 18:31:30,970 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-01-07 18:31:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:31:31,480 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-01-07 18:31:31,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 18:31:31,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 18:31:31,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:31:31,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 18:31:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2019-01-07 18:31:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 18:31:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2019-01-07 18:31:31,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2019-01-07 18:31:31,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:31:31,556 INFO L225 Difference]: With dead ends: 28 [2019-01-07 18:31:31,557 INFO L226 Difference]: Without dead ends: 27 [2019-01-07 18:31:31,558 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-01-07 18:31:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-07 18:31:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-01-07 18:31:31,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:31:31,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 17 states. [2019-01-07 18:31:31,566 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 17 states. [2019-01-07 18:31:31,567 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 17 states. [2019-01-07 18:31:31,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:31:31,569 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2019-01-07 18:31:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2019-01-07 18:31:31,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:31:31,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:31:31,571 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 27 states. [2019-01-07 18:31:31,571 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 27 states. [2019-01-07 18:31:31,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:31:31,575 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2019-01-07 18:31:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2019-01-07 18:31:31,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:31:31,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:31:31,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:31:31,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:31:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-07 18:31:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-01-07 18:31:31,579 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-01-07 18:31:31,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:31:31,580 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-01-07 18:31:31,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 18:31:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-01-07 18:31:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 18:31:31,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:31:31,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 18:31:31,582 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:31:31,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:31:31,582 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-01-07 18:31:31,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:31:31,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:31:31,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:31:31,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:31:31,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:31:31,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:31:31,799 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-01-07 18:31:31,801 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-01-07 18:31:31,802 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-01-07 18:31:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:31:31,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:31:31,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:31:31,805 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 18:31:31,807 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-01-07 18:31:31,843 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 18:31:31,843 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 18:31:31,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 18:31:31,954 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-01-07 18:31:31,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:31:31,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 18:31:31,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:31:31,959 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-01-07 18:31:31,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:31:31,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:31:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:31:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:31:31,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:31:32,435 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-07 18:31:32,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:32,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:32,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-01-07 18:31:32,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-01-07 18:31:32,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:32,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:32,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 18:31:32,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:32,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:32,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:32,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-01-07 18:31:32,760 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-07 18:31:32,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:32,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:32,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:32,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:32,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:32,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 18:31:32,842 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 18:31:32,846 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:31:32,859 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:31:32,862 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:31:32,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:31:32,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-07 18:31:32,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:32,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-07 18:31:33,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-07 18:31:33,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-07 18:31:33,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-07 18:31:33,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-07 18:31:33,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:33,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-07 18:31:33,222 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 18:31:33,288 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:31:33,350 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:31:33,437 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:31:33,461 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:31:33,479 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:31:33,495 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:31:33,536 INFO L267 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-01-07 18:31:33,537 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:71, output treesize:54 [2019-01-07 18:31:33,886 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:31:33,886 WARN L385 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-01-07 18:31:33,887 WARN L386 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-01-07 18:31:34,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:31:34,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-07 18:31:34,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:31:34,336 INFO L267 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-01-07 18:31:34,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-07 18:31:36,376 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:31:36,376 WARN L385 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_38|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_38| ULTIMATE.start_main_p4))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_38| ULTIMATE.start_main_p2) 0) (= 0 (select |v_#memory_int_38| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (store |v_#memory_int_38| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (= (select |v_#memory_int_38| ULTIMATE.start_main_p6) 0) (= 0 (select |v_#memory_int_38| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 .cse0) (= 0 (select |v_#memory_int_38| ULTIMATE.start_main_p3)) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |v_#memory_int_38| ULTIMATE.start_main_p1)))) [2019-01-07 18:31:36,377 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, 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) (= (select |#memory_int| ULTIMATE.start_main_p4) (- 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-01-07 18:31:37,701 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]; {249#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} is VALID [2019-01-07 18:31:37,981 INFO L273 TraceCheckUtils]: 1: Hoare triple {249#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {253#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 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_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} is VALID [2019-01-07 18:31:37,986 INFO L273 TraceCheckUtils]: 2: Hoare triple {253#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 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_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} assume !(#memory_int[main_p1] >= 0); {243#false} is VALID [2019-01-07 18:31:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:31:37,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:31:38,015 INFO L273 TraceCheckUtils]: 2: Hoare triple {257#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {243#false} is VALID [2019-01-07 18:31:38,016 INFO L273 TraceCheckUtils]: 1: Hoare triple {261#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {257#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-07 18:31:38,020 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]; {261#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-01-07 18:31:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:31:38,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:31:38,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 18:31:38,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:31:38,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 18:31:38,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:31:38,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-07 18:31:38,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:31:38,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 18:31:38,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 18:31:38,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 18:31:38,341 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-01-07 18:31:42,274 WARN L181 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-01-07 18:32:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:32:19,974 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-01-07 18:32:19,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 18:32:19,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 18:32:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:32:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 18:32:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2019-01-07 18:32:19,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 18:32:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2019-01-07 18:32:19,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 79 transitions. [2019-01-07 18:32:39,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 74 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2019-01-07 18:32:40,001 INFO L225 Difference]: With dead ends: 54 [2019-01-07 18:32:40,001 INFO L226 Difference]: Without dead ends: 52 [2019-01-07 18:32:40,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 18:32:40,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-07 18:32:40,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-01-07 18:32:40,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:32:40,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 20 states. [2019-01-07 18:32:40,026 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 20 states. [2019-01-07 18:32:40,026 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 20 states. [2019-01-07 18:32:40,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:32:40,031 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2019-01-07 18:32:40,031 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-01-07 18:32:40,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:32:40,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:32:40,032 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 52 states. [2019-01-07 18:32:40,032 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 52 states. [2019-01-07 18:32:40,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:32:40,036 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2019-01-07 18:32:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-01-07 18:32:40,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:32:40,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:32:40,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:32:40,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:32:40,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-07 18:32:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-01-07 18:32:40,040 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-01-07 18:32:40,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:32:40,040 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-01-07 18:32:40,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 18:32:40,040 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-01-07 18:32:40,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 18:32:40,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:32:40,044 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 18:32:40,045 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:32:40,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:32:40,046 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-01-07 18:32:40,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:32:40,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:32:40,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:32:40,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:32:40,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:32:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:32:40,453 INFO L273 TraceCheckUtils]: 0: Hoare triple {451#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]; {453#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-07 18:32:40,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {453#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {454#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-07 18:32:40,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {454#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {452#false} is VALID [2019-01-07 18:32:40,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:32:40,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:32:40,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:32:40,463 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 18:32:40,463 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-01-07 18:32:40,464 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 18:32:40,464 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 18:32:40,509 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 18:32:40,509 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-01-07 18:32:40,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:32:40,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 18:32:40,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:32:40,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:32:40,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:32:40,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:32:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:32:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:32:40,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:32:40,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-07 18:32:40,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:40,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-07 18:32:40,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:40,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:40,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-07 18:32:40,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:40,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:40,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:40,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-07 18:32:40,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:40,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:40,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:40,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:40,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-07 18:32:41,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-07 18:32:41,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-07 18:32:41,108 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 18:32:41,274 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:41,318 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:41,353 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:41,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:41,410 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:41,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:41,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-01-07 18:32:41,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-01-07 18:32:41,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 18:32:41,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-01-07 18:32:41,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:41,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 18:32:41,645 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 18:32:41,648 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:41,652 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:41,655 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:41,658 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:41,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-07 18:32:41,726 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:71, output treesize:54 [2019-01-07 18:32:43,751 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:32:43,751 WARN L385 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_40|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, |v_#valid_10|]. (let ((.cse0 (store |v_#valid_10| ULTIMATE.start_main_p1 1))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (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) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (store (store (store (store (store (store (store |v_#memory_int_40| 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) |#memory_int|) (= (select .cse0 ULTIMATE.start_main_p2) 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-01-07 18:32:43,752 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, 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) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-01-07 18:32:45,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:45,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:45,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:45,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:45,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:45,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:45,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:45,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:45,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:45,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:45,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:46,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:46,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:46,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:46,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:46,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:46,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:46,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:46,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:46,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:46,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:46,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:46,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-01-07 18:32:46,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:32:46,147 INFO L267 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-01-07 18:32:46,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-07 18:32:48,172 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:32:48,172 WARN L385 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_41|, ULTIMATE.start_main_p7, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_41| ULTIMATE.start_main_p1))) (and (= (select |v_#memory_int_41| ULTIMATE.start_main_p7) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |v_#memory_int_41| ULTIMATE.start_main_p2)) (= (select |v_#memory_int_41| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (store |v_#memory_int_41| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |v_#memory_int_41| ULTIMATE.start_main_p5) 0) (= .cse0 0) (= (select |v_#memory_int_41| ULTIMATE.start_main_p6) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |v_#memory_int_41| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2019-01-07 18:32:48,172 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, 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) (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-01-07 18:32:51,685 INFO L273 TraceCheckUtils]: 0: Hoare triple {451#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]; {458#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 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_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} is VALID [2019-01-07 18:32:53,079 INFO L273 TraceCheckUtils]: 1: Hoare triple {458#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 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_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {462#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 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_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} is VALID [2019-01-07 18:32:53,080 INFO L273 TraceCheckUtils]: 2: Hoare triple {462#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 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_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} assume !(#memory_int[main_p1] >= 0); {452#false} is VALID [2019-01-07 18:32:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:32:53,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:32:53,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {466#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {452#false} is VALID [2019-01-07 18:32:53,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {470#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {466#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-07 18:32:53,150 INFO L273 TraceCheckUtils]: 0: Hoare triple {451#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]; {470#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} is VALID [2019-01-07 18:32:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:32:53,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 18:32:53,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-07 18:32:53,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 18:32:53,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 18:32:53,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:32:53,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 18:32:53,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:32:53,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 18:32:53,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 18:32:53,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 18:32:53,177 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-01-07 18:32:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:32:53,418 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-01-07 18:32:53,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 18:32:53,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-07 18:32:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:32:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 18:32:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2019-01-07 18:32:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 18:32:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2019-01-07 18:32:53,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 39 transitions. [2019-01-07 18:32:53,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:32:53,512 INFO L225 Difference]: With dead ends: 25 [2019-01-07 18:32:53,514 INFO L226 Difference]: Without dead ends: 24 [2019-01-07 18:32:53,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 18:32:53,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-07 18:32:53,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-07 18:32:53,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:32:53,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2019-01-07 18:32:53,554 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2019-01-07 18:32:53,555 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2019-01-07 18:32:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:32:53,557 INFO L93 Difference]: Finished difference Result 24 states and 66 transitions. [2019-01-07 18:32:53,557 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 66 transitions. [2019-01-07 18:32:53,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:32:53,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:32:53,558 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2019-01-07 18:32:53,558 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2019-01-07 18:32:53,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:32:53,560 INFO L93 Difference]: Finished difference Result 24 states and 66 transitions. [2019-01-07 18:32:53,560 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 66 transitions. [2019-01-07 18:32:53,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:32:53,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:32:53,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:32:53,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:32:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-07 18:32:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-07 18:32:53,563 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-01-07 18:32:53,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:32:53,563 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-07 18:32:53,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 18:32:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-07 18:32:53,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 18:32:53,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:32:53,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 18:32:53,565 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:32:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:32:53,565 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-01-07 18:32:53,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:32:53,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:32:53,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:32:53,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:32:53,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:32:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:32:53,651 INFO L273 TraceCheckUtils]: 0: Hoare triple {581#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]; {583#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2019-01-07 18:32:53,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {583#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {584#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-07 18:32:53,654 INFO L273 TraceCheckUtils]: 2: Hoare triple {584#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {582#false} is VALID [2019-01-07 18:32:53,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:32:53,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:32:53,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:32:53,655 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 18:32:53,656 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-01-07 18:32:53,659 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 18:32:53,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 18:32:53,687 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 18:32:53,687 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-01-07 18:32:53,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:32:53,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 18:32:53,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:32:53,688 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:32:53,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:32:53,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:32:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:32:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:32:53,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:32:53,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-07 18:32:53,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:53,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-07 18:32:53,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:53,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:53,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-07 18:32:54,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-07 18:32:54,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-07 18:32:54,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-07 18:32:54,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-07 18:32:54,258 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 18:32:54,472 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:54,513 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:54,574 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:54,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:54,617 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:54,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:54,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2019-01-07 18:32:54,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 48 [2019-01-07 18:32:54,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2019-01-07 18:32:54,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-07 18:32:54,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:54,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 18:32:54,941 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 18:32:54,943 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:54,944 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:54,946 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:54,949 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:32:54,986 INFO L267 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-01-07 18:32:54,987 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:82, output treesize:54 [2019-01-07 18:32:55,547 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:32:55,547 WARN L385 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_43|, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, |v_#valid_11|]. (let ((.cse0 (store |v_#valid_11| ULTIMATE.start_main_p1 1))) (let ((.cse1 (store .cse0 ULTIMATE.start_main_p2 1))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select .cse0 ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select .cse1 ULTIMATE.start_main_p3) 0) (= (store (store (store (store (store (store (store |v_#memory_int_43| 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) |#memory_int|) (= 0 (select (store (store (store .cse1 ULTIMATE.start_main_p3 1) ULTIMATE.start_main_p4 1) ULTIMATE.start_main_p5 1) ULTIMATE.start_main_p6)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)))) [2019-01-07 18:32:55,547 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, 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) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-01-07 18:32:55,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:32:55,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-01-07 18:32:55,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:32:56,085 INFO L267 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-01-07 18:32:56,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-07 18:32:58,167 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:32:58,167 WARN L385 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_44|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7]. (let ((.cse0 (select |v_#memory_int_44| ULTIMATE.start_main_p2))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= |#memory_int| (store |v_#memory_int_44| ULTIMATE.start_main_p2 (+ .cse0 (- 1)))) (= .cse0 0) (= (select |v_#memory_int_44| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |v_#memory_int_44| ULTIMATE.start_main_p6) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |v_#memory_int_44| ULTIMATE.start_main_p7) 0) (= (select |v_#memory_int_44| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |v_#memory_int_44| ULTIMATE.start_main_p5) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |v_#memory_int_44| ULTIMATE.start_main_p3)))) [2019-01-07 18:32:58,167 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, 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) (= (- 1) (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) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-01-07 18:33:01,611 INFO L273 TraceCheckUtils]: 0: Hoare triple {581#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]; {588#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2019-01-07 18:33:01,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {588#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {592#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-01-07 18:33:01,904 INFO L273 TraceCheckUtils]: 2: Hoare triple {592#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {582#false} is VALID [2019-01-07 18:33:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:33:01,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:33:01,951 INFO L273 TraceCheckUtils]: 2: Hoare triple {596#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {582#false} is VALID [2019-01-07 18:33:01,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {600#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {596#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-07 18:33:01,955 INFO L273 TraceCheckUtils]: 0: Hoare triple {581#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]; {600#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-01-07 18:33:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:33:01,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:33:01,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 18:33:01,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:33:01,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 18:33:01,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:33:01,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-07 18:33:02,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:33:02,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 18:33:02,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 18:33:02,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 18:33:02,448 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-01-07 18:33:06,295 WARN L181 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-01-07 18:33:42,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:33:42,783 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-01-07 18:33:42,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 18:33:42,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 18:33:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:33:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 18:33:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2019-01-07 18:33:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 18:33:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2019-01-07 18:33:42,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2019-01-07 18:34:05,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 73 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2019-01-07 18:34:05,874 INFO L225 Difference]: With dead ends: 57 [2019-01-07 18:34:05,874 INFO L226 Difference]: Without dead ends: 56 [2019-01-07 18:34:05,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 18:34:05,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-07 18:34:05,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-01-07 18:34:05,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:34:05,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 25 states. [2019-01-07 18:34:05,972 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 25 states. [2019-01-07 18:34:05,972 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 25 states. [2019-01-07 18:34:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:34:05,976 INFO L93 Difference]: Finished difference Result 56 states and 109 transitions. [2019-01-07 18:34:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 109 transitions. [2019-01-07 18:34:05,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:34:05,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:34:05,977 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 56 states. [2019-01-07 18:34:05,977 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 56 states. [2019-01-07 18:34:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:34:05,980 INFO L93 Difference]: Finished difference Result 56 states and 109 transitions. [2019-01-07 18:34:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 109 transitions. [2019-01-07 18:34:05,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:34:05,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:34:05,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:34:05,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:34:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-07 18:34:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-01-07 18:34:05,983 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-01-07 18:34:05,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:34:05,983 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-01-07 18:34:05,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 18:34:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-01-07 18:34:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 18:34:05,984 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:34:05,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 18:34:05,984 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:34:05,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:34:05,985 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-01-07 18:34:05,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:34:05,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:34:05,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:34:05,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:34:05,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:34:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:34:06,071 INFO L273 TraceCheckUtils]: 0: Hoare triple {815#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]; {817#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p6 (+ (select |#memory_int| ULTIMATE.start_main_p6) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)))} is VALID [2019-01-07 18:34:06,073 INFO L273 TraceCheckUtils]: 1: Hoare triple {817#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p6 (+ (select |#memory_int| ULTIMATE.start_main_p6) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)))} #memory_int := #memory_int[main_p6 := #memory_int[main_p6] - 1]; {818#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-07 18:34:06,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {818#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {816#false} is VALID [2019-01-07 18:34:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:34:06,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:34:06,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:34:06,074 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 18:34:06,074 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-01-07 18:34:06,076 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 18:34:06,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 18:34:06,100 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 18:34:06,100 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-01-07 18:34:06,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:34:06,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 18:34:06,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:34:06,101 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:34:06,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:34:06,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:34:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:34:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:34:06,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:34:06,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-07 18:34:06,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-07 18:34:06,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-07 18:34:06,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-07 18:34:06,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-07 18:34:06,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-07 18:34:06,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-07 18:34:06,507 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 18:34:06,569 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:34:06,605 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:34:06,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:34:06,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:34:06,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:34:06,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:34:06,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2019-01-07 18:34:06,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 48 [2019-01-07 18:34:06,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2019-01-07 18:34:06,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-07 18:34:06,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:06,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 18:34:06,946 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 18:34:06,949 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:34:06,951 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:34:06,954 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:34:06,956 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:34:06,991 INFO L267 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-01-07 18:34:06,991 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:82, output treesize:54 [2019-01-07 18:34:08,602 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:34:08,602 WARN L385 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_46|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p7, |v_#valid_12|]. (let ((.cse1 (store |v_#valid_12| ULTIMATE.start_main_p1 1))) (let ((.cse0 (store .cse1 ULTIMATE.start_main_p2 1))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select (store (store (store .cse0 ULTIMATE.start_main_p3 1) ULTIMATE.start_main_p4 1) ULTIMATE.start_main_p5 1) ULTIMATE.start_main_p6) 0) (= 0 (select .cse0 ULTIMATE.start_main_p3)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select .cse1 ULTIMATE.start_main_p2)) (< 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) (= (store (store (store (store (store (store (store |v_#memory_int_46| 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) |#memory_int|)))) [2019-01-07 18:34:08,602 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, 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) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-01-07 18:34:08,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:34:08,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-01-07 18:34:08,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:34:08,950 INFO L267 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-01-07 18:34:08,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:64, output treesize:54 [2019-01-07 18:34:10,974 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:34:10,974 WARN L385 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_47|, ULTIMATE.start_main_p6, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p7, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_47| ULTIMATE.start_main_p6))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_47| ULTIMATE.start_main_p5) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (store |v_#memory_int_47| ULTIMATE.start_main_p6 (+ .cse0 (- 1))) |#memory_int|) (= (select |v_#memory_int_47| ULTIMATE.start_main_p7) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |v_#memory_int_47| ULTIMATE.start_main_p1) 0) (= (select |v_#memory_int_47| ULTIMATE.start_main_p3) 0) (= (select |v_#memory_int_47| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= .cse0 0) (= (select |v_#memory_int_47| ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2019-01-07 18:34:10,975 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, 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)) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p6)) (< 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) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2019-01-07 18:34:14,265 INFO L273 TraceCheckUtils]: 0: Hoare triple {815#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]; {822#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 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_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (exists ((ULTIMATE.start_main_p7 Int)) (and (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)))))} is VALID [2019-01-07 18:34:14,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {822#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 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_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (exists ((ULTIMATE.start_main_p7 Int)) (and (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)))))} #memory_int := #memory_int[main_p6 := #memory_int[main_p6] - 1]; {826#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 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_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p6) 1)))))} is VALID [2019-01-07 18:34:14,587 INFO L273 TraceCheckUtils]: 2: Hoare triple {826#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 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_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p6) 1)))))} assume !(#memory_int[main_p1] >= 0); {816#false} is VALID [2019-01-07 18:34:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:34:14,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:34:14,609 INFO L273 TraceCheckUtils]: 2: Hoare triple {830#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {816#false} is VALID [2019-01-07 18:34:14,610 INFO L273 TraceCheckUtils]: 1: Hoare triple {834#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p6 (+ (select |#memory_int| ULTIMATE.start_main_p6) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p6 := #memory_int[main_p6] - 1]; {830#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-07 18:34:14,613 INFO L273 TraceCheckUtils]: 0: Hoare triple {815#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]; {834#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p6 (+ (select |#memory_int| ULTIMATE.start_main_p6) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-01-07 18:34:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:34:14,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:34:14,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-07 18:34:14,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:34:14,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 18:34:14,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:34:14,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-07 18:34:14,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:34:14,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 18:34:14,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 18:34:14,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-07 18:34:14,972 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-01-07 18:34:18,912 WARN L181 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-01-07 18:34:53,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:34:53,151 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-01-07 18:34:53,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 18:34:53,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-07 18:34:53,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:34:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 18:34:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2019-01-07 18:34:53,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 18:34:53,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2019-01-07 18:34:53,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2019-01-07 18:35:14,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 73 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2019-01-07 18:35:14,094 INFO L225 Difference]: With dead ends: 59 [2019-01-07 18:35:14,095 INFO L226 Difference]: Without dead ends: 57 [2019-01-07 18:35:14,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-07 18:35:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-07 18:35:14,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-01-07 18:35:14,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:35:14,170 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 29 states. [2019-01-07 18:35:14,170 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 29 states. [2019-01-07 18:35:14,170 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 29 states. [2019-01-07 18:35:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:35:14,174 INFO L93 Difference]: Finished difference Result 57 states and 124 transitions. [2019-01-07 18:35:14,174 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 124 transitions. [2019-01-07 18:35:14,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:35:14,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:35:14,175 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 57 states. [2019-01-07 18:35:14,175 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 57 states. [2019-01-07 18:35:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:35:14,178 INFO L93 Difference]: Finished difference Result 57 states and 124 transitions. [2019-01-07 18:35:14,178 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 124 transitions. [2019-01-07 18:35:14,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:35:14,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:35:14,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:35:14,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:35:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-07 18:35:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-01-07 18:35:14,181 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-01-07 18:35:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:35:14,182 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-01-07 18:35:14,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 18:35:14,182 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-01-07 18:35:14,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 18:35:14,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:35:14,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 18:35:14,183 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:35:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:35:14,183 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-01-07 18:35:14,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:35:14,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:35:14,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:35:14,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:35:14,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:35:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:35:14,283 INFO L273 TraceCheckUtils]: 0: Hoare triple {1061#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]; {1063#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} is VALID [2019-01-07 18:35:14,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {1063#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} assume #memory_int[main_p1] >= 0; {1063#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} is VALID [2019-01-07 18:35:14,285 INFO L273 TraceCheckUtils]: 2: Hoare triple {1063#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} assume #memory_int[main_p2] <= 0; {1063#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} is VALID [2019-01-07 18:35:14,286 INFO L273 TraceCheckUtils]: 3: Hoare triple {1063#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} assume !(#memory_int[main_p3] >= 0); {1062#false} is VALID [2019-01-07 18:35:14,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:35:14,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 18:35:14,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 18:35:14,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 18:35:14,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-07 18:35:14,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:35:14,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 18:35:14,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:35:14,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 18:35:14,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 18:35:14,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 18:35:14,293 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 3 states. [2019-01-07 18:35:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:35:14,434 INFO L93 Difference]: Finished difference Result 33 states and 102 transitions. [2019-01-07 18:35:14,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 18:35:14,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-07 18:35:14,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:35:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 18:35:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2019-01-07 18:35:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 18:35:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2019-01-07 18:35:14,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2019-01-07 18:35:14,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:35:14,475 INFO L225 Difference]: With dead ends: 33 [2019-01-07 18:35:14,475 INFO L226 Difference]: Without dead ends: 32 [2019-01-07 18:35:14,476 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-01-07 18:35:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-07 18:35:14,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-01-07 18:35:14,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:35:14,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 29 states. [2019-01-07 18:35:14,557 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 29 states. [2019-01-07 18:35:14,557 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 29 states. [2019-01-07 18:35:14,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:35:14,560 INFO L93 Difference]: Finished difference Result 32 states and 101 transitions. [2019-01-07 18:35:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 101 transitions. [2019-01-07 18:35:14,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:35:14,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:35:14,561 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 32 states. [2019-01-07 18:35:14,561 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 32 states. [2019-01-07 18:35:14,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:35:14,563 INFO L93 Difference]: Finished difference Result 32 states and 101 transitions. [2019-01-07 18:35:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 101 transitions. [2019-01-07 18:35:14,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:35:14,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:35:14,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:35:14,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:35:14,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-07 18:35:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 100 transitions. [2019-01-07 18:35:14,567 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 100 transitions. Word has length 4 [2019-01-07 18:35:14,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:35:14,567 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 100 transitions. [2019-01-07 18:35:14,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 18:35:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 100 transitions. [2019-01-07 18:35:14,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 18:35:14,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:35:14,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 18:35:14,568 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:35:14,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:35:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-01-07 18:35:14,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:35:14,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:35:14,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:35:14,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:35:14,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:35:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:35:14,642 INFO L273 TraceCheckUtils]: 0: Hoare triple {1212#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]; {1214#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)))} is VALID [2019-01-07 18:35:14,643 INFO L273 TraceCheckUtils]: 1: Hoare triple {1214#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {1215#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-07 18:35:14,644 INFO L273 TraceCheckUtils]: 2: Hoare triple {1215#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1215#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-07 18:35:14,645 INFO L273 TraceCheckUtils]: 3: Hoare triple {1215#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1213#false} is VALID [2019-01-07 18:35:14,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:35:14,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:35:14,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:35:14,646 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 18:35:14,647 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-01-07 18:35:14,650 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 18:35:14,650 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 18:35:14,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 18:35:14,717 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 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-01-07 18:35:14,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:35:14,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 18:35:14,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:35:14,718 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:35:14,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:35:14,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:35:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:35:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:35:14,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:35:14,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2019-01-07 18:35:14,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 23 treesize of output 25 [2019-01-07 18:35:14,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:14,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-07 18:35:14,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:14,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:14,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 41 [2019-01-07 18:35:14,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:14,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:14,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:14,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:14,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:14,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2019-01-07 18:35:14,888 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-07 18:35:14,901 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:14,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:14,911 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:14,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:14,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-07 18:35:14,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-01-07 18:35:14,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:14,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-01-07 18:35:14,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:14,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:14,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-07 18:35:15,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:15,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:15,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:15,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-07 18:35:15,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:15,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:15,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:15,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:15,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-07 18:35:15,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:15,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:15,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:15,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:15,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:15,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 100 [2019-01-07 18:35:15,159 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 18:35:15,260 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:15,290 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:15,313 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:15,333 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:15,351 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:15,369 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:15,410 INFO L267 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-01-07 18:35:15,411 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:60, output treesize:55 [2019-01-07 18:35:16,121 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:35:16,121 WARN L385 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_49|, ULTIMATE.start_main_p1, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, |v_#valid_13|]. (and (= 0 (select (store (store (store (store (store |v_#valid_13| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3 1) ULTIMATE.start_main_p4 1) ULTIMATE.start_main_p5 1) ULTIMATE.start_main_p6)) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (store (store (store (store (store (store (store |v_#memory_int_49| 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) |#memory_int|)) [2019-01-07 18:35:16,121 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p1, ULTIMATE.start_main_p6, ULTIMATE.start_main_p5, ULTIMATE.start_main_p7]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= 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) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-01-07 18:35:16,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:16,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 104 [2019-01-07 18:35:16,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-07 18:35:16,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 2 xjuncts. [2019-01-07 18:35:16,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:65, output treesize:104 [2019-01-07 18:35:19,310 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:35:19,310 WARN L385 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_50|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p1, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7]. (let ((.cse0 (select |v_#memory_int_50| ULTIMATE.start_main_p4))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |v_#memory_int_50| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= |#memory_int| (store |v_#memory_int_50| ULTIMATE.start_main_p4 (+ .cse0 (- 1)))) (= 0 (select |v_#memory_int_50| ULTIMATE.start_main_p1)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 .cse0) (= 0 (select |v_#memory_int_50| ULTIMATE.start_main_p3)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |v_#memory_int_50| ULTIMATE.start_main_p6) 0) (= 0 (select |v_#memory_int_50| ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_50| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5))) [2019-01-07 18:35:19,311 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_5, ULTIMATE.start_main_p4, v_prenex_4, v_prenex_2, v_prenex_1, v_prenex_3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (let ((.cse0 (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))) (or (and (< v_prenex_5 ULTIMATE.start_main_p4) (not (= v_prenex_4 v_prenex_2)) .cse0 (< v_prenex_1 v_prenex_2) (= (select |#memory_int| v_prenex_5) 0) (< ULTIMATE.start_main_p2 v_prenex_5) (= 0 (select |#memory_int| v_prenex_1)) (< v_prenex_2 v_prenex_3) (= (select |#memory_int| v_prenex_4) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) (- 1)) (= 0 (select |#memory_int| v_prenex_3)) (< ULTIMATE.start_main_p4 v_prenex_1) (= 0 (select |#memory_int| v_prenex_2))) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p5) (= (+ (select |#memory_int| ULTIMATE.start_main_p1) 1) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p1) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) .cse0 (< 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_p6))))) [2019-01-07 18:35:24,800 WARN L181 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-01-07 18:35:24,974 INFO L273 TraceCheckUtils]: 0: Hoare triple {1212#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]; {1219#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p1 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} is VALID [2019-01-07 18:35:25,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {1219#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p1 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {1223#(and (exists ((ULTIMATE.start_main_p4 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (and (not (= v_prenex_4 v_prenex_2)) (< v_prenex_2 v_prenex_3) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (< ULTIMATE.start_main_p4 v_prenex_1) (< v_prenex_1 v_prenex_2) (= (select |#memory_int| v_prenex_4) 0) (= 0 (select |#memory_int| v_prenex_2)) (< v_prenex_5 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| v_prenex_1)) (= 0 (select |#memory_int| v_prenex_3)) (< ULTIMATE.start_main_p2 v_prenex_5) (= (select |#memory_int| v_prenex_5) 0))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-01-07 18:35:25,064 INFO L273 TraceCheckUtils]: 2: Hoare triple {1223#(and (exists ((ULTIMATE.start_main_p4 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (and (not (= v_prenex_4 v_prenex_2)) (< v_prenex_2 v_prenex_3) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (< ULTIMATE.start_main_p4 v_prenex_1) (< v_prenex_1 v_prenex_2) (= (select |#memory_int| v_prenex_4) 0) (= 0 (select |#memory_int| v_prenex_2)) (< v_prenex_5 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| v_prenex_1)) (= 0 (select |#memory_int| v_prenex_3)) (< ULTIMATE.start_main_p2 v_prenex_5) (= (select |#memory_int| v_prenex_5) 0))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} assume #memory_int[main_p1] >= 0; {1223#(and (exists ((ULTIMATE.start_main_p4 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (and (not (= v_prenex_4 v_prenex_2)) (< v_prenex_2 v_prenex_3) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (< ULTIMATE.start_main_p4 v_prenex_1) (< v_prenex_1 v_prenex_2) (= (select |#memory_int| v_prenex_4) 0) (= 0 (select |#memory_int| v_prenex_2)) (< v_prenex_5 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| v_prenex_1)) (= 0 (select |#memory_int| v_prenex_3)) (< ULTIMATE.start_main_p2 v_prenex_5) (= (select |#memory_int| v_prenex_5) 0))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-01-07 18:35:25,068 INFO L273 TraceCheckUtils]: 3: Hoare triple {1223#(and (exists ((ULTIMATE.start_main_p4 Int) (v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 Int)) (and (not (= v_prenex_4 v_prenex_2)) (< v_prenex_2 v_prenex_3) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (< ULTIMATE.start_main_p4 v_prenex_1) (< v_prenex_1 v_prenex_2) (= (select |#memory_int| v_prenex_4) 0) (= 0 (select |#memory_int| v_prenex_2)) (< v_prenex_5 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| v_prenex_1)) (= 0 (select |#memory_int| v_prenex_3)) (< ULTIMATE.start_main_p2 v_prenex_5) (= (select |#memory_int| v_prenex_5) 0))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} assume !(#memory_int[main_p2] <= 0); {1213#false} is VALID [2019-01-07 18:35:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:35:25,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:35:25,137 INFO L273 TraceCheckUtils]: 3: Hoare triple {1230#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1213#false} is VALID [2019-01-07 18:35:25,138 INFO L273 TraceCheckUtils]: 2: Hoare triple {1230#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1230#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-07 18:35:25,139 INFO L273 TraceCheckUtils]: 1: Hoare triple {1237#(<= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {1230#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-07 18:35:25,141 INFO L273 TraceCheckUtils]: 0: Hoare triple {1212#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]; {1237#(<= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p2) 0)} is VALID [2019-01-07 18:35:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:35:25,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-07 18:35:25,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-07 18:35:25,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 18:35:25,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 18:35:25,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:35:25,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 18:35:25,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:35:25,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 18:35:25,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 18:35:25,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-07 18:35:25,167 INFO L87 Difference]: Start difference. First operand 29 states and 100 transitions. Second operand 4 states. [2019-01-07 18:35:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:35:28,021 INFO L93 Difference]: Finished difference Result 33 states and 111 transitions. [2019-01-07 18:35:28,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 18:35:28,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 18:35:28,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:35:28,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 18:35:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2019-01-07 18:35:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 18:35:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2019-01-07 18:35:28,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2019-01-07 18:35:28,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:35:28,054 INFO L225 Difference]: With dead ends: 33 [2019-01-07 18:35:28,054 INFO L226 Difference]: Without dead ends: 32 [2019-01-07 18:35:28,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-07 18:35:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-07 18:35:28,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-01-07 18:35:28,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:35:28,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2019-01-07 18:35:28,119 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2019-01-07 18:35:28,119 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2019-01-07 18:35:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:35:28,121 INFO L93 Difference]: Finished difference Result 32 states and 110 transitions. [2019-01-07 18:35:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 110 transitions. [2019-01-07 18:35:28,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:35:28,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:35:28,122 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2019-01-07 18:35:28,122 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2019-01-07 18:35:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:35:28,124 INFO L93 Difference]: Finished difference Result 32 states and 110 transitions. [2019-01-07 18:35:28,124 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 110 transitions. [2019-01-07 18:35:28,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:35:28,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:35:28,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:35:28,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:35:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-07 18:35:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 110 transitions. [2019-01-07 18:35:28,127 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 110 transitions. Word has length 4 [2019-01-07 18:35:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:35:28,127 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 110 transitions. [2019-01-07 18:35:28,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 18:35:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 110 transitions. [2019-01-07 18:35:28,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 18:35:28,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:35:28,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 18:35:28,128 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:35:28,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:35:28,129 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-01-07 18:35:28,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:35:28,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:35:28,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:35:28,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:35:28,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:35:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:35:28,266 INFO L273 TraceCheckUtils]: 0: Hoare triple {1390#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]; {1392#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (= 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-01-07 18:35:28,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {1392#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (= 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]; {1393#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p5 (+ (select |#memory_int| ULTIMATE.start_main_p5) 1)) ULTIMATE.start_main_p1)))} is VALID [2019-01-07 18:35:28,276 INFO L273 TraceCheckUtils]: 2: Hoare triple {1393#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p5 (+ (select |#memory_int| ULTIMATE.start_main_p5) 1)) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p5 := #memory_int[main_p5] + 1]; {1394#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-07 18:35:28,277 INFO L273 TraceCheckUtils]: 3: Hoare triple {1394#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {1391#false} is VALID [2019-01-07 18:35:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:35:28,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:35:28,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:35:28,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 18:35:28,278 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-01-07 18:35:28,278 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 18:35:28,279 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 18:35:28,293 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 18:35:28,293 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 3. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-07 18:35:28,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:35:28,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 18:35:28,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:35:28,293 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:35:28,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:35:28,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:35:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:35:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:35:28,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:35:28,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-07 18:35:28,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-07 18:35:28,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-07 18:35:28,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-07 18:35:28,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-07 18:35:28,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-07 18:35:28,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-07 18:35:28,558 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-07 18:35:28,620 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:28,657 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:28,686 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:28,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:28,755 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:28,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:28,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 38 [2019-01-07 18:35:28,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2019-01-07 18:35:28,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-07 18:35:28,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2019-01-07 18:35:28,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:28,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-07 18:35:28,942 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-07 18:35:28,944 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:28,946 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:28,948 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:28,951 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:35:28,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-07 18:35:28,986 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:71, output treesize:54 [2019-01-07 18:35:29,035 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:35:29,035 WARN L385 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_52|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, |v_#valid_14|]. (let ((.cse0 (store |v_#valid_14| ULTIMATE.start_main_p1 1))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (store (store (store (store (store (store (store |v_#memory_int_52| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) ULTIMATE.start_main_p4 0) ULTIMATE.start_main_p5 0) ULTIMATE.start_main_p6 0) ULTIMATE.start_main_p7 0) |#memory_int|) (= (select .cse0 ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (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)) (< 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-01-07 18:35:29,035 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, 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-01-07 18:35:29,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:29,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-07 18:35:29,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:35:29,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-07 18:35:29,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:54 [2019-01-07 18:35:31,346 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:35:31,347 WARN L385 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_53|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p3, ULTIMATE.start_main_p7, ULTIMATE.start_main_p6, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_53| ULTIMATE.start_main_p4))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_53| ULTIMATE.start_main_p7) 0) (= .cse0 0) (= (select |v_#memory_int_53| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |v_#memory_int_53| ULTIMATE.start_main_p5) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (store |v_#memory_int_53| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (= (select |v_#memory_int_53| ULTIMATE.start_main_p6) 0) (= (select |v_#memory_int_53| ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select |v_#memory_int_53| ULTIMATE.start_main_p1) 0))) [2019-01-07 18:35:31,347 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, 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) (= (select |#memory_int| ULTIMATE.start_main_p4) (- 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-01-07 18:35:31,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-07 18:35:31,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 134 [2019-01-07 18:35:31,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:35:31,614 INFO L267 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-01-07 18:35:31,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:66, output treesize:56 [2019-01-07 18:35:33,742 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:35:33,742 WARN L385 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_54|, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p6, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7]. (let ((.cse0 (select |v_#memory_int_54| ULTIMATE.start_main_p5))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= .cse0 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (store |v_#memory_int_54| ULTIMATE.start_main_p5 (+ .cse0 1)) |#memory_int|) (= 0 (select |v_#memory_int_54| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |v_#memory_int_54| ULTIMATE.start_main_p1) 0) (= 0 (select |v_#memory_int_54| ULTIMATE.start_main_p6)) (= (select |v_#memory_int_54| ULTIMATE.start_main_p7) 0) (= 0 (+ (select |v_#memory_int_54| ULTIMATE.start_main_p4) 1)) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |v_#memory_int_54| ULTIMATE.start_main_p3)))) [2019-01-07 18:35:33,742 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, 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) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 1 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-01-07 18:35:38,285 INFO L273 TraceCheckUtils]: 0: Hoare triple {1390#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]; {1398#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int)) (and (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} is VALID [2019-01-07 18:35:38,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {1398#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int)) (and (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {1402#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int)) (and (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} is VALID [2019-01-07 18:35:38,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {1402#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int)) (and (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} #memory_int := #memory_int[main_p5 := #memory_int[main_p5] + 1]; {1406#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 1 (select |#memory_int| ULTIMATE.start_main_p5)) (= 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_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} is VALID [2019-01-07 18:35:38,620 INFO L273 TraceCheckUtils]: 3: Hoare triple {1406#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 1 (select |#memory_int| ULTIMATE.start_main_p5)) (= 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_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} assume !(#memory_int[main_p1] >= 0); {1391#false} is VALID [2019-01-07 18:35:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:35:38,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:35:38,663 INFO L273 TraceCheckUtils]: 3: Hoare triple {1410#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {1391#false} is VALID [2019-01-07 18:35:38,664 INFO L273 TraceCheckUtils]: 2: Hoare triple {1414#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p5 (+ (select |#memory_int| ULTIMATE.start_main_p5) 1)) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p5 := #memory_int[main_p5] + 1]; {1410#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-07 18:35:38,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {1418#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p5 (+ (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p5) 1)) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {1414#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p5 (+ (select |#memory_int| ULTIMATE.start_main_p5) 1)) ULTIMATE.start_main_p1))} is VALID [2019-01-07 18:35:38,669 INFO L273 TraceCheckUtils]: 0: Hoare triple {1390#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]; {1418#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p5 (+ (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p5) 1)) ULTIMATE.start_main_p1))} is VALID [2019-01-07 18:35:38,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:35:38,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:35:38,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 18:35:38,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:35:38,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-07 18:35:38,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:35:38,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-07 18:35:39,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:35:39,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 18:35:39,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 18:35:39,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-07 18:35:39,038 INFO L87 Difference]: Start difference. First operand 31 states and 110 transitions. Second operand 8 states. [2019-01-07 18:35:40,235 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-07 18:35:40,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 18:35:40,236 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.CommuhashNormalForm.transform(CommuhashNormalForm.java:87) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PredicateFactoryRefinement.intersection(PredicateFactoryRefinement.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PredicateFactoryForInterpolantAutomata.intersection(PredicateFactoryForInterpolantAutomata.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.IntersectNwa.createProductState(IntersectNwa.java:69) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.getOrConstructState(ProductNwa.java:123) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:223) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 34 more [2019-01-07 18:35:40,241 INFO L168 Benchmark]: Toolchain (without parser) took 251881.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.9 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -412.8 MB). Peak memory consumption was 394.1 MB. Max. memory is 7.1 GB. [2019-01-07 18:35:40,241 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 18:35:40,242 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 18:35:40,242 INFO L168 Benchmark]: Boogie Preprocessor took 32.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 18:35:40,242 INFO L168 Benchmark]: RCFGBuilder took 1140.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2019-01-07 18:35:40,243 INFO L168 Benchmark]: TraceAbstraction took 250635.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.9 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -444.5 MB). Peak memory consumption was 362.4 MB. Max. memory is 7.1 GB. [2019-01-07 18:35:40,245 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.84 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1140.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 250635.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 806.9 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -444.5 MB). Peak memory consumption was 362.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...