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-3-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1377b90 [2019-01-07 14:55:59,794 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 14:55:59,796 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 14:55:59,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 14:55:59,811 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 14:55:59,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 14:55:59,814 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 14:55:59,816 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 14:55:59,818 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 14:55:59,818 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 14:55:59,819 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 14:55:59,820 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 14:55:59,821 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 14:55:59,822 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 14:55:59,823 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 14:55:59,824 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 14:55:59,824 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 14:55:59,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 14:55:59,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 14:55:59,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 14:55:59,831 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 14:55:59,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 14:55:59,835 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 14:55:59,836 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 14:55:59,836 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 14:55:59,837 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 14:55:59,841 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 14:55:59,842 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 14:55:59,846 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 14:55:59,847 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 14:55:59,848 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 14:55:59,848 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 14:55:59,850 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 14:55:59,850 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 14:55:59,852 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 14:55:59,853 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 14:55:59,853 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-01-07 14:55:59,879 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 14:55:59,881 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 14:55:59,882 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 14:55:59,882 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 14:55:59,882 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 14:55:59,883 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 14:55:59,883 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 14:55:59,883 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 14:55:59,883 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 14:55:59,884 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 14:55:59,884 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 14:55:59,884 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 14:55:59,884 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 14:55:59,885 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 14:55:59,885 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 14:55:59,887 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 14:55:59,887 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 14:55:59,887 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 14:55:59,887 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 14:55:59,888 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 14:55:59,888 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 14:55:59,888 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 14:55:59,888 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 14:55:59,888 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 14:55:59,890 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 14:55:59,891 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 14:55:59,891 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 14:55:59,891 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 14:55:59,891 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 14:55:59,891 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 14:55:59,892 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:55:59,892 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 14:55:59,892 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 14:55:59,892 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 14:55:59,892 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 14:55:59,893 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 14:55:59,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 14:55:59,893 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 14:55:59,893 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 14:55:59,948 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 14:55:59,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 14:55:59,967 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 14:55:59,969 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 14:55:59,970 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 14:55:59,971 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl [2019-01-07 14:55:59,971 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl' [2019-01-07 14:56:00,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 14:56:00,029 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 14:56:00,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 14:56:00,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 14:56:00,030 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 14:56:00,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:56:00" (1/1) ... [2019-01-07 14:56:00,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:56:00" (1/1) ... [2019-01-07 14:56:00,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 14:56:00,100 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 14:56:00,100 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 14:56:00,100 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 14:56:00,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:56:00" (1/1) ... [2019-01-07 14:56:00,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:56:00" (1/1) ... [2019-01-07 14:56:00,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:56:00" (1/1) ... [2019-01-07 14:56:00,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:56:00" (1/1) ... [2019-01-07 14:56:00,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:56:00" (1/1) ... [2019-01-07 14:56:00,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:56:00" (1/1) ... [2019-01-07 14:56:00,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:56:00" (1/1) ... [2019-01-07 14:56:00,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 14:56:00,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 14:56:00,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 14:56:00,130 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 14:56:00,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:56:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:56:00,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 14:56:00,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 14:56:00,627 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 14:56:00,627 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-07 14:56:00,629 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:56:00 BoogieIcfgContainer [2019-01-07 14:56:00,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 14:56:00,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 14:56:00,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 14:56:00,634 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 14:56:00,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:56:00" (1/2) ... [2019-01-07 14:56:00,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d993cb5 and model type speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:56:00, skipping insertion in model container [2019-01-07 14:56:00,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:56:00" (2/2) ... [2019-01-07 14:56:00,638 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-unlimited.bpl [2019-01-07 14:56:00,649 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 14:56:00,658 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-07 14:56:00,677 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-07 14:56:00,713 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 14:56:00,714 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 14:56:00,714 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 14:56:00,714 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 14:56:00,714 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 14:56:00,714 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 14:56:00,714 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 14:56:00,715 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 14:56:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-07 14:56:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-07 14:56:00,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:56:00,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-07 14:56:00,747 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:56:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:56:00,756 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-07 14:56:00,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:56:00,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:56:00,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:56:00,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:56:00,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:56:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:56:01,002 INFO L273 TraceCheckUtils]: 0: Hoare triple {12#true} havoc main_p1, main_p2, main_p3;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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {14#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-07 14:56:01,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {14#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {13#false} is VALID [2019-01-07 14:56:01,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:56:01,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:56:01,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 14:56:01,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:56:01,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 14:56:01,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:56:01,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 14:56:01,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:56:01,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 14:56:01,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 14:56:01,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:56:01,067 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-07 14:56:01,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:56:01,336 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-07 14:56:01,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 14:56:01,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-07 14:56:01,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:56:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:56:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-01-07 14:56:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:56:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-01-07 14:56:01,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2019-01-07 14:56:01,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:56:01,512 INFO L225 Difference]: With dead ends: 17 [2019-01-07 14:56:01,512 INFO L226 Difference]: Without dead ends: 12 [2019-01-07 14:56:01,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:56:01,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-07 14:56:01,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-07 14:56:01,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:56:01,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 8 states. [2019-01-07 14:56:01,591 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 8 states. [2019-01-07 14:56:01,591 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 8 states. [2019-01-07 14:56:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:56:01,594 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-07 14:56:01,595 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-01-07 14:56:01,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:56:01,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:56:01,596 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 12 states. [2019-01-07 14:56:01,596 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 12 states. [2019-01-07 14:56:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:56:01,599 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-07 14:56:01,599 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-01-07 14:56:01,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:56:01,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:56:01,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:56:01,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:56:01,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 14:56:01,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-07 14:56:01,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-07 14:56:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:56:01,606 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-07 14:56:01,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 14:56:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-07 14:56:01,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 14:56:01,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:56:01,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 14:56:01,608 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:56:01,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:56:01,608 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-07 14:56:01,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:56:01,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:56:01,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:56:01,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:56:01,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:56:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:56:01,728 INFO L273 TraceCheckUtils]: 0: Hoare triple {70#true} havoc main_p1, main_p2, main_p3;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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-07 14:56:01,737 INFO L273 TraceCheckUtils]: 1: Hoare triple {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-01-07 14:56:01,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {71#false} is VALID [2019-01-07 14:56:01,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:56:01,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:56:01,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-07 14:56:01,752 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:56:01,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 14:56:01,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:56:01,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 14:56:01,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:56:01,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 14:56:01,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 14:56:01,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:56:01,782 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-07 14:56:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:56:01,852 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-07 14:56:01,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 14:56:01,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 14:56:01,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:56:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:56:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-07 14:56:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:56:01,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-07 14:56:01,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2019-01-07 14:56:01,895 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:56:01,896 INFO L225 Difference]: With dead ends: 12 [2019-01-07 14:56:01,896 INFO L226 Difference]: Without dead ends: 11 [2019-01-07 14:56:01,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-01-07 14:56:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-07 14:56:01,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-07 14:56:01,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:56:01,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 9 states. [2019-01-07 14:56:01,911 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 9 states. [2019-01-07 14:56:01,911 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 9 states. [2019-01-07 14:56:01,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:56:01,913 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2019-01-07 14:56:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-01-07 14:56:01,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:56:01,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:56:01,914 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 11 states. [2019-01-07 14:56:01,915 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 11 states. [2019-01-07 14:56:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:56:01,916 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2019-01-07 14:56:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-01-07 14:56:01,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:56:01,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:56:01,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:56:01,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:56:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-07 14:56:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-07 14:56:01,919 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-07 14:56:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:56:01,920 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-07 14:56:01,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 14:56:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-07 14:56:01,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 14:56:01,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:56:01,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 14:56:01,921 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:56:01,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:56:01,921 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-07 14:56:01,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:56:01,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:56:01,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:56:01,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:56:01,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:56:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:56:02,100 INFO L273 TraceCheckUtils]: 0: Hoare triple {122#true} havoc main_p1, main_p2, main_p3;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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {124#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-01-07 14:56:02,101 INFO L273 TraceCheckUtils]: 1: Hoare triple {124#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {125#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-01-07 14:56:02,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {125#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {123#false} is VALID [2019-01-07 14:56:02,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:56:02,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:56:02,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:56:02,106 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-07 14:56:02,108 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-07 14:56:02,169 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 14:56:02,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:56:07,493 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-07 14:56:07,493 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-07 14:56:07,494 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:56:07,495 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:56:07,496 WARN L224 ngHoareTripleChecker]: Pre: {2147483645#(forall ((v_idx_25 Int) (v_idx_26 Int) (v_idx_23 Int) (v_idx_24 Int) (v_idx_21 Int) (v_idx_22 Int) (v_idx_20 Int) (v_idx_18 Int) (v_idx_19 Int) (v_idx_27 Int) (v_idx_17 Int)) (exists ((v_v_34_1 Int) (v_v_33_1 Int) (v_v_32_1 Int) (v_v_43_1 Int) (v_v_42_1 Int) (v_v_41_1 Int) (v_v_28_1 Int) (v_v_26_1 Int) (v_v_27_1 Int) (v_b_12_1 Int) (v_b_23_1 Int) (v_b_22_1 Int) (v_b_13_1 Int) (v_b_16_1 Int) (v_b_17_1 Int) (v_v_2_1 Int) (v_v_4_1 Int)) (and (<= (- v_b_22_1 v_b_23_1) (- 1)) (<= (- (- v_v_27_1) (- v_v_42_1)) 0) (<= (- (- v_b_13_1) (- v_b_23_1)) 0) (<= (- (- v_b_16_1) (- v_b_22_1)) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_17_1) (- 1)) (= v_v_2_1 (select |c_old(#valid)| v_idx_24)) (<= (- (- v_b_13_1) (- v_b_17_1)) 0) (<= (- (- v_b_12_1) (- v_b_22_1)) 0) (<= (- v_v_27_1 (- v_v_42_1)) 0) (= (+ c_ULTIMATE.start_malloc_ptr 1) (+ v_b_16_1 1)) (<= (- v_v_33_1 (- v_v_42_1)) 1) (<= (- (- v_v_42_1) v_v_42_1) 0) (<= (- v_v_33_1 v_v_42_1) 1) (<= (- c_ULTIMATE.start_main_p3 v_b_12_1) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_16_1) 0) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_13_1)) 1) (= (+ c_ULTIMATE.start_malloc_ptr 1) (+ v_b_22_1 1)) (<= (- (- v_b_17_1) (- v_b_22_1)) (- 1)) (<= (- v_v_27_1 v_v_33_1) (- 1)) (= (select |c_old(#memory_int)| v_idx_17) v_v_4_1) (<= (- c_ULTIMATE.start_main_p3 v_b_16_1) 0) (<= (- v_b_12_1 v_b_16_1) 0) (= c_ULTIMATE.start_malloc_ptr v_b_16_1) (<= (- (- v_v_33_1) (- v_v_42_1)) (- 1)) (<= (- v_b_13_1 v_b_16_1) 1) (= (+ c_ULTIMATE.start_malloc_ptr 1) (+ c_ULTIMATE.start_main_p3 1)) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_22_1)) 0) (<= (- v_b_16_1 v_b_23_1) (- 1)) (or (< v_idx_23 v_b_13_1) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_23) v_v_28_1)) (<= (- v_v_33_1 (- v_v_33_1)) 2) (= c_ULTIMATE.start_malloc_ptr c_ULTIMATE.start_main_p3) (<= (- v_v_27_1 (- v_v_27_1)) 0) (<= (- (- v_v_27_1) (- v_v_33_1)) 1) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) 0) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_13_1)) 1) (<= (- v_b_13_1 v_b_22_1) 1) (<= (- v_b_16_1 v_b_22_1) 0) (or (< v_idx_27 v_b_17_1) (= (select |c_#valid| v_idx_27) v_v_34_1)) (<= (- v_b_12_1 v_b_13_1) (- 1)) (= c_ULTIMATE.start_malloc_ptr (+ v_b_23_1 (- 1))) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_22) v_v_27_1) (<= v_b_13_1 v_idx_22) (< v_idx_22 v_b_12_1)) (<= (- c_ULTIMATE.start_main_p3 v_b_13_1) (- 1)) (<= (- c_ULTIMATE.start_main_p3 v_b_23_1) (- 1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_16_1)) 0) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_23_1)) 1) (<= (- (- v_b_13_1) (- v_b_16_1)) (- 1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_17_1)) 1) (= (+ c_ULTIMATE.start_malloc_ptr 1) v_b_13_1) (= c_ULTIMATE.start_malloc_ptr v_b_22_1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_23_1)) 1) (or (= (select |c_#valid| v_idx_25) v_v_32_1) (<= v_b_16_1 v_idx_25)) (or (= (select |c_#valid| v_idx_26) v_v_33_1) (< v_idx_26 v_b_16_1) (<= v_b_17_1 v_idx_26)) (<= (- (- v_b_13_1) (- v_b_22_1)) (- 1)) (<= (- (- v_v_27_1) v_v_42_1) 0) (<= (- (- v_b_16_1) (- v_b_23_1)) 1) (<= (- (- v_v_33_1) v_v_33_1) (- 2)) (or (<= v_b_12_1 v_idx_21) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_21) v_v_26_1)) (<= (- v_b_17_1 v_b_23_1) 0) (<= (- (- v_b_12_1) (- v_b_17_1)) 1) (<= (- v_b_16_1 v_b_17_1) (- 1)) (<= (- v_b_17_1 v_b_22_1) 1) (= c_ULTIMATE.start_malloc_ptr (+ v_b_17_1 (- 1))) (<= (- v_b_12_1 v_b_23_1) (- 1)) (<= (- (- v_b_12_1) (- v_b_23_1)) 1) (<= (- v_v_42_1 (- v_v_42_1)) 0) (or (= (select |c_#memory_int| v_idx_18) v_v_41_1) (<= v_b_22_1 v_idx_18)) (<= (- v_b_12_1 v_b_17_1) (- 1)) (or (< v_idx_20 v_b_23_1) (= (select |c_#memory_int| v_idx_20) v_v_43_1)) (<= (- v_v_27_1 v_v_42_1) 0) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_12_1)) 0) (<= (- (- v_b_12_1) (- v_b_13_1)) 1) (<= (- c_ULTIMATE.start_main_p3 v_b_17_1) (- 1)) (<= (- v_b_13_1 v_b_23_1) 0) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_16_1)) 0) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_17_1)) 1) (<= (- v_b_12_1 v_b_22_1) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_13_1) (- 1)) (= c_ULTIMATE.start_malloc_ptr (+ v_b_13_1 (- 1))) (= c_ULTIMATE.start_malloc_ptr v_b_12_1) (<= (- c_ULTIMATE.start_malloc_ptr v_b_22_1) 0) (<= (- c_ULTIMATE.start_main_p3 v_b_22_1) 0) (= (+ c_ULTIMATE.start_malloc_ptr 1) v_b_23_1) (<= (- v_b_13_1 v_b_17_1) 0) (= (+ v_b_12_1 1) (+ c_ULTIMATE.start_malloc_ptr 1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_12_1)) 0) (<= (- (- v_b_12_1) (- v_b_16_1)) 0) (<= (- (- v_b_17_1) (- v_b_23_1)) 0) (<= (- c_ULTIMATE.start_malloc_ptr v_b_23_1) (- 1)) (<= (- v_v_27_1 (- v_v_33_1)) 1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_22_1)) 0) (<= (- (- v_v_33_1) v_v_42_1) (- 1)) (<= (- (- v_v_27_1) v_v_33_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_p3) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= (- (- v_b_16_1) (- v_b_17_1)) 1) (<= (- (- v_b_22_1) (- v_b_23_1)) 1) (<= (- c_ULTIMATE.start_malloc_ptr v_b_12_1) 0) (= (+ c_ULTIMATE.start_malloc_ptr 1) v_b_17_1) (or (< v_idx_19 v_b_22_1) (= (select |c_#memory_int| v_idx_19) v_v_42_1) (<= v_b_23_1 v_idx_19)) (<= (- (- v_v_27_1) v_v_27_1) 0))))} [2019-01-07 14:56:07,496 WARN L228 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; [2019-01-07 14:56:07,497 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p1 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p1) 1))) [2019-01-07 14:56:07,498 WARN L230 ngHoareTripleChecker]: Post: {2147483644#(forall ((v_idx_36 Int) (v_idx_37 Int) (v_idx_34 Int) (v_idx_35 Int) (v_idx_32 Int) (v_idx_33 Int) (v_idx_30 Int) (v_idx_31 Int) (v_idx_29 Int) (v_idx_38 Int) (v_idx_28 Int)) (exists ((v_v_46_1 Int) (v_v_45_1 Int) (v_v_34_1 Int) (v_v_33_1 Int) (v_v_44_1 Int) (v_v_32_1 Int) (v_v_28_1 Int) (v_v_26_1 Int) (v_v_27_1 Int) (v_b_12_1 Int) (v_b_25_1 Int) (v_b_13_1 Int) (v_b_24_1 Int) (v_b_16_1 Int) (v_b_17_1 Int) (v_v_2_1 Int) (v_v_4_1 Int)) (and (or (= (select |c_#valid| v_idx_37) v_v_33_1) (< v_idx_37 v_b_16_1) (<= v_b_17_1 v_idx_37)) (= (+ v_b_17_1 (- 1)) (+ v_b_13_1 (- 1))) (<= (- (- v_v_33_1) v_v_33_1) (- 2)) (= c_ULTIMATE.start_main_p1 (+ v_b_25_1 (- 1))) (<= (- c_ULTIMATE.start_malloc_ptr v_b_17_1) (- 1)) (or (= (select |c_#valid| v_idx_36) v_v_32_1) (<= v_b_16_1 v_idx_36)) (or (< v_idx_30 v_b_24_1) (<= v_b_25_1 v_idx_30) (= (select |c_#memory_int| v_idx_30) v_v_45_1)) (= (+ v_b_24_1 1) (+ c_ULTIMATE.start_main_p1 1)) (or (<= v_b_24_1 v_idx_29) (= (select |c_#memory_int| v_idx_29) v_v_44_1)) (<= (- (- v_b_13_1) (- v_b_17_1)) 0) (<= (- (- v_b_12_1) (- v_b_17_1)) 1) (or (= (select |c_#valid| v_idx_38) v_v_34_1) (< v_idx_38 v_b_17_1)) (<= (- v_b_16_1 v_b_17_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_p1) (- v_b_25_1)) 1) (= (+ v_b_12_1 1) v_b_17_1) (= c_ULTIMATE.start_malloc_ptr (+ v_b_17_1 (- 1))) (<= (- c_ULTIMATE.start_main_p1 v_b_25_1) (- 1)) (<= (- v_b_24_1 v_b_25_1) (- 1)) (= (select |c_old(#memory_int)| v_idx_28) v_v_4_1) (<= (- c_ULTIMATE.start_main_p3 v_b_12_1) 0) (<= (- v_b_12_1 v_b_17_1) (- 1)) (<= (- (- v_b_24_1) (- v_b_25_1)) 1) (= (+ v_b_17_1 (- 1)) v_b_12_1) (<= (- c_ULTIMATE.start_malloc_ptr v_b_16_1) 0) (= v_b_25_1 (+ v_b_24_1 1)) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_12_1)) 0) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_13_1)) 1) (<= (- (- v_b_12_1) (- v_b_13_1)) 1) (<= (- v_v_27_1 v_v_33_1) (- 1)) (<= (- c_ULTIMATE.start_main_p3 v_b_16_1) 0) (<= (- v_b_12_1 v_b_16_1) 0) (= v_b_17_1 (+ v_b_16_1 1)) (<= (- c_ULTIMATE.start_main_p3 v_b_17_1) (- 1)) (= (+ v_b_17_1 (- 1)) v_b_16_1) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_16_1)) 0) (<= (- (- c_ULTIMATE.start_main_p3) (- v_b_17_1)) 1) (= v_v_2_1 (select |c_old(#valid)| v_idx_35)) (<= (- v_b_13_1 v_b_16_1) 1) (= v_b_17_1 v_b_13_1) (= v_b_17_1 (+ c_ULTIMATE.start_main_p3 1)) (<= (- c_ULTIMATE.start_malloc_ptr v_b_13_1) (- 1)) (<= (- c_ULTIMATE.start_main_p1 v_b_24_1) 0) (<= (- v_v_33_1 (- v_v_33_1)) 2) (<= (- (- c_ULTIMATE.start_main_p1) (- v_b_24_1)) 0) (= (+ v_b_17_1 (- 1)) c_ULTIMATE.start_main_p3) (or (< v_idx_33 v_b_12_1) (<= v_b_13_1 v_idx_33) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_33) v_v_27_1)) (<= (- v_v_27_1 (- v_v_27_1)) 0) (<= (- (- v_v_27_1) (- v_v_33_1)) 1) (<= (- c_ULTIMATE.start_main_p3 c_ULTIMATE.start_malloc_ptr) 0) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_13_1)) 1) (<= (- v_b_13_1 v_b_17_1) 0) (or (< v_idx_31 v_b_25_1) (= (select |c_#memory_int| v_idx_31) v_v_46_1)) (or (< v_idx_34 v_b_13_1) (= v_v_28_1 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_34))) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_12_1)) 0) (<= (- v_b_12_1 v_b_13_1) (- 1)) (<= (- (- v_b_12_1) (- v_b_16_1)) 0) (<= (- c_ULTIMATE.start_main_p3 v_b_13_1) (- 1)) (or (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_32) v_v_26_1) (<= v_b_12_1 v_idx_32)) (<= (- v_v_27_1 (- v_v_33_1)) 1) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_16_1)) 0) (<= (- (- v_b_13_1) (- v_b_16_1)) (- 1)) (<= (- (- c_ULTIMATE.start_malloc_ptr) (- v_b_17_1)) 1) (<= (- (- v_v_27_1) v_v_33_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_p3) (- c_ULTIMATE.start_malloc_ptr)) 0) (<= (- (- v_b_16_1) (- v_b_17_1)) 1) (= v_b_24_1 (+ v_b_25_1 (- 1))) (<= (- c_ULTIMATE.start_malloc_ptr v_b_12_1) 0) (= (+ c_ULTIMATE.start_malloc_ptr 1) v_b_17_1) (<= (- (- v_v_27_1) v_v_27_1) 0))))} [2019-01-07 14:56:07,498 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:56:08,027 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:56:08,027 WARN L269 ngHoareTripleChecker]: Simplified triple