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_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:51:52,450 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:51:52,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:51:52,467 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:51:52,467 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:51:52,468 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:51:52,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:51:52,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:51:52,473 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:51:52,473 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:51:52,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:51:52,475 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:51:52,476 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:51:52,476 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:51:52,478 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:51:52,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:51:52,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:51:52,481 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:51:52,485 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:51:52,486 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:51:52,487 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:51:52,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:51:52,490 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:51:52,491 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:51:52,491 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:51:52,492 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:51:52,493 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:51:52,494 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:51:52,494 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:51:52,496 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:51:52,496 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:51:52,497 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:51:52,497 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:51:52,497 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:51:52,498 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:51:52,499 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:51:52,499 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-28 13:51:52,514 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:51:52,515 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:51:52,516 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:51:52,516 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:51:52,516 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:51:52,516 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:51:52,516 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:51:52,517 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:51:52,517 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:51:52,517 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 13:51:52,517 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 13:51:52,517 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:51:52,518 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:51:52,518 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:51:52,518 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:51:52,519 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:51:52,519 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:51:52,519 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:51:52,519 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:51:52,519 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:51:52,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:51:52,520 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:51:52,520 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:51:52,520 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:51:52,520 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:51:52,521 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:51:52,521 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:51:52,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:51:52,521 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:51:52,521 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:51:52,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:51:52,522 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:51:52,522 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:51:52,522 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:51:52,522 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:51:52,523 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:51:52,523 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:51:52,523 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:51:52,523 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:51:52,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:51:52,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:51:52,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:51:52,588 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:51:52,589 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:51:52,589 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl [2019-02-28 13:51:52,590 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl' [2019-02-28 13:51:52,646 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:51:52,647 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:51:52,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:51:52,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:51:52,648 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:51:52,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:51:52" (1/1) ... [2019-02-28 13:51:52,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:51:52" (1/1) ... [2019-02-28 13:51:52,713 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:51:52,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:51:52,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:51:52,714 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:51:52,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:51:52" (1/1) ... [2019-02-28 13:51:52,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:51:52" (1/1) ... [2019-02-28 13:51:52,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:51:52" (1/1) ... [2019-02-28 13:51:52,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:51:52" (1/1) ... [2019-02-28 13:51:52,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:51:52" (1/1) ... [2019-02-28 13:51:52,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:51:52" (1/1) ... [2019-02-28 13:51:52,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:51:52" (1/1) ... [2019-02-28 13:51:52,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:51:52,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:51:52,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:51:52,744 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:51:52,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:51:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:51:52,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:51:52,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:51:53,720 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:51:53,720 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-02-28 13:51:53,722 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:51:53 BoogieIcfgContainer [2019-02-28 13:51:53,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:51:53,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:51:53,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:51:53,727 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:51:53,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:51:52" (1/2) ... [2019-02-28 13:51:53,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b4ea46 and model type speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:51:53, skipping insertion in model container [2019-02-28 13:51:53,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:51:53" (2/2) ... [2019-02-28 13:51:53,731 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-limited.bpl [2019-02-28 13:51:53,742 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:51:53,750 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-02-28 13:51:53,767 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-02-28 13:51:53,800 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:51:53,801 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:51:53,801 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:51:53,801 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:51:53,801 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:51:53,801 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:51:53,802 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:51:53,802 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:51:53,817 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-02-28 13:51:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 13:51:53,824 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:51:53,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 13:51:53,827 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:51:53,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:51:53,833 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-02-28 13:51:53,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:51:53,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:51:53,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:51:53,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:51:53,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:51:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:51:54,113 INFO L273 TraceCheckUtils]: 0: Hoare triple {20#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0]; {22#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:51:54,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {21#false} is VALID [2019-02-28 13:51:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:51:54,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:51:54,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:51:54,136 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:51:54,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:51:54,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:51:54,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:51:54,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:51:54,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:51:54,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:51:54,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:51:54,171 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-02-28 13:51:54,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:51:54,710 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-02-28 13:51:54,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:51:54,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:51:54,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:51:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:51:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2019-02-28 13:51:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:51:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2019-02-28 13:51:54,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2019-02-28 13:51:54,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:51:54,894 INFO L225 Difference]: With dead ends: 33 [2019-02-28 13:51:54,894 INFO L226 Difference]: Without dead ends: 28 [2019-02-28 13:51:54,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:51:54,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-28 13:51:54,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-02-28 13:51:54,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:51:54,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 16 states. [2019-02-28 13:51:54,970 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 16 states. [2019-02-28 13:51:54,970 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 16 states. [2019-02-28 13:51:54,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:51:54,976 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-28 13:51:54,976 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-02-28 13:51:54,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:51:54,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:51:54,977 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 28 states. [2019-02-28 13:51:54,977 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 28 states. [2019-02-28 13:51:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:51:54,983 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-28 13:51:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-02-28 13:51:54,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:51:54,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:51:54,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:51:54,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:51:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 13:51:54,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-02-28 13:51:54,989 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-02-28 13:51:54,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:51:54,989 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-02-28 13:51:54,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:51:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-02-28 13:51:54,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:51:54,990 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:51:54,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:51:54,991 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:51:54,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:51:54,991 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-02-28 13:51:54,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:51:54,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:51:54,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:51:54,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:51:54,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:51:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:51:55,075 INFO L273 TraceCheckUtils]: 0: Hoare triple {134#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0]; {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-28 13:51:55,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-28 13:51:55,080 INFO L273 TraceCheckUtils]: 2: Hoare triple {136#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {135#false} is VALID [2019-02-28 13:51:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:51:55,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:51:55,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:51:55,081 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:51:55,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:51:55,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:51:55,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:51:55,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:51:55,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:51:55,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:51:55,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:51:55,119 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-02-28 13:51:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:51:55,591 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-28 13:51:55,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:51:55,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:51:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:51:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:51:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2019-02-28 13:51:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:51:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2019-02-28 13:51:55,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 40 transitions. [2019-02-28 13:51:55,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:51:55,691 INFO L225 Difference]: With dead ends: 28 [2019-02-28 13:51:55,691 INFO L226 Difference]: Without dead ends: 27 [2019-02-28 13:51:55,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:51:55,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-28 13:51:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-02-28 13:51:55,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:51:55,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 17 states. [2019-02-28 13:51:55,741 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 17 states. [2019-02-28 13:51:55,741 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 17 states. [2019-02-28 13:51:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:51:55,745 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2019-02-28 13:51:55,745 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2019-02-28 13:51:55,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:51:55,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:51:55,746 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 27 states. [2019-02-28 13:51:55,746 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 27 states. [2019-02-28 13:51:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:51:55,749 INFO L93 Difference]: Finished difference Result 27 states and 39 transitions. [2019-02-28 13:51:55,749 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2019-02-28 13:51:55,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:51:55,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:51:55,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:51:55,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:51:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 13:51:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-02-28 13:51:55,753 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-02-28 13:51:55,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:51:55,754 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-02-28 13:51:55,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:51:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-02-28 13:51:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:51:55,754 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:51:55,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:51:55,755 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:51:55,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:51:55,755 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-02-28 13:51:55,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:51:55,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:51:55,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:51:55,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:51:55,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:51:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:51:55,893 INFO L273 TraceCheckUtils]: 0: Hoare triple {242#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0]; {244#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2019-02-28 13:51:55,894 INFO L273 TraceCheckUtils]: 1: Hoare triple {244#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {245#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:51:55,894 INFO L273 TraceCheckUtils]: 2: Hoare triple {245#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {243#false} is VALID [2019-02-28 13:51:55,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:51:55,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:51:55,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:51:55,896 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:51:55,898 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-02-28 13:51:55,959 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:51:55,960 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:56:34,522 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-02-28 13:56:34,523 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-02-28 13:56:34,523 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-02-28 13:56:34,524 WARN L223 ngHoareTripleChecker]: -- [2019-02-28 13:56:34,524 WARN L224 ngHoareTripleChecker]: Pre: {2147483645#(forall ((v_idx_48 Int) (v_idx_34 Int) (v_idx_46 Int) (v_idx_44 Int) (v_idx_30 Int) (v_idx_42 Int) (v_idx_50 Int) (v_idx_40 Int) (v_idx_38 Int)) (and (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p5) (- 3)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p5 2) c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p5 2) c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p3) (- 1)) (<= (+ c_ULTIMATE.start_main_p2 5) c_ULTIMATE.start_main_p7) (<= (- c_ULTIMATE.start_main_p5 c_ULTIMATE.start_main_p6) (- 1)) (<= (- c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (- 1)) (<= (- c_ULTIMATE.start_main_p7 c_ULTIMATE.start_malloc_ptr) 0) (<= (+ c_ULTIMATE.start_main_p3 4) c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p3) (- 2)) (<= (- (- c_ULTIMATE.start_main_p7) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= (+ c_ULTIMATE.start_main_p2 4) c_ULTIMATE.start_main_p6) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_main_p5) (- 2)) (<= (+ c_ULTIMATE.start_main_p6 1) c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p6 c_ULTIMATE.start_main_p7) (- 1)) (<= (+ c_ULTIMATE.start_main_p3 4) c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p5 1) c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 6) c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p4 3) c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_malloc_ptr) (- 6)) (<= (+ c_ULTIMATE.start_main_p3 1) c_ULTIMATE.start_main_p4) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p7) (- 6)) (<= (+ c_ULTIMATE.start_main_p6 1) c_ULTIMATE.start_main_p7) (<= (- c_ULTIMATE.start_main_p4 c_ULTIMATE.start_main_p6) (- 2)) (or (< v_idx_34 c_ULTIMATE.start_main_p7) (= 1 (select |c_#valid| v_idx_34)) (<= (+ c_ULTIMATE.start_main_p7 1) v_idx_34)) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (- 4)) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_main_p7) (- 4)) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p4) (- 3)) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p6) (- 4)) (or (= 0 (select |c_#memory_int| v_idx_38)) (<= (+ c_ULTIMATE.start_main_p1 1) v_idx_38) (< v_idx_38 c_ULTIMATE.start_main_p1)) (or (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_44) (= 0 (select |c_#memory_int| v_idx_44)) (< v_idx_44 c_ULTIMATE.start_main_p4)) (or (<= (+ c_ULTIMATE.start_main_p6 1) v_idx_48) (= 0 (select |c_#memory_int| v_idx_48)) (< v_idx_48 c_ULTIMATE.start_main_p6)) (<= (+ c_ULTIMATE.start_main_p3 3) c_ULTIMATE.start_main_p6) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p5) (- 4)) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_main_p4) (- 1)) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_30)) (< v_idx_30 c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p7 1) v_idx_30)) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p4) (- 2)) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_main_p6) (- 3)) (<= (+ c_ULTIMATE.start_main_p4 1) c_ULTIMATE.start_main_p5) (<= (- c_ULTIMATE.start_main_p4 c_ULTIMATE.start_main_p5) (- 1)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (<= (- c_ULTIMATE.start_main_p5 c_ULTIMATE.start_malloc_ptr) (- 2)) (<= (+ c_ULTIMATE.start_main_p1 6) c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p4 c_ULTIMATE.start_main_p7) (- 3)) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p2) (- 1)) (<= (+ c_ULTIMATE.start_main_p4 3) c_ULTIMATE.start_main_p7) (or (< v_idx_46 c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p5 1) v_idx_46) (= 0 (select |c_#memory_int| v_idx_46))) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 5) c_ULTIMATE.start_main_p6) (<= (- c_ULTIMATE.start_main_p5 c_ULTIMATE.start_main_p7) (- 2)) (<= c_ULTIMATE.start_main_p7 c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p6) (- 5)) (or (= 0 (select |c_#memory_int| v_idx_50)) (< v_idx_50 c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p7 1) v_idx_50)) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p7) (- 5)) (or (< v_idx_42 c_ULTIMATE.start_main_p3) (= 0 (select |c_#memory_int| v_idx_42)) (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_42)) (<= (+ c_ULTIMATE.start_main_p2 5) c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (- c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (- 3)) (or (<= (+ c_ULTIMATE.start_main_p2 1) v_idx_40) (< v_idx_40 c_ULTIMATE.start_main_p2) (= 0 (select |c_#memory_int| v_idx_40))) (<= (+ c_ULTIMATE.start_main_p2 1) c_ULTIMATE.start_main_p3) (<= (+ c_ULTIMATE.start_main_p1 1) c_ULTIMATE.start_main_p2) (<= (+ c_ULTIMATE.start_main_p4 2) c_ULTIMATE.start_main_p6) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_malloc_ptr) (- 5))))} [2019-02-28 13:56:34,525 WARN L228 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; [2019-02-28 13:56:34,525 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p4 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p4) (- 1)))) [2019-02-28 13:56:34,526 WARN L230 ngHoareTripleChecker]: Post: {2147483644#(forall ((v_idx_69 Int) (v_idx_67 Int) (v_idx_57 Int) (v_idx_65 Int) (v_idx_63 Int) (v_idx_53 Int) (v_idx_61 Int) (v_idx_73 Int) (v_idx_71 Int)) (and (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p5) (- 3)) (<= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p5 2) c_ULTIMATE.start_main_p7) (or (<= (+ c_ULTIMATE.start_main_p6 1) v_idx_71) (= 0 (select |c_#memory_int| v_idx_71)) (< v_idx_71 c_ULTIMATE.start_main_p6)) (<= (+ c_ULTIMATE.start_main_p5 2) c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p3) (- 1)) (<= (+ c_ULTIMATE.start_main_p2 5) c_ULTIMATE.start_main_p7) (or (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_67) (< v_idx_67 c_ULTIMATE.start_main_p4) (= (- 1) (select |c_#memory_int| v_idx_67))) (<= (- c_ULTIMATE.start_main_p5 c_ULTIMATE.start_main_p6) (- 1)) (<= (- c_ULTIMATE.start_main_p6 c_ULTIMATE.start_malloc_ptr) (- 1)) (<= (- c_ULTIMATE.start_main_p7 c_ULTIMATE.start_malloc_ptr) 0) (or (< v_idx_65 c_ULTIMATE.start_main_p3) (= 0 (select |c_#memory_int| v_idx_65)) (<= (+ c_ULTIMATE.start_main_p3 1) v_idx_65)) (<= (+ c_ULTIMATE.start_main_p3 4) c_ULTIMATE.start_main_p7) (or (< v_idx_61 c_ULTIMATE.start_main_p1) (<= (+ c_ULTIMATE.start_main_p1 1) v_idx_61) (= (select |c_#memory_int| v_idx_61) 0)) (<= (+ c_ULTIMATE.start_main_p1 2) c_ULTIMATE.start_main_p3) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p3) (- 2)) (<= (- (- c_ULTIMATE.start_main_p7) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= (+ c_ULTIMATE.start_main_p2 4) c_ULTIMATE.start_main_p6) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_main_p5) (- 2)) (<= (+ c_ULTIMATE.start_main_p6 1) c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p6 c_ULTIMATE.start_main_p7) (- 1)) (<= (+ c_ULTIMATE.start_main_p3 4) c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p5 1) c_ULTIMATE.start_main_p6) (<= (+ c_ULTIMATE.start_main_p1 6) c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p4 3) c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p1 4) c_ULTIMATE.start_main_p5) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_malloc_ptr) (- 6)) (<= (+ c_ULTIMATE.start_main_p3 1) c_ULTIMATE.start_main_p4) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p7) (- 6)) (<= (+ c_ULTIMATE.start_main_p6 1) c_ULTIMATE.start_main_p7) (<= (- c_ULTIMATE.start_main_p4 c_ULTIMATE.start_main_p6) (- 2)) (or (<= (+ c_ULTIMATE.start_main_p7 1) v_idx_57) (= (select |c_#valid| v_idx_57) 1) (< v_idx_57 c_ULTIMATE.start_main_p7)) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) (- 4)) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_main_p7) (- 4)) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p4) (- 3)) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p6) (- 4)) (or (= (select |c_#memory_int| v_idx_69) 0) (<= (+ c_ULTIMATE.start_main_p5 1) v_idx_69) (< v_idx_69 c_ULTIMATE.start_main_p5)) (<= (+ c_ULTIMATE.start_main_p3 3) c_ULTIMATE.start_main_p6) (or (= 0 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_53)) (<= (+ c_ULTIMATE.start_main_p7 1) v_idx_53) (< v_idx_53 c_ULTIMATE.start_main_p7)) (or (< v_idx_63 c_ULTIMATE.start_main_p2) (= (select |c_#memory_int| v_idx_63) 0) (<= (+ c_ULTIMATE.start_main_p2 1) v_idx_63)) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p5) (- 4)) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_main_p4) (- 1)) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p4) (- 2)) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_main_p6) (- 3)) (<= (+ c_ULTIMATE.start_main_p4 1) c_ULTIMATE.start_main_p5) (<= (- c_ULTIMATE.start_main_p4 c_ULTIMATE.start_main_p5) (- 1)) (<= (+ c_ULTIMATE.start_main_p2 3) c_ULTIMATE.start_main_p5) (<= (- c_ULTIMATE.start_main_p5 c_ULTIMATE.start_malloc_ptr) (- 2)) (<= (+ c_ULTIMATE.start_main_p1 6) c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p4 c_ULTIMATE.start_main_p7) (- 3)) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p2) (- 1)) (<= (+ c_ULTIMATE.start_main_p4 3) c_ULTIMATE.start_main_p7) (<= (+ c_ULTIMATE.start_main_p3 2) c_ULTIMATE.start_main_p5) (<= (+ c_ULTIMATE.start_main_p1 3) c_ULTIMATE.start_main_p4) (<= (+ c_ULTIMATE.start_main_p1 5) c_ULTIMATE.start_main_p6) (<= (- c_ULTIMATE.start_main_p5 c_ULTIMATE.start_main_p7) (- 2)) (<= c_ULTIMATE.start_main_p7 c_ULTIMATE.start_malloc_ptr) (<= (- c_ULTIMATE.start_main_p1 c_ULTIMATE.start_main_p6) (- 5)) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_main_p7) (- 5)) (<= (+ c_ULTIMATE.start_main_p2 5) c_ULTIMATE.start_malloc_ptr) (<= (+ c_ULTIMATE.start_main_p2 2) c_ULTIMATE.start_main_p4) (<= (- c_ULTIMATE.start_main_p4 c_ULTIMATE.start_malloc_ptr) (- 3)) (<= (+ c_ULTIMATE.start_main_p2 1) c_ULTIMATE.start_main_p3) (or (= (select |c_#memory_int| v_idx_73) 0) (<= (+ c_ULTIMATE.start_main_p7 1) v_idx_73) (< v_idx_73 c_ULTIMATE.start_main_p7)) (<= (+ c_ULTIMATE.start_main_p1 1) c_ULTIMATE.start_main_p2) (<= (+ c_ULTIMATE.start_main_p4 2) c_ULTIMATE.start_main_p6) (<= (- c_ULTIMATE.start_main_p2 c_ULTIMATE.start_malloc_ptr) (- 5))))} [2019-02-28 13:56:34,526 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-02-28 13:56:34,706 WARN L268 ngHoareTripleChecker]: -- [2019-02-28 13:56:34,707 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-02-28 13:56:36,250 WARN L270 ngHoareTripleChecker]: Pre: {2147483645#(and (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_main_p5) (- 3)) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p7) (<= (+ ULTIMATE.start_main_p5 2) ULTIMATE.start_main_p7) (forall ((v_idx_30 Int)) (or (= 0 (select |ULTIMATE.start_malloc_old_#valid| v_idx_30)) (< v_idx_30 ULTIMATE.start_main_p7) (<= (+ ULTIMATE.start_main_p7 1) v_idx_30))) (<= (+ ULTIMATE.start_main_p5 2) ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (- 1)) (<= (+ ULTIMATE.start_main_p2 5) ULTIMATE.start_main_p7) (<= (- ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (- 1)) (<= (- ULTIMATE.start_main_p6 ULTIMATE.start_malloc_ptr) (- 1)) (<= (- ULTIMATE.start_main_p7 ULTIMATE.start_malloc_ptr) 0) (<= (+ ULTIMATE.start_main_p3 4) ULTIMATE.start_main_p7) (forall ((v_idx_34 Int)) (or (< v_idx_34 ULTIMATE.start_main_p7) (= 1 (select |#valid| v_idx_34)) (<= (+ ULTIMATE.start_main_p7 1) v_idx_34))) (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_main_p3) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p3) (- 2)) (<= (- (- ULTIMATE.start_main_p7) (- ULTIMATE.start_malloc_ptr)) 0) (<= (+ ULTIMATE.start_main_p2 4) ULTIMATE.start_main_p6) (<= (- ULTIMATE.start_main_p3 ULTIMATE.start_main_p5) (- 2)) (<= (+ ULTIMATE.start_main_p6 1) ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (- 1)) (<= (+ ULTIMATE.start_main_p3 4) ULTIMATE.start_malloc_ptr) (<= (+ ULTIMATE.start_main_p5 1) ULTIMATE.start_main_p6) (<= (+ ULTIMATE.start_main_p1 6) ULTIMATE.start_main_p7) (<= (+ ULTIMATE.start_main_p4 3) ULTIMATE.start_malloc_ptr) (<= (+ ULTIMATE.start_main_p1 4) ULTIMATE.start_main_p5) (forall ((v_idx_40 Int)) (or (<= (+ ULTIMATE.start_main_p2 1) v_idx_40) (< v_idx_40 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| v_idx_40)))) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_malloc_ptr) (- 6)) (forall ((v_idx_48 Int)) (or (<= (+ ULTIMATE.start_main_p6 1) v_idx_48) (= 0 (select |#memory_int| v_idx_48)) (< v_idx_48 ULTIMATE.start_main_p6))) (<= (+ ULTIMATE.start_main_p3 1) ULTIMATE.start_main_p4) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p7) (- 6)) (forall ((v_idx_50 Int)) (or (= 0 (select |#memory_int| v_idx_50)) (< v_idx_50 ULTIMATE.start_main_p7) (<= (+ ULTIMATE.start_main_p7 1) v_idx_50))) (<= (+ ULTIMATE.start_main_p6 1) ULTIMATE.start_main_p7) (<= (- ULTIMATE.start_main_p4 ULTIMATE.start_main_p6) (- 2)) (<= (- ULTIMATE.start_main_p3 ULTIMATE.start_malloc_ptr) (- 4)) (<= (- ULTIMATE.start_main_p3 ULTIMATE.start_main_p7) (- 4)) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p4) (- 3)) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_main_p6) (- 4)) (<= (+ ULTIMATE.start_main_p3 3) ULTIMATE.start_main_p6) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p5) (- 4)) (<= (- ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (- 1)) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_main_p4) (- 2)) (<= (- ULTIMATE.start_main_p3 ULTIMATE.start_main_p6) (- 3)) (<= (+ ULTIMATE.start_main_p4 1) ULTIMATE.start_main_p5) (<= (- ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (- 1)) (<= (+ ULTIMATE.start_main_p2 3) ULTIMATE.start_main_p5) (<= (- ULTIMATE.start_main_p5 ULTIMATE.start_malloc_ptr) (- 2)) (<= (+ ULTIMATE.start_main_p1 6) ULTIMATE.start_malloc_ptr) (forall ((v_idx_38 Int)) (or (= 0 (select |#memory_int| v_idx_38)) (<= (+ ULTIMATE.start_main_p1 1) v_idx_38) (< v_idx_38 ULTIMATE.start_main_p1))) (<= (- ULTIMATE.start_main_p4 ULTIMATE.start_main_p7) (- 3)) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (- 1)) (<= (+ ULTIMATE.start_main_p4 3) ULTIMATE.start_main_p7) (<= (+ ULTIMATE.start_main_p3 2) ULTIMATE.start_main_p5) (<= (+ ULTIMATE.start_main_p1 3) ULTIMATE.start_main_p4) (<= (+ ULTIMATE.start_main_p1 5) ULTIMATE.start_main_p6) (<= (- ULTIMATE.start_main_p5 ULTIMATE.start_main_p7) (- 2)) (<= ULTIMATE.start_main_p7 ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p6) (- 5)) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_main_p7) (- 5)) (<= (+ ULTIMATE.start_main_p2 5) ULTIMATE.start_malloc_ptr) (<= (+ ULTIMATE.start_main_p2 2) ULTIMATE.start_main_p4) (<= (- ULTIMATE.start_main_p4 ULTIMATE.start_malloc_ptr) (- 3)) (<= (+ ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) (forall ((v_idx_44 Int)) (or (<= (+ ULTIMATE.start_main_p4 1) v_idx_44) (= 0 (select |#memory_int| v_idx_44)) (< v_idx_44 ULTIMATE.start_main_p4))) (<= (+ ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2) (forall ((v_idx_46 Int)) (or (< v_idx_46 ULTIMATE.start_main_p5) (<= (+ ULTIMATE.start_main_p5 1) v_idx_46) (= 0 (select |#memory_int| v_idx_46)))) (<= (+ ULTIMATE.start_main_p4 2) ULTIMATE.start_main_p6) (forall ((v_idx_42 Int)) (or (< v_idx_42 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| v_idx_42)) (<= (+ ULTIMATE.start_main_p3 1) v_idx_42))) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) (- 5)))} [2019-02-28 13:56:36,251 WARN L274 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; [2019-02-28 13:56:36,251 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p4 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p4) (- 1)))) [2019-02-28 13:56:36,460 WARN L276 ngHoareTripleChecker]: Post: {2147483644#(and (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_main_p5) (- 3)) (<= ULTIMATE.start_malloc_ptr ULTIMATE.start_main_p7) (<= (+ ULTIMATE.start_main_p5 2) ULTIMATE.start_main_p7) (forall ((v_idx_53 Int)) (or (= 0 (select |ULTIMATE.start_malloc_old_#valid| v_idx_53)) (<= (+ ULTIMATE.start_main_p7 1) v_idx_53) (< v_idx_53 ULTIMATE.start_main_p7))) (<= (+ ULTIMATE.start_main_p5 2) ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (- 1)) (<= (+ ULTIMATE.start_main_p2 5) ULTIMATE.start_main_p7) (forall ((v_idx_73 Int)) (or (= (select |#memory_int| v_idx_73) 0) (<= (+ ULTIMATE.start_main_p7 1) v_idx_73) (< v_idx_73 ULTIMATE.start_main_p7))) (<= (- ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (- 1)) (forall ((v_idx_69 Int)) (or (= (select |#memory_int| v_idx_69) 0) (<= (+ ULTIMATE.start_main_p5 1) v_idx_69) (< v_idx_69 ULTIMATE.start_main_p5))) (<= (- ULTIMATE.start_main_p6 ULTIMATE.start_malloc_ptr) (- 1)) (<= (- ULTIMATE.start_main_p7 ULTIMATE.start_malloc_ptr) 0) (<= (+ ULTIMATE.start_main_p3 4) ULTIMATE.start_main_p7) (<= (+ ULTIMATE.start_main_p1 2) ULTIMATE.start_main_p3) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p3) (- 2)) (<= (- (- ULTIMATE.start_main_p7) (- ULTIMATE.start_malloc_ptr)) 0) (<= (+ ULTIMATE.start_main_p2 4) ULTIMATE.start_main_p6) (<= (- ULTIMATE.start_main_p3 ULTIMATE.start_main_p5) (- 2)) (<= (+ ULTIMATE.start_main_p6 1) ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (- 1)) (<= (+ ULTIMATE.start_main_p3 4) ULTIMATE.start_malloc_ptr) (<= (+ ULTIMATE.start_main_p5 1) ULTIMATE.start_main_p6) (<= (+ ULTIMATE.start_main_p1 6) ULTIMATE.start_main_p7) (<= (+ ULTIMATE.start_main_p4 3) ULTIMATE.start_malloc_ptr) (<= (+ ULTIMATE.start_main_p1 4) ULTIMATE.start_main_p5) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_malloc_ptr) (- 6)) (<= (+ ULTIMATE.start_main_p3 1) ULTIMATE.start_main_p4) (forall ((v_idx_63 Int)) (or (< v_idx_63 ULTIMATE.start_main_p2) (= (select |#memory_int| v_idx_63) 0) (<= (+ ULTIMATE.start_main_p2 1) v_idx_63))) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p7) (- 6)) (<= (+ ULTIMATE.start_main_p6 1) ULTIMATE.start_main_p7) (<= (- ULTIMATE.start_main_p4 ULTIMATE.start_main_p6) (- 2)) (forall ((v_idx_57 Int)) (or (<= (+ ULTIMATE.start_main_p7 1) v_idx_57) (= (select |#valid| v_idx_57) 1) (< v_idx_57 ULTIMATE.start_main_p7))) (<= (- ULTIMATE.start_main_p3 ULTIMATE.start_malloc_ptr) (- 4)) (<= (- ULTIMATE.start_main_p3 ULTIMATE.start_main_p7) (- 4)) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p4) (- 3)) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_main_p6) (- 4)) (<= (+ ULTIMATE.start_main_p3 3) ULTIMATE.start_main_p6) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p5) (- 4)) (<= (- ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (- 1)) (forall ((v_idx_67 Int)) (or (<= (+ ULTIMATE.start_main_p4 1) v_idx_67) (< v_idx_67 ULTIMATE.start_main_p4) (= (- 1) (select |#memory_int| v_idx_67)))) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_main_p4) (- 2)) (<= (- ULTIMATE.start_main_p3 ULTIMATE.start_main_p6) (- 3)) (<= (+ ULTIMATE.start_main_p4 1) ULTIMATE.start_main_p5) (<= (- ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (- 1)) (<= (+ ULTIMATE.start_main_p2 3) ULTIMATE.start_main_p5) (<= (- ULTIMATE.start_main_p5 ULTIMATE.start_malloc_ptr) (- 2)) (<= (+ ULTIMATE.start_main_p1 6) ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p4 ULTIMATE.start_main_p7) (- 3)) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (- 1)) (<= (+ ULTIMATE.start_main_p4 3) ULTIMATE.start_main_p7) (<= (+ ULTIMATE.start_main_p3 2) ULTIMATE.start_main_p5) (<= (+ ULTIMATE.start_main_p1 3) ULTIMATE.start_main_p4) (<= (+ ULTIMATE.start_main_p1 5) ULTIMATE.start_main_p6) (<= (- ULTIMATE.start_main_p5 ULTIMATE.start_main_p7) (- 2)) (forall ((v_idx_71 Int)) (or (<= (+ ULTIMATE.start_main_p6 1) v_idx_71) (= 0 (select |#memory_int| v_idx_71)) (< v_idx_71 ULTIMATE.start_main_p6))) (<= ULTIMATE.start_main_p7 ULTIMATE.start_malloc_ptr) (<= (- ULTIMATE.start_main_p1 ULTIMATE.start_main_p6) (- 5)) (forall ((v_idx_61 Int)) (or (< v_idx_61 ULTIMATE.start_main_p1) (<= (+ ULTIMATE.start_main_p1 1) v_idx_61) (= (select |#memory_int| v_idx_61) 0))) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_main_p7) (- 5)) (<= (+ ULTIMATE.start_main_p2 5) ULTIMATE.start_malloc_ptr) (<= (+ ULTIMATE.start_main_p2 2) ULTIMATE.start_main_p4) (<= (- ULTIMATE.start_main_p4 ULTIMATE.start_malloc_ptr) (- 3)) (<= (+ ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) (forall ((v_idx_65 Int)) (or (< v_idx_65 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| v_idx_65)) (<= (+ ULTIMATE.start_main_p3 1) v_idx_65))) (<= (+ ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2) (<= (+ ULTIMATE.start_main_p4 2) ULTIMATE.start_main_p6) (<= (- ULTIMATE.start_main_p2 ULTIMATE.start_malloc_ptr) (- 5)))}