java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 14:44:08,760 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 14:44:08,761 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 14:44:08,773 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 14:44:08,773 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 14:44:08,774 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 14:44:08,776 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 14:44:08,777 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 14:44:08,779 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 14:44:08,780 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 14:44:08,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 14:44:08,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 14:44:08,782 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 14:44:08,783 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 14:44:08,784 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 14:44:08,785 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 14:44:08,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 14:44:08,787 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 14:44:08,789 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 14:44:08,791 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 14:44:08,792 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 14:44:08,793 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 14:44:08,795 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 14:44:08,795 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 14:44:08,796 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 14:44:08,797 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 14:44:08,797 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 14:44:08,798 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 14:44:08,799 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 14:44:08,800 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 14:44:08,800 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 14:44:08,801 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 14:44:08,801 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 14:44:08,801 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 14:44:08,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 14:44:08,803 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 14:44:08,803 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-31 14:44:08,815 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 14:44:08,815 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 14:44:08,816 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 14:44:08,816 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 14:44:08,817 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 14:44:08,817 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 14:44:08,817 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 14:44:08,817 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 14:44:08,817 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 14:44:08,818 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 14:44:08,818 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 14:44:08,818 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 14:44:08,818 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 14:44:08,818 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 14:44:08,819 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 14:44:08,819 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 14:44:08,820 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 14:44:08,820 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 14:44:08,820 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 14:44:08,820 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 14:44:08,821 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 14:44:08,821 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 14:44:08,821 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 14:44:08,821 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 14:44:08,821 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 14:44:08,822 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 14:44:08,822 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 14:44:08,822 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 14:44:08,822 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 14:44:08,822 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 14:44:08,822 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 14:44:08,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:44:08,823 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 14:44:08,823 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 14:44:08,823 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 14:44:08,824 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 14:44:08,824 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 14:44:08,824 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 14:44:08,824 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 14:44:08,824 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 14:44:08,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 14:44:08,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 14:44:08,869 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 14:44:08,871 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 14:44:08,871 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 14:44:08,872 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl [2019-01-31 14:44:08,873 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl' [2019-01-31 14:44:08,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 14:44:08,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 14:44:08,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 14:44:08,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 14:44:08,940 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 14:44:08,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:08" (1/1) ... [2019-01-31 14:44:08,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:08" (1/1) ... [2019-01-31 14:44:09,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 14:44:09,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 14:44:09,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 14:44:09,014 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 14:44:09,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:08" (1/1) ... [2019-01-31 14:44:09,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:08" (1/1) ... [2019-01-31 14:44:09,031 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:08" (1/1) ... [2019-01-31 14:44:09,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:08" (1/1) ... [2019-01-31 14:44:09,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:08" (1/1) ... [2019-01-31 14:44:09,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:08" (1/1) ... [2019-01-31 14:44:09,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:08" (1/1) ... [2019-01-31 14:44:09,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 14:44:09,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 14:44:09,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 14:44:09,060 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 14:44:09,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:08" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 14:44:09,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 14:44:09,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 14:44:10,428 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 14:44:10,428 INFO L286 CfgBuilder]: Removed 19 assue(true) statements. [2019-01-31 14:44:10,430 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:44:10 BoogieIcfgContainer [2019-01-31 14:44:10,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 14:44:10,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 14:44:10,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 14:44:10,435 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 14:44:10,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 02:44:08" (1/2) ... [2019-01-31 14:44:10,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65bbac85 and model type speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 02:44:10, skipping insertion in model container [2019-01-31 14:44:10,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 02:44:10" (2/2) ... [2019-01-31 14:44:10,439 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-8-limited.bpl [2019-01-31 14:44:10,449 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 14:44:10,457 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-31 14:44:10,474 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-31 14:44:10,507 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 14:44:10,508 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 14:44:10,508 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 14:44:10,508 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 14:44:10,508 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 14:44:10,508 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 14:44:10,509 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 14:44:10,509 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 14:44:10,522 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-01-31 14:44:10,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 14:44:10,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:44:10,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 14:44:10,532 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:44:10,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:44:10,538 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-01-31 14:44:10,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:44:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:44:10,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:44:10,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:44:10,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:44:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:44:10,798 INFO L273 TraceCheckUtils]: 0: Hoare triple {22#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0]; {24#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-31 14:44:10,818 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {23#false} is VALID [2019-01-31 14:44:10,823 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-31 14:44:10,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 14:44:10,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 14:44:10,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 14:44:10,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 14:44:10,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:44:10,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-31 14:44:10,864 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-31 14:44:10,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 14:44:10,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 14:44:10,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 14:44:10,874 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2019-01-31 14:44:11,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:44:11,338 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-01-31 14:44:11,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 14:44:11,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 14:44:11,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:44:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:44:11,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2019-01-31 14:44:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-31 14:44:11,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2019-01-31 14:44:11,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2019-01-31 14:44:11,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-31 14:44:11,539 INFO L225 Difference]: With dead ends: 37 [2019-01-31 14:44:11,540 INFO L226 Difference]: Without dead ends: 32 [2019-01-31 14:44:11,543 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-31 14:44:11,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-31 14:44:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2019-01-31 14:44:11,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-31 14:44:11,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 18 states. [2019-01-31 14:44:11,579 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 18 states. [2019-01-31 14:44:11,579 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 18 states. [2019-01-31 14:44:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:44:11,584 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2019-01-31 14:44:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-01-31 14:44:11,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:44:11,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:44:11,585 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 32 states. [2019-01-31 14:44:11,585 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 32 states. [2019-01-31 14:44:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:44:11,589 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2019-01-31 14:44:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-01-31 14:44:11,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 14:44:11,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-31 14:44:11,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-31 14:44:11,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-31 14:44:11,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 14:44:11,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2019-01-31 14:44:11,596 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 2 [2019-01-31 14:44:11,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 14:44:11,596 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2019-01-31 14:44:11,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 14:44:11,597 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2019-01-31 14:44:11,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 14:44:11,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 14:44:11,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 14:44:11,598 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-31 14:44:11,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:44:11,598 INFO L82 PathProgramCache]: Analyzing trace with hash 30818, now seen corresponding path program 1 times [2019-01-31 14:44:11,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 14:44:11,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:44:11,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:44:11,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 14:44:11,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 14:44:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:44:11,883 INFO L273 TraceCheckUtils]: 0: Hoare triple {150#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0]; {152#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)))} is VALID [2019-01-31 14:44:11,884 INFO L273 TraceCheckUtils]: 1: Hoare triple {152#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {153#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-31 14:44:11,885 INFO L273 TraceCheckUtils]: 2: Hoare triple {153#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {151#false} is VALID [2019-01-31 14:44:11,886 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-31 14:44:11,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:44:11,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 14:44:11,887 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 14:44:11,889 INFO L207 CegarAbsIntRunner]: [0], [32], [35] [2019-01-31 14:44:11,922 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 14:44:11,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 14:44:12,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 14:44:12,011 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 98 root evaluator evaluations with a maximum evaluation depth of 3. Performed 98 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-31 14:44:12,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 14:44:12,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 14:44:12,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 14:44:12,017 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-31 14:44:12,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 14:44:12,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 14:44:12,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:44:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 14:44:12,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 14:44:12,849 WARN L181 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-31 14:44:12,890 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 27 treesize of output 30 [2019-01-31 14:44:12,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:12,939 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 30 treesize of output 36 [2019-01-31 14:44:12,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:12,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:12,989 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 32 treesize of output 46 [2019-01-31 14:44:13,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,035 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 34 treesize of output 60 [2019-01-31 14:44:13,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,094 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 36 treesize of output 78 [2019-01-31 14:44:13,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,169 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 38 treesize of output 100 [2019-01-31 14:44:13,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 126 [2019-01-31 14:44:13,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:13,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 153 [2019-01-31 14:44:13,637 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-31 14:44:13,753 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:13,824 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:13,900 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:13,945 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:13,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:14,056 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:14,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:14,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,166 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 43 treesize of output 52 [2019-01-31 14:44:14,229 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 48 treesize of output 40 [2019-01-31 14:44:14,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,332 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 67 [2019-01-31 14:44:14,357 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 43 treesize of output 62 [2019-01-31 14:44:14,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-31 14:44:14,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:14,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-31 14:44:14,635 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-31 14:44:14,637 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:14,640 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:14,645 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:14,647 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:14,652 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 14:44:14,705 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-31 14:44:14,705 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 8 variables, input treesize:94, output treesize:62 [2019-01-31 14:44:21,804 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:44:21,804 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_42|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, |v_#valid_10|]. (let ((.cse1 (store |v_#valid_10| ULTIMATE.start_main_p1 1))) (let ((.cse0 (store (store .cse1 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3 1))) (and (= 0 (select .cse0 ULTIMATE.start_main_p4)) (= 0 (select (store (store (store .cse0 ULTIMATE.start_main_p4 1) ULTIMATE.start_main_p5 1) ULTIMATE.start_main_p6 1) ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (store (store (store (store (store (store (store (store |v_#memory_int_42| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) ULTIMATE.start_main_p4 0) ULTIMATE.start_main_p5 0) ULTIMATE.start_main_p6 0) ULTIMATE.start_main_p7 0) ULTIMATE.start_main_p8 0) |#memory_int|) (= (select .cse1 ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< 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-31 14:44:21,804 WARN L399 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)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< 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-31 14:44:22,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 14:44:22,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 159 [2019-01-31 14:44:22,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 14:44:22,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-01-31 14:44:22,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:72, output treesize:62 [2019-01-31 14:44:32,924 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-31 14:44:32,924 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_43|, ULTIMATE.start_main_p8, 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_43| ULTIMATE.start_main_p8))) (and (= (select |v_#memory_int_43| ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (store |v_#memory_int_43| ULTIMATE.start_main_p8 (+ .cse0 (- 1))) |#memory_int|) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |v_#memory_int_43| ULTIMATE.start_main_p3) 0) (= .cse0 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |v_#memory_int_43| ULTIMATE.start_main_p5) 0) (= (select |v_#memory_int_43| ULTIMATE.start_main_p6) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |v_#memory_int_43| ULTIMATE.start_main_p1) 0) (= (select |v_#memory_int_43| ULTIMATE.start_main_p7) 0) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (= (select |v_#memory_int_43| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2019-01-31 14:44:32,925 WARN L399 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_p8, 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) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p8)) (= 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_p7 ULTIMATE.start_main_p8) (< 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-31 14:44:54,822 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-31 14:44:58,172 INFO L273 TraceCheckUtils]: 0: Hoare triple {150#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0]; {157#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (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_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) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< 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)))))} is VALID [2019-01-31 14:45:06,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {157#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (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_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) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< 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)))))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {161#(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_p8 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_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) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< 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_p8) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-01-31 14:45:06,710 INFO L273 TraceCheckUtils]: 2: Hoare triple {161#(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_p8 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_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) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< 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_p8) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {151#false} is VALID [2019-01-31 14:45:06,711 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-31 14:45:06,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 14:45:06,801 INFO L273 TraceCheckUtils]: 2: Hoare triple {165#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {151#false} is VALID [2019-01-31 14:45:06,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {169#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {165#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-31 14:45:06,807 INFO L273 TraceCheckUtils]: 0: Hoare triple {150#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0]; {169#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-01-31 14:45:06,808 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-31 14:45:06,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 14:45:06,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 14:45:06,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 14:45:06,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 14:45:06,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-31 14:45:06,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-31 14:45:18,466 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-31 14:45:18,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 14:45:18,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 14:45:18,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=31, Unknown=1, NotChecked=0, Total=56 [2019-01-31 14:45:18,468 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 6 states. [2019-01-31 14:45:50,219 WARN L181 SmtUtils]: Spent 10.87 s on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-01-31 14:50:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 14:50:59,202 INFO L93 Difference]: Finished difference Result 63 states and 92 transitions. [2019-01-31 14:50:59,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 14:50:59,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 14:50:59,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 14:50:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:50:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2019-01-31 14:50:59,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-31 14:50:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2019-01-31 14:50:59,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 92 transitions. [2019-01-31 14:51:10,947 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:8092 -smt2 -in -t:10000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:666) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.checkEnhancement(BasicCegarLoop.java:848) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:744) 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) ... 27 more [2019-01-31 14:51:10,951 INFO L168 Benchmark]: Toolchain (without parser) took 422013.46 ms. Allocated memory was 138.9 MB in the beginning and 261.1 MB in the end (delta: 122.2 MB). Free memory was 106.0 MB in the beginning and 143.9 MB in the end (delta: -38.0 MB). Peak memory consumption was 84.2 MB. Max. memory is 7.1 GB. [2019-01-31 14:51:10,952 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory is still 107.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 14:51:10,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.16 ms. Allocated memory is still 138.9 MB. Free memory was 106.0 MB in the beginning and 103.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-01-31 14:51:10,954 INFO L168 Benchmark]: Boogie Preprocessor took 46.05 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 101.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-01-31 14:51:10,954 INFO L168 Benchmark]: RCFGBuilder took 1370.72 ms. Allocated memory is still 138.9 MB. Free memory was 101.9 MB in the beginning and 70.9 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. [2019-01-31 14:51:10,955 INFO L168 Benchmark]: TraceAbstraction took 420518.26 ms. Allocated memory was 138.9 MB in the beginning and 261.1 MB in the end (delta: 122.2 MB). Free memory was 70.7 MB in the beginning and 143.9 MB in the end (delta: -73.3 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. [2019-01-31 14:51:10,960 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.20 ms. Allocated memory is still 138.9 MB. Free memory is still 107.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.16 ms. Allocated memory is still 138.9 MB. Free memory was 106.0 MB in the beginning and 103.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.05 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 101.9 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1370.72 ms. Allocated memory is still 138.9 MB. Free memory was 101.9 MB in the beginning and 70.9 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 420518.26 ms. Allocated memory was 138.9 MB in the beginning and 261.1 MB in the end (delta: 122.2 MB). Free memory was 70.7 MB in the beginning and 143.9 MB in the end (delta: -73.3 MB). Peak memory consumption was 48.9 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:8092 -smt2 -in -t:10000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000)Received EOF on stdin. No stderr output.: 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...