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/20170304-DifficultPathPrograms/sum_array.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1377b90 [2019-01-07 14:32:50,826 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 14:32:50,828 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 14:32:50,840 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 14:32:50,841 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 14:32:50,842 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 14:32:50,844 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 14:32:50,846 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 14:32:50,848 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 14:32:50,849 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 14:32:50,850 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 14:32:50,850 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 14:32:50,851 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 14:32:50,852 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 14:32:50,854 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 14:32:50,855 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 14:32:50,856 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 14:32:50,858 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 14:32:50,860 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 14:32:50,862 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 14:32:50,863 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 14:32:50,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 14:32:50,868 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 14:32:50,868 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 14:32:50,868 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 14:32:50,869 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 14:32:50,870 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 14:32:50,871 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 14:32:50,872 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 14:32:50,874 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 14:32:50,874 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 14:32:50,875 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 14:32:50,875 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 14:32:50,875 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 14:32:50,877 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 14:32:50,877 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 14:32:50,878 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:32:50,894 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 14:32:50,894 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 14:32:50,896 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 14:32:50,896 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 14:32:50,896 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 14:32:50,897 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 14:32:50,897 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 14:32:50,897 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 14:32:50,897 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 14:32:50,897 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 14:32:50,899 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 14:32:50,899 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 14:32:50,899 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 14:32:50,900 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 14:32:50,900 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 14:32:50,900 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 14:32:50,900 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 14:32:50,902 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 14:32:50,902 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 14:32:50,903 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 14:32:50,903 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 14:32:50,903 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 14:32:50,903 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 14:32:50,903 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 14:32:50,904 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 14:32:50,904 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 14:32:50,904 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 14:32:50,905 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 14:32:50,905 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 14:32:50,905 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 14:32:50,905 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:32:50,906 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 14:32:50,906 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 14:32:50,907 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 14:32:50,907 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 14:32:50,907 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 14:32:50,907 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 14:32:50,907 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 14:32:50,908 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 14:32:50,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 14:32:50,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 14:32:50,985 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 14:32:50,988 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 14:32:50,988 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 14:32:50,990 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum_array.i_3.bpl [2019-01-07 14:32:50,990 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum_array.i_3.bpl' [2019-01-07 14:32:51,065 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 14:32:51,068 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 14:32:51,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 14:32:51,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 14:32:51,069 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 14:32:51,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:32:51" (1/1) ... [2019-01-07 14:32:51,104 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:32:51" (1/1) ... [2019-01-07 14:32:51,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 14:32:51,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 14:32:51,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 14:32:51,119 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 14:32:51,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:32:51" (1/1) ... [2019-01-07 14:32:51,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:32:51" (1/1) ... [2019-01-07 14:32:51,134 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:32:51" (1/1) ... [2019-01-07 14:32:51,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:32:51" (1/1) ... [2019-01-07 14:32:51,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:32:51" (1/1) ... [2019-01-07 14:32:51,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:32:51" (1/1) ... [2019-01-07 14:32:51,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:32:51" (1/1) ... [2019-01-07 14:32:51,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 14:32:51,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 14:32:51,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 14:32:51,156 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 14:32:51,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:32:51" (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:32:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 14:32:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 14:32:51,797 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 14:32:51,797 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-07 14:32:51,799 INFO L202 PluginConnector]: Adding new model sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:32:51 BoogieIcfgContainer [2019-01-07 14:32:51,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 14:32:51,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 14:32:51,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 14:32:51,804 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 14:32:51,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:32:51" (1/2) ... [2019-01-07 14:32:51,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11969aab and model type sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:32:51, skipping insertion in model container [2019-01-07 14:32:51,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum_array.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:32:51" (2/2) ... [2019-01-07 14:32:51,807 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_array.i_3.bpl [2019-01-07 14:32:51,818 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 14:32:51,827 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 14:32:51,843 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 14:32:51,876 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 14:32:51,876 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 14:32:51,876 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 14:32:51,876 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 14:32:51,876 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 14:32:51,876 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 14:32:51,877 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 14:32:51,877 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 14:32:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-01-07 14:32:51,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 14:32:51,899 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:32:51,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 14:32:51,902 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:32:51,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:32:51,909 INFO L82 PathProgramCache]: Analyzing trace with hash 28790250, now seen corresponding path program 1 times [2019-01-07 14:32:51,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:32:51,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:32:51,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:32:51,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:32:51,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:32:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:32:52,259 INFO L273 TraceCheckUtils]: 0: Hoare triple {11#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~nondet4, main_#t~post3, main_#t~post5, main_#t~post6, main_~M~6, main_~A~6, main_~B~6, main_~C~6, main_~i~6;main_~M~6 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~A~6;havoc main_~B~6;havoc main_~C~6;havoc main_~i~6;main_~i~6 := 0; {13#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 14:32:52,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {13#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {14#(<= ULTIMATE.start_main_~M~6 (* 4294967296 (div ULTIMATE.start_main_~M~6 4294967296)))} is VALID [2019-01-07 14:32:52,290 INFO L273 TraceCheckUtils]: 2: Hoare triple {14#(<= ULTIMATE.start_main_~M~6 (* 4294967296 (div ULTIMATE.start_main_~M~6 4294967296)))} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {14#(<= ULTIMATE.start_main_~M~6 (* 4294967296 (div ULTIMATE.start_main_~M~6 4294967296)))} is VALID [2019-01-07 14:32:52,300 INFO L273 TraceCheckUtils]: 3: Hoare triple {14#(<= ULTIMATE.start_main_~M~6 (* 4294967296 (div ULTIMATE.start_main_~M~6 4294967296)))} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0;assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~C~6[main_~i~6 % 4294967296] == main_~A~6[main_~i~6 % 4294967296] + main_~B~6[main_~i~6 % 4294967296] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {12#false} is VALID [2019-01-07 14:32:52,300 INFO L273 TraceCheckUtils]: 4: Hoare triple {12#false} assume !false; {12#false} is VALID [2019-01-07 14:32:52,303 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:32:52,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:32:52,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-07 14:32:52,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:32:52,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-07 14:32:52,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:32:52,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 14:32:52,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:32:52,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 14:32:52,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 14:32:52,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 14:32:52,359 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2019-01-07 14:32:52,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:32:52,836 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. [2019-01-07 14:32:52,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 14:32:52,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-07 14:32:52,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:32:52,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:32:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-01-07 14:32:52,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:32:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2019-01-07 14:32:52,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2019-01-07 14:32:53,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:32:53,044 INFO L225 Difference]: With dead ends: 17 [2019-01-07 14:32:53,044 INFO L226 Difference]: Without dead ends: 9 [2019-01-07 14:32:53,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-07 14:32:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-07 14:32:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-07 14:32:53,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:32:53,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-01-07 14:32:53,265 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-01-07 14:32:53,265 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-01-07 14:32:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:32:53,268 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-01-07 14:32:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-01-07 14:32:53,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:32:53,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:32:53,269 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-01-07 14:32:53,269 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-01-07 14:32:53,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:32:53,271 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-01-07 14:32:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-01-07 14:32:53,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:32:53,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:32:53,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:32:53,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:32:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-07 14:32:53,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2019-01-07 14:32:53,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 5 [2019-01-07 14:32:53,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:32:53,281 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2019-01-07 14:32:53,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 14:32:53,282 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2019-01-07 14:32:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 14:32:53,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:32:53,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-07 14:32:53,283 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:32:53,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:32:53,284 INFO L82 PathProgramCache]: Analyzing trace with hash 266557342, now seen corresponding path program 1 times [2019-01-07 14:32:53,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:32:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:32:53,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:32:53,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:32:53,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:32:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:32:54,053 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 5 [2019-01-07 14:32:54,289 INFO L273 TraceCheckUtils]: 0: Hoare triple {82#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~nondet4, main_#t~post3, main_#t~post5, main_#t~post6, main_~M~6, main_~A~6, main_~B~6, main_~C~6, main_~i~6;main_~M~6 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~A~6;havoc main_~B~6;havoc main_~C~6;havoc main_~i~6;main_~i~6 := 0; {84#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 14:32:54,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {84#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~A~6 := main_~A~6[main_~i~6 % 4294967296 := main_#t~nondet2];havoc main_#t~nondet2;assume !!(main_~A~6[main_~i~6 % 4294967296] <= 1000000);main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {82#true} is VALID [2019-01-07 14:32:54,290 INFO L273 TraceCheckUtils]: 2: Hoare triple {82#true} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {82#true} is VALID [2019-01-07 14:32:54,290 INFO L273 TraceCheckUtils]: 3: Hoare triple {82#true} assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);assume -2147483648 <= main_#t~nondet4 && main_#t~nondet4 <= 2147483647;main_~B~6 := main_~B~6[main_~i~6 % 4294967296 := main_#t~nondet4];havoc main_#t~nondet4;assume !!(main_~B~6[main_~i~6 % 4294967296] <= 1000000);main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 + 1;havoc main_#t~post3; {82#true} is VALID [2019-01-07 14:32:54,293 INFO L273 TraceCheckUtils]: 4: Hoare triple {82#true} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0; {85#(= ULTIMATE.start_main_~i~6 (* 4294967296 (div ULTIMATE.start_main_~i~6 4294967296)))} is VALID [2019-01-07 14:32:54,310 INFO L273 TraceCheckUtils]: 5: Hoare triple {85#(= ULTIMATE.start_main_~i~6 (* 4294967296 (div ULTIMATE.start_main_~i~6 4294967296)))} assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~C~6 := main_~C~6[main_~i~6 % 4294967296 := main_~A~6[main_~i~6 % 4294967296] + main_~B~6[main_~i~6 % 4294967296]];main_#t~post5 := main_~i~6;main_~i~6 := main_#t~post5 + 1;havoc main_#t~post5; {86#(= (select ULTIMATE.start_main_~C~6 0) (+ (select ULTIMATE.start_main_~B~6 0) (select ULTIMATE.start_main_~A~6 0)))} is VALID [2019-01-07 14:32:54,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {86#(= (select ULTIMATE.start_main_~C~6 0) (+ (select ULTIMATE.start_main_~B~6 0) (select ULTIMATE.start_main_~A~6 0)))} assume !(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);main_~i~6 := 0;assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~C~6[main_~i~6 % 4294967296] == main_~A~6[main_~i~6 % 4294967296] + main_~B~6[main_~i~6 % 4294967296] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {83#false} is VALID [2019-01-07 14:32:54,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {83#false} assume !false; {83#false} is VALID [2019-01-07 14:32:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 14:32:54,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:32:54,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:32:54,329 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-07 14:32:54,332 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [19], [21], [23] [2019-01-07 14:32:54,416 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 14:32:54,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:32:54,585 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-01-07 14:33:06,175 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-07 14:33:06,175 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-07 14:33:06,176 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:33:06,176 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:33:06,177 WARN L224 ngHoareTripleChecker]: Pre: {2147483623#(or (forall ((v_idx_116 Int) (v_idx_119 Int) (v_idx_117 Int) (v_idx_118 Int) (v_idx_120 Int)) (exists ((v_v_13_1 Int) (v_v_8_1 Int) (v_v_14_1 Int) (v_v_12_1 Int) (v_b_2_1 Int) (v_b_3_1 Int) (v_v_7_1 Int)) (and (= (+ v_b_3_1 (- 1)) (+ (- c_ULTIMATE.start_main_~i~6) 1)) (= (select c_ULTIMATE.start_main_~B~6 v_idx_116) v_v_7_1) (<= (- v_b_2_1 (- v_b_3_1)) 1) (or (<= v_b_3_1 v_idx_119) (< v_idx_119 v_b_2_1) (= (select c_ULTIMATE.start_main_~A~6 v_idx_119) v_v_13_1)) (= c_ULTIMATE.start_main_~i~6 1) (<= (- (- c_ULTIMATE.start_main_~i~6) c_ULTIMATE.start_main_~i~6) (- 2)) (<= (- v_b_2_1 (- v_v_13_1)) 1000000) (= 1 (+ (- c_ULTIMATE.start_main_~i~6) 2)) (<= (- (- c_ULTIMATE.start_main_~i~6) v_b_3_1) (- 2)) (<= (- (- v_b_2_1) v_b_3_1) (- 1)) (= (+ c_ULTIMATE.start_main_~i~6 (- 1)) (+ v_b_3_1 (- 1))) (<= (- v_b_3_1 (- v_b_3_1)) 2) (<= (- v_b_2_1 (- v_b_2_1)) 0) (= (+ (- v_b_3_1) 1) (+ v_b_3_1 (- 1))) (<= (- v_v_13_1 (- v_v_13_1)) 2000000) (<= (- (- v_b_2_1) (- v_v_13_1)) 1000000) (<= (- c_ULTIMATE.start_main_~i~6 v_b_2_1) 1) (<= (- (- c_ULTIMATE.start_main_~i~6) (- v_v_13_1)) 999999) (<= (- c_ULTIMATE.start_main_~i~6 v_b_3_1) 0) (<= (- (- v_b_2_1) (- v_b_3_1)) 1) (<= (- c_ULTIMATE.start_main_~i~6 (- c_ULTIMATE.start_main_~i~6)) 2) (<= (- c_ULTIMATE.start_main_~i~6 (- v_v_13_1)) 1000001) (<= (- v_b_3_1 (- v_v_13_1)) 1000001) (or (<= v_b_2_1 v_idx_118) (= (select c_ULTIMATE.start_main_~A~6 v_idx_118) v_v_12_1)) (<= (- v_b_2_1 v_b_3_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_~i~6) v_b_2_1) (- 1)) (= 1 (+ (- v_b_2_1) 1)) (<= (- (- c_ULTIMATE.start_main_~i~6) (- v_b_3_1)) 0) (<= (- (- v_b_3_1) v_b_3_1) (- 2)) (<= (- (- v_b_3_1) (- v_v_13_1)) 999999) (= v_b_2_1 (+ v_b_3_1 (- 1))) (or (< v_idx_120 v_b_3_1) (= (select c_ULTIMATE.start_main_~A~6 v_idx_120) v_v_14_1)) (<= (- (- v_b_2_1) v_b_2_1) 0) (= 0 (+ v_b_3_1 (- 1))) (= v_v_8_1 (select c_ULTIMATE.start_main_~C~6 v_idx_117)) (= (+ v_b_2_1 1) 1) (<= (- (- c_ULTIMATE.start_main_~i~6) (- v_b_2_1)) (- 1)) (<= (- c_ULTIMATE.start_main_~i~6 (- v_b_3_1)) 2) (<= (- c_ULTIMATE.start_main_~i~6 (- v_b_2_1)) 1) (= 1 v_b_3_1)))) (forall ((v_idx_122 Int) (v_idx_123 Int) (v_idx_121 Int)) (exists ((v_v_222_1 Int) (v_v_223_1 Int) (v_v_224_1 Int)) (and (<= (- (- c_ULTIMATE.start_main_~i~6) c_ULTIMATE.start_main_~i~6) 0) (= v_v_223_1 (select c_ULTIMATE.start_main_~C~6 v_idx_122)) (= (select c_ULTIMATE.start_main_~A~6 v_idx_123) v_v_224_1) (= v_v_222_1 (select c_ULTIMATE.start_main_~B~6 v_idx_121)) (<= (- c_ULTIMATE.start_main_~i~6 (- c_ULTIMATE.start_main_~i~6)) 4)))))} [2019-01-07 14:33:06,177 WARN L228 ngHoareTripleChecker]: Action: assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~A~6 := main_~A~6[main_~i~6 % 4294967296 := main_#t~nondet2];havoc main_#t~nondet2;assume !!(main_~A~6[main_~i~6 % 4294967296] <= 1000000);main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; [2019-01-07 14:33:06,178 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (<= 0 (+ |c_ULTIMATE.start_main_#t~nondet2| 2147483648)) (<= |c_ULTIMATE.start_main_#t~nondet2| 2147483647) (< (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod c_ULTIMATE.start_main_~M~6 4294967296)) (<= (select c_ULTIMATE.start_main_~A~6_primed (mod c_ULTIMATE.start_main_~i~6 4294967296)) 1000000) (= c_ULTIMATE.start_main_~A~6_primed (store c_ULTIMATE.start_main_~A~6 (mod c_ULTIMATE.start_main_~i~6 4294967296) |c_ULTIMATE.start_main_#t~nondet2|)) (= (+ c_ULTIMATE.start_main_~i~6 1) c_ULTIMATE.start_main_~i~6_primed)) [2019-01-07 14:33:06,178 WARN L230 ngHoareTripleChecker]: Post: {2147483622#(forall ((v_idx_126 Int) (v_idx_127 Int) (v_idx_124 Int) (v_idx_125 Int) (v_idx_128 Int)) (exists ((v_v_222_1 Int) (v_v_462_1 Int) (v_v_223_1 Int) (v_b_39_1 Int) (v_b_38_1 Int) (v_v_460_1 Int) (v_v_461_1 Int)) (and (<= (- c_ULTIMATE.start_main_~i~6 v_b_38_1) 3) (<= (- c_ULTIMATE.start_main_~i~6 (- v_v_461_1)) 1000003) (<= (- v_b_38_1 (- v_b_39_1)) 5) (<= (- (- c_ULTIMATE.start_main_~i~6) (- v_b_39_1)) 2) (or (<= v_b_39_1 v_idx_127) (< v_idx_127 v_b_38_1) (= (select c_ULTIMATE.start_main_~A~6 v_idx_127) v_v_461_1)) (<= (- (- c_ULTIMATE.start_main_~i~6) v_b_39_1) (- 2)) (<= (- v_v_461_1 (- v_v_461_1)) 2000000) (<= (- (- c_ULTIMATE.start_main_~i~6) c_ULTIMATE.start_main_~i~6) (- 2)) (<= (- v_b_39_1 (- v_v_461_1)) 1000003) (<= (- (- v_b_39_1) (- v_v_461_1)) 999999) (<= (- (- v_b_38_1) v_b_39_1) (- 1)) (<= (- (- v_b_38_1) (- v_b_39_1)) 3) (<= (- (- v_b_38_1) v_b_38_1) 0) (<= (- (- v_b_38_1) (- v_v_461_1)) 1000000) (<= (- (- c_ULTIMATE.start_main_~i~6) v_b_38_1) (- 1)) (<= (- c_ULTIMATE.start_main_~i~6 v_b_39_1) 2) (= (select c_ULTIMATE.start_main_~B~6 v_idx_124) v_v_222_1) (<= (- (- c_ULTIMATE.start_main_~i~6) (- v_b_38_1)) 1) (<= (- c_ULTIMATE.start_main_~i~6 (- v_b_39_1)) 6) (<= (- c_ULTIMATE.start_main_~i~6 (- c_ULTIMATE.start_main_~i~6)) 6) (<= (- v_b_38_1 (- v_v_461_1)) 1000002) (<= (- (- v_b_39_1) v_b_39_1) (- 2)) (<= (- v_b_38_1 v_b_39_1) 1) (<= (- v_b_38_1 (- v_b_38_1)) 4) (<= (- (- c_ULTIMATE.start_main_~i~6) (- v_v_461_1)) 999999) (<= (- v_b_39_1 (- v_b_39_1)) 6) (= (select c_ULTIMATE.start_main_~C~6 v_idx_125) v_v_223_1) (<= (- c_ULTIMATE.start_main_~i~6 (- v_b_38_1)) 5) (or (<= v_b_38_1 v_idx_126) (= v_v_460_1 (select c_ULTIMATE.start_main_~A~6 v_idx_126))) (or (= v_v_462_1 (select c_ULTIMATE.start_main_~A~6 v_idx_128)) (< v_idx_128 v_b_39_1)))))} [2019-01-07 14:33:06,178 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:33:06,222 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:33:06,222 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:33:06,522 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 26 [2019-01-07 14:33:06,522 WARN L270 ngHoareTripleChecker]: Pre: {2147483623#(forall ((v_idx_122 Int) (v_idx_123 Int) (v_idx_121 Int)) (exists ((v_v_222_1 Int) (v_v_223_1 Int) (v_v_224_1 Int)) (and (<= (- (- ULTIMATE.start_main_~i~6) ULTIMATE.start_main_~i~6) 0) (= v_v_223_1 (select ULTIMATE.start_main_~C~6 v_idx_122)) (= (select ULTIMATE.start_main_~A~6 v_idx_123) v_v_224_1) (= v_v_222_1 (select ULTIMATE.start_main_~B~6 v_idx_121)) (<= (- ULTIMATE.start_main_~i~6 (- ULTIMATE.start_main_~i~6)) 4))))} [2019-01-07 14:33:06,523 WARN L274 ngHoareTripleChecker]: Action: assume !!(main_~i~6 % 4294967296 < main_~M~6 % 4294967296);assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~A~6 := main_~A~6[main_~i~6 % 4294967296 := main_#t~nondet2];havoc main_#t~nondet2;assume !!(main_~A~6[main_~i~6 % 4294967296] <= 1000000);main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; [2019-01-07 14:33:06,524 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (<= 0 (+ |c_ULTIMATE.start_main_#t~nondet2| 2147483648)) (<= |c_ULTIMATE.start_main_#t~nondet2| 2147483647) (< (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod c_ULTIMATE.start_main_~M~6 4294967296)) (<= (select c_ULTIMATE.start_main_~A~6_primed (mod c_ULTIMATE.start_main_~i~6 4294967296)) 1000000) (= c_ULTIMATE.start_main_~A~6_primed (store c_ULTIMATE.start_main_~A~6 (mod c_ULTIMATE.start_main_~i~6 4294967296) |c_ULTIMATE.start_main_#t~nondet2|)) (= (+ c_ULTIMATE.start_main_~i~6 1) c_ULTIMATE.start_main_~i~6_primed))