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/n.c11.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-824f902 [2018-12-19 12:25:33,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-19 12:25:33,015 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-19 12:25:33,028 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-19 12:25:33,029 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-19 12:25:33,030 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-19 12:25:33,031 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-19 12:25:33,033 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-19 12:25:33,035 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-19 12:25:33,036 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-19 12:25:33,037 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-19 12:25:33,038 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-19 12:25:33,038 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-19 12:25:33,039 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-19 12:25:33,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-19 12:25:33,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-19 12:25:33,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-19 12:25:33,045 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-19 12:25:33,047 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-19 12:25:33,049 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-19 12:25:33,050 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-19 12:25:33,051 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-19 12:25:33,054 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-19 12:25:33,055 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-19 12:25:33,055 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-19 12:25:33,056 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-19 12:25:33,057 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-19 12:25:33,058 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-19 12:25:33,059 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-19 12:25:33,060 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-19 12:25:33,060 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-19 12:25:33,061 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-19 12:25:33,062 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-19 12:25:33,062 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-19 12:25:33,063 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-19 12:25:33,064 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-19 12:25:33,064 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 [2018-12-19 12:25:33,089 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-19 12:25:33,089 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-19 12:25:33,090 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-19 12:25:33,093 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-19 12:25:33,094 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-19 12:25:33,094 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-19 12:25:33,094 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-19 12:25:33,094 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-19 12:25:33,094 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-19 12:25:33,095 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-19 12:25:33,095 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-19 12:25:33,095 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-19 12:25:33,095 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-19 12:25:33,097 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-19 12:25:33,097 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-19 12:25:33,097 INFO L133 SettingsManager]: * Use SBE=true [2018-12-19 12:25:33,097 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-19 12:25:33,098 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-19 12:25:33,098 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-19 12:25:33,098 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-19 12:25:33,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-19 12:25:33,098 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-19 12:25:33,100 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-19 12:25:33,101 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-19 12:25:33,101 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-19 12:25:33,101 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-19 12:25:33,101 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-19 12:25:33,102 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-19 12:25:33,102 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-19 12:25:33,102 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-19 12:25:33,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-19 12:25:33,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-19 12:25:33,103 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-19 12:25:33,103 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-19 12:25:33,103 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-19 12:25:33,103 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-19 12:25:33,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-19 12:25:33,104 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-19 12:25:33,104 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-19 12:25:33,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-19 12:25:33,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-19 12:25:33,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-19 12:25:33,186 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-19 12:25:33,187 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-19 12:25:33,188 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl [2018-12-19 12:25:33,188 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/n.c11.i_3.bpl' [2018-12-19 12:25:33,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-19 12:25:33,246 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-19 12:25:33,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-19 12:25:33,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-19 12:25:33,248 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-19 12:25:33,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:25:33" (1/1) ... [2018-12-19 12:25:33,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:25:33" (1/1) ... [2018-12-19 12:25:33,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-19 12:25:33,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-19 12:25:33,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-19 12:25:33,295 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-19 12:25:33,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:25:33" (1/1) ... [2018-12-19 12:25:33,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:25:33" (1/1) ... [2018-12-19 12:25:33,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:25:33" (1/1) ... [2018-12-19 12:25:33,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:25:33" (1/1) ... [2018-12-19 12:25:33,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:25:33" (1/1) ... [2018-12-19 12:25:33,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:25:33" (1/1) ... [2018-12-19 12:25:33,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:25:33" (1/1) ... [2018-12-19 12:25:33,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-19 12:25:33,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-19 12:25:33,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-19 12:25:33,321 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-19 12:25:33,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:25:33" (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 [2018-12-19 12:25:33,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-19 12:25:33,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-19 12:25:33,641 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-19 12:25:33,642 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-19 12:25:33,643 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:25:33 BoogieIcfgContainer [2018-12-19 12:25:33,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-19 12:25:33,644 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-19 12:25:33,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-19 12:25:33,651 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-19 12:25:33,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 19.12 12:25:33" (1/2) ... [2018-12-19 12:25:33,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@714d4069 and model type n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:25:33, skipping insertion in model container [2018-12-19 12:25:33,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:25:33" (2/2) ... [2018-12-19 12:25:33,655 INFO L112 eAbstractionObserver]: Analyzing ICFG n.c11.i_3.bpl [2018-12-19 12:25:33,667 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-19 12:25:33,677 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-19 12:25:33,697 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-19 12:25:33,734 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-19 12:25:33,735 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-19 12:25:33,735 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-19 12:25:33,735 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-19 12:25:33,736 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-19 12:25:33,736 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-19 12:25:33,736 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-19 12:25:33,736 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-19 12:25:33,755 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-19 12:25:33,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-19 12:25:33,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:25:33,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-19 12:25:33,773 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:25:33,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:25:33,781 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-19 12:25:33,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:25:33,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:25:33,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:25:33,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:25:33,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:25:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:25:34,221 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2018-12-19 12:25:34,246 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {11#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:25:34,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10#false} is VALID [2018-12-19 12:25:34,253 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !false; {10#false} is VALID [2018-12-19 12:25:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:25:34,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-19 12:25:34,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-19 12:25:34,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-19 12:25:34,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-19 12:25:34,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:25:34,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-19 12:25:34,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:25:34,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-19 12:25:34,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-19 12:25:34,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 12:25:34,326 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-19 12:25:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:25:34,423 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-19 12:25:34,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-19 12:25:34,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-19 12:25:34,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:25:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:25:34,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-19 12:25:34,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-19 12:25:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-12-19 12:25:34,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2018-12-19 12:25:34,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:25:34,479 INFO L225 Difference]: With dead ends: 9 [2018-12-19 12:25:34,479 INFO L226 Difference]: Without dead ends: 5 [2018-12-19 12:25:34,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-19 12:25:34,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-19 12:25:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-19 12:25:34,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:25:34,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2018-12-19 12:25:34,578 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-19 12:25:34,578 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-19 12:25:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:25:34,580 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-19 12:25:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-19 12:25:34,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:25:34,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:25:34,581 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2018-12-19 12:25:34,581 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2018-12-19 12:25:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:25:34,583 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2018-12-19 12:25:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-19 12:25:34,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:25:34,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:25:34,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:25:34,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:25:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-19 12:25:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-19 12:25:34,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-19 12:25:34,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:25:34,588 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-19 12:25:34,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-19 12:25:34,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-19 12:25:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-19 12:25:34,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:25:34,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-19 12:25:34,590 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:25:34,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:25:34,590 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-19 12:25:34,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:25:34,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:25:34,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:25:34,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:25:34,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:25:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:25:35,079 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-19 12:25:35,124 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {47#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:25:35,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {48#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-19 12:25:35,152 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 1))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2018-12-19 12:25:35,153 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-12-19 12:25:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:25:35,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:25:35,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:25:35,156 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-19 12:25:35,158 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-19 12:25:35,259 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-19 12:25:35,260 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-19 12:25:35,368 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-19 12:25:43,077 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2018-12-19 12:25:43,078 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2018-12-19 12:25:43,078 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:25:43,079 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:25:43,079 WARN L224 ngHoareTripleChecker]: Pre: {2147483637#(or (and (<= (- (- c_ULTIMATE.start_main_~len~5) c_ULTIMATE.start_main_~len~5) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- c_ULTIMATE.start_main_~len~5)) 0)) (exists ((v_v_4_1 Int) (v_b_0_1 Int) (v_b_1_1 Int)) (and (<= (- v_b_0_1 (- v_b_1_1)) 1) (forall ((v_idx_12 Int) (v_idx_10 Int) (v_idx_11 Int)) (or (<= v_b_1_1 v_idx_11) (< v_idx_11 v_b_0_1) (and (<= (- (- (select c_ULTIMATE.start_main_~a~5 v_idx_11)) (select c_ULTIMATE.start_main_~a~5 v_idx_11)) 0) (<= (- c_ULTIMATE.start_main_~len~5 (select c_ULTIMATE.start_main_~a~5 v_idx_11)) 1) (<= (- c_ULTIMATE.start_main_~len~5 (- (select c_ULTIMATE.start_main_~a~5 v_idx_11))) 1) (<= (- (- c_ULTIMATE.start_main_~len~5) (select c_ULTIMATE.start_main_~a~5 v_idx_11)) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) (- (select c_ULTIMATE.start_main_~a~5 v_idx_11))) (- 1)) (<= (- v_b_1_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_11))) 1) (<= (- (select c_ULTIMATE.start_main_~a~5 v_idx_11) (- (select c_ULTIMATE.start_main_~a~5 v_idx_11))) 0) (<= (- (- v_b_0_1) (select c_ULTIMATE.start_main_~a~5 v_idx_11)) 0) (<= (- v_b_0_1 (select c_ULTIMATE.start_main_~a~5 v_idx_11)) 0) (<= (- v_b_1_1 (select c_ULTIMATE.start_main_~a~5 v_idx_11)) 1) (<= (- (- v_b_1_1) (select c_ULTIMATE.start_main_~a~5 v_idx_11)) (- 1)) (<= (- (- v_b_0_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_11))) 0) (<= (- v_b_0_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_11))) 0) (<= (- (- v_b_1_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_11))) (- 1))) (<= v_b_0_1 v_idx_10) (< v_idx_12 v_b_1_1))) (<= (- (- v_b_0_1) v_b_1_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) c_ULTIMATE.start_main_~len~5) (- 2)) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_v_4_1)) (- 1)) (<= (- v_b_1_1 (- v_v_4_1)) 1) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_0_1)) 1) (<= (- (- v_b_0_1) v_v_4_1) 0) (<= (- v_b_1_1 (- v_b_1_1)) 2) (<= (- c_ULTIMATE.start_main_~len~5 v_b_0_1) 1) (<= (- v_b_1_1 v_v_4_1) 1) (<= (- (- v_b_0_1) (- v_b_1_1)) 1) (<= (- v_b_0_1 (- v_v_4_1)) 0) (<= (- (- v_b_1_1) (- v_v_4_1)) (- 1)) (<= (- (- v_b_1_1) v_b_1_1) (- 2)) (<= (- v_b_0_1 v_b_1_1) (- 1)) (<= (- (- v_v_4_1) v_v_4_1) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_1_1)) 2) (<= (- c_ULTIMATE.start_main_~len~5 v_v_4_1) 1) (<= (- c_ULTIMATE.start_main_~len~5 (- v_v_4_1)) 1) (<= (- (- c_ULTIMATE.start_main_~len~5) v_v_4_1) (- 1)) (<= (- v_b_0_1 (- v_b_0_1)) 0) (<= (- c_ULTIMATE.start_main_~len~5 v_b_1_1) 0) (<= (- (- v_b_0_1) v_b_0_1) 0) (<= (- v_v_4_1 (- v_v_4_1)) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_1_1) (- 2)) (<= (- v_b_0_1 v_v_4_1) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- c_ULTIMATE.start_main_~len~5)) 2) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_0_1)) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_0_1) (- 1)) (<= (- (- v_b_1_1) v_v_4_1) (- 1)) (<= (- (- v_b_0_1) (- v_v_4_1)) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_1_1)) 0))))} [2018-12-19 12:25:43,080 WARN L228 ngHoareTripleChecker]: Action: assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; [2018-12-19 12:25:43,080 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (= 4 (mod c_ULTIMATE.start_main_~len~5 4294967296))) (= c_ULTIMATE.start_main_~a~5_primed (store c_ULTIMATE.start_main_~a~5 (mod c_ULTIMATE.start_main_~len~5 4294967296) 0)) (not (= 0 (mod |c_ULTIMATE.start_main_#t~nondet0| 256))) (= (+ c_ULTIMATE.start_main_~len~5 1) c_ULTIMATE.start_main_~len~5_primed)) [2018-12-19 12:25:43,081 WARN L230 ngHoareTripleChecker]: Post: {2147483636#(or (exists ((v_v_56_1 Int) (v_b_4_1 Int) (v_b_5_1 Int)) (and (<= (- c_ULTIMATE.start_main_~len~5 v_v_56_1) 1) (<= (- c_ULTIMATE.start_main_~len~5 v_b_4_1) 1) (<= (- v_b_5_1 v_v_56_1) 1) (<= (- (- c_ULTIMATE.start_main_~len~5) c_ULTIMATE.start_main_~len~5) (- 2)) (<= (- v_b_5_1 (- v_v_56_1)) 1) (<= (- c_ULTIMATE.start_main_~len~5 v_b_5_1) 0) (<= (- v_v_56_1 (- v_v_56_1)) 0) (<= (- (- v_b_5_1) v_v_56_1) (- 1)) (<= (- (- v_b_4_1) (- v_b_5_1)) 1) (<= (- v_b_4_1 (- v_b_4_1)) 0) (<= (- v_b_5_1 (- v_b_5_1)) 2) (<= (- v_b_4_1 v_b_5_1) (- 1)) (<= (- (- v_v_56_1) v_v_56_1) 0) (forall ((v_idx_14 Int) (v_idx_15 Int) (v_idx_13 Int)) (or (and (<= (- c_ULTIMATE.start_main_~len~5 (select c_ULTIMATE.start_main_~a~5 v_idx_14)) 1) (<= (- v_b_5_1 (select c_ULTIMATE.start_main_~a~5 v_idx_14)) 1) (<= (- (- (select c_ULTIMATE.start_main_~a~5 v_idx_14)) (select c_ULTIMATE.start_main_~a~5 v_idx_14)) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- (select c_ULTIMATE.start_main_~a~5 v_idx_14))) 1) (<= (- (- v_b_4_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_14))) 0) (<= (- (- v_b_4_1) (select c_ULTIMATE.start_main_~a~5 v_idx_14)) 0) (<= (- v_b_4_1 (select c_ULTIMATE.start_main_~a~5 v_idx_14)) 0) (<= (- v_b_5_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_14))) 1) (<= (- v_b_4_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_14))) 0) (<= (- (select c_ULTIMATE.start_main_~a~5 v_idx_14) (- (select c_ULTIMATE.start_main_~a~5 v_idx_14))) 0) (<= (- (- v_b_5_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_14))) (- 1)) (<= (- (- v_b_5_1) (select c_ULTIMATE.start_main_~a~5 v_idx_14)) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) (select c_ULTIMATE.start_main_~a~5 v_idx_14)) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) (- (select c_ULTIMATE.start_main_~a~5 v_idx_14))) (- 1))) (< v_idx_15 v_b_5_1) (<= v_b_4_1 v_idx_13) (< v_idx_14 v_b_4_1) (<= v_b_5_1 v_idx_14))) (<= (- c_ULTIMATE.start_main_~len~5 (- v_v_56_1)) 1) (<= (- (- v_b_4_1) (- v_v_56_1)) 0) (<= (- (- v_b_5_1) v_b_5_1) (- 2)) (<= (- (- v_b_4_1) v_v_56_1) 0) (<= (- v_b_4_1 v_v_56_1) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_4_1) (- 1)) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_5_1)) 2) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_5_1)) 0) (<= (- (- v_b_4_1) v_b_4_1) 0) (<= (- v_b_4_1 (- v_v_56_1)) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_4_1)) 1) (<= (- (- v_b_4_1) v_b_5_1) (- 1)) (<= (- c_ULTIMATE.start_main_~len~5 (- c_ULTIMATE.start_main_~len~5)) 2) (<= (- v_b_4_1 (- v_b_5_1)) 1) (<= (- (- v_b_5_1) (- v_v_56_1)) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_4_1)) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) v_v_56_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_v_56_1)) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_5_1) (- 2)))) (exists ((v_b_7_1 Int) (v_v_4_1 Int) (v_b_0_1 Int)) (and (<= (- (- c_ULTIMATE.start_main_~len~5) v_v_4_1) (- 2)) (<= (- c_ULTIMATE.start_main_~len~5 v_b_7_1) 0) (<= (- v_b_0_1 v_b_7_1) (- 2)) (<= (- (- c_ULTIMATE.start_main_~len~5) c_ULTIMATE.start_main_~len~5) (- 4)) (<= (- (- v_b_0_1) v_b_7_1) (- 2)) (<= (- c_ULTIMATE.start_main_~len~5 (- c_ULTIMATE.start_main_~len~5)) 4) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_7_1)) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_0_1) (- 2)) (<= (- c_ULTIMATE.start_main_~len~5 v_v_4_1) 2) (<= (- (- v_b_0_1) (- v_b_7_1)) 2) (<= (- (- v_b_0_1) v_v_4_1) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_7_1)) 4) (<= (- v_b_7_1 (- v_b_7_1)) 4) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_v_4_1)) (- 2)) (<= (- v_b_0_1 (- v_v_4_1)) 0) (<= (- c_ULTIMATE.start_main_~len~5 v_b_0_1) 2) (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_7_1) (- 4)) (<= (- v_b_0_1 (- v_b_7_1)) 2) (<= (- (- v_v_4_1) v_v_4_1) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- v_v_4_1)) 2) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_0_1)) (- 2)) (<= (- (- v_b_7_1) v_b_7_1) (- 4)) (<= (- v_b_7_1 v_v_4_1) 2) (<= (- v_b_7_1 (- v_v_4_1)) 2) (<= (- v_b_0_1 (- v_b_0_1)) 0) (<= (- (- v_b_7_1) v_v_4_1) (- 2)) (<= (- (- v_b_7_1) (- v_v_4_1)) (- 2)) (<= (- (- v_b_0_1) v_b_0_1) 0) (<= (- v_v_4_1 (- v_v_4_1)) 0) (<= (- v_b_0_1 v_v_4_1) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_0_1)) 2) (<= (- (- v_b_0_1) (- v_v_4_1)) 0) (forall ((v_idx_18 Int) (v_idx_16 Int) (v_idx_17 Int)) (or (< v_idx_17 v_b_0_1) (< v_idx_18 v_b_7_1) (<= v_b_0_1 v_idx_16) (<= v_b_7_1 v_idx_17) (and (<= (- (- c_ULTIMATE.start_main_~len~5) (select c_ULTIMATE.start_main_~a~5 v_idx_17)) (- 2)) (<= (- (- (select c_ULTIMATE.start_main_~a~5 v_idx_17)) (select c_ULTIMATE.start_main_~a~5 v_idx_17)) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- (select c_ULTIMATE.start_main_~a~5 v_idx_17))) 2) (<= (- v_b_7_1 (select c_ULTIMATE.start_main_~a~5 v_idx_17)) 2) (<= (- v_b_7_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_17))) 2) (<= (- (- v_b_7_1) (select c_ULTIMATE.start_main_~a~5 v_idx_17)) (- 2)) (<= (- (- v_b_7_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_17))) (- 2)) (<= (- (select c_ULTIMATE.start_main_~a~5 v_idx_17) (- (select c_ULTIMATE.start_main_~a~5 v_idx_17))) 0) (<= (- c_ULTIMATE.start_main_~len~5 (select c_ULTIMATE.start_main_~a~5 v_idx_17)) 2) (<= (- (- v_b_0_1) (select c_ULTIMATE.start_main_~a~5 v_idx_17)) 0) (<= (- v_b_0_1 (select c_ULTIMATE.start_main_~a~5 v_idx_17)) 0) (<= (- (- v_b_0_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_17))) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) (- (select c_ULTIMATE.start_main_~a~5 v_idx_17))) (- 2)) (<= (- v_b_0_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_17))) 0)))))))} [2018-12-19 12:25:43,081 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:25:43,165 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:25:43,166 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:25:43,295 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-19 12:25:43,295 WARN L270 ngHoareTripleChecker]: Pre: {2147483637#(or (and (<= (- (- ULTIMATE.start_main_~len~5) ULTIMATE.start_main_~len~5) 0) (<= (- ULTIMATE.start_main_~len~5 (- ULTIMATE.start_main_~len~5)) 0)) (exists ((v_v_4_1 Int) (v_b_0_1 Int) (v_b_1_1 Int)) (and (<= (- v_b_0_1 (- v_b_1_1)) 1) (forall ((v_idx_12 Int) (v_idx_10 Int) (v_idx_11 Int)) (or (<= v_b_1_1 v_idx_11) (< v_idx_11 v_b_0_1) (and (<= (- (- (select ULTIMATE.start_main_~a~5 v_idx_11)) (select ULTIMATE.start_main_~a~5 v_idx_11)) 0) (<= (- ULTIMATE.start_main_~len~5 (select ULTIMATE.start_main_~a~5 v_idx_11)) 1) (<= (- ULTIMATE.start_main_~len~5 (- (select ULTIMATE.start_main_~a~5 v_idx_11))) 1) (<= (- (- ULTIMATE.start_main_~len~5) (select ULTIMATE.start_main_~a~5 v_idx_11)) (- 1)) (<= (- (- ULTIMATE.start_main_~len~5) (- (select ULTIMATE.start_main_~a~5 v_idx_11))) (- 1)) (<= (- v_b_1_1 (- (select ULTIMATE.start_main_~a~5 v_idx_11))) 1) (<= (- (select ULTIMATE.start_main_~a~5 v_idx_11) (- (select ULTIMATE.start_main_~a~5 v_idx_11))) 0) (<= (- (- v_b_0_1) (select ULTIMATE.start_main_~a~5 v_idx_11)) 0) (<= (- v_b_0_1 (select ULTIMATE.start_main_~a~5 v_idx_11)) 0) (<= (- v_b_1_1 (select ULTIMATE.start_main_~a~5 v_idx_11)) 1) (<= (- (- v_b_1_1) (select ULTIMATE.start_main_~a~5 v_idx_11)) (- 1)) (<= (- (- v_b_0_1) (- (select ULTIMATE.start_main_~a~5 v_idx_11))) 0) (<= (- v_b_0_1 (- (select ULTIMATE.start_main_~a~5 v_idx_11))) 0) (<= (- (- v_b_1_1) (- (select ULTIMATE.start_main_~a~5 v_idx_11))) (- 1))) (<= v_b_0_1 v_idx_10) (< v_idx_12 v_b_1_1))) (<= (- (- v_b_0_1) v_b_1_1) (- 1)) (<= (- (- ULTIMATE.start_main_~len~5) ULTIMATE.start_main_~len~5) (- 2)) (<= (- (- ULTIMATE.start_main_~len~5) (- v_v_4_1)) (- 1)) (<= (- v_b_1_1 (- v_v_4_1)) 1) (<= (- ULTIMATE.start_main_~len~5 (- v_b_0_1)) 1) (<= (- (- v_b_0_1) v_v_4_1) 0) (<= (- v_b_1_1 (- v_b_1_1)) 2) (<= (- ULTIMATE.start_main_~len~5 v_b_0_1) 1) (<= (- v_b_1_1 v_v_4_1) 1) (<= (- (- v_b_0_1) (- v_b_1_1)) 1) (<= (- v_b_0_1 (- v_v_4_1)) 0) (<= (- (- v_b_1_1) (- v_v_4_1)) (- 1)) (<= (- (- v_b_1_1) v_b_1_1) (- 2)) (<= (- v_b_0_1 v_b_1_1) (- 1)) (<= (- (- v_v_4_1) v_v_4_1) 0) (<= (- ULTIMATE.start_main_~len~5 (- v_b_1_1)) 2) (<= (- ULTIMATE.start_main_~len~5 v_v_4_1) 1) (<= (- ULTIMATE.start_main_~len~5 (- v_v_4_1)) 1) (<= (- (- ULTIMATE.start_main_~len~5) v_v_4_1) (- 1)) (<= (- v_b_0_1 (- v_b_0_1)) 0) (<= (- ULTIMATE.start_main_~len~5 v_b_1_1) 0) (<= (- (- v_b_0_1) v_b_0_1) 0) (<= (- v_v_4_1 (- v_v_4_1)) 0) (<= (- (- ULTIMATE.start_main_~len~5) v_b_1_1) (- 2)) (<= (- v_b_0_1 v_v_4_1) 0) (<= (- ULTIMATE.start_main_~len~5 (- ULTIMATE.start_main_~len~5)) 2) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_0_1)) (- 1)) (<= (- (- ULTIMATE.start_main_~len~5) v_b_0_1) (- 1)) (<= (- (- v_b_1_1) v_v_4_1) (- 1)) (<= (- (- v_b_0_1) (- v_v_4_1)) 0) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_1_1)) 0))))} [2018-12-19 12:25:43,296 WARN L274 ngHoareTripleChecker]: Action: assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; [2018-12-19 12:25:43,297 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (= 4 (mod c_ULTIMATE.start_main_~len~5 4294967296))) (= c_ULTIMATE.start_main_~a~5_primed (store c_ULTIMATE.start_main_~a~5 (mod c_ULTIMATE.start_main_~len~5 4294967296) 0)) (not (= 0 (mod |c_ULTIMATE.start_main_#t~nondet0| 256))) (= (+ c_ULTIMATE.start_main_~len~5 1) c_ULTIMATE.start_main_~len~5_primed)) [2018-12-19 12:25:43,366 WARN L276 ngHoareTripleChecker]: Post: {2147483636#(or (exists ((v_v_56_1 Int) (v_b_4_1 Int) (v_b_5_1 Int)) (and (<= (- ULTIMATE.start_main_~len~5 v_v_56_1) 1) (<= (- ULTIMATE.start_main_~len~5 v_b_4_1) 1) (<= (- v_b_5_1 v_v_56_1) 1) (<= (- (- ULTIMATE.start_main_~len~5) ULTIMATE.start_main_~len~5) (- 2)) (<= (- v_b_5_1 (- v_v_56_1)) 1) (<= (- ULTIMATE.start_main_~len~5 v_b_5_1) 0) (<= (- v_v_56_1 (- v_v_56_1)) 0) (<= (- (- v_b_5_1) v_v_56_1) (- 1)) (<= (- (- v_b_4_1) (- v_b_5_1)) 1) (<= (- v_b_4_1 (- v_b_4_1)) 0) (<= (- v_b_5_1 (- v_b_5_1)) 2) (<= (- v_b_4_1 v_b_5_1) (- 1)) (<= (- (- v_v_56_1) v_v_56_1) 0) (forall ((v_idx_14 Int) (v_idx_15 Int) (v_idx_13 Int)) (or (and (<= (- ULTIMATE.start_main_~len~5 (select ULTIMATE.start_main_~a~5 v_idx_14)) 1) (<= (- v_b_5_1 (select ULTIMATE.start_main_~a~5 v_idx_14)) 1) (<= (- (- (select ULTIMATE.start_main_~a~5 v_idx_14)) (select ULTIMATE.start_main_~a~5 v_idx_14)) 0) (<= (- ULTIMATE.start_main_~len~5 (- (select ULTIMATE.start_main_~a~5 v_idx_14))) 1) (<= (- (- v_b_4_1) (- (select ULTIMATE.start_main_~a~5 v_idx_14))) 0) (<= (- (- v_b_4_1) (select ULTIMATE.start_main_~a~5 v_idx_14)) 0) (<= (- v_b_4_1 (select ULTIMATE.start_main_~a~5 v_idx_14)) 0) (<= (- v_b_5_1 (- (select ULTIMATE.start_main_~a~5 v_idx_14))) 1) (<= (- v_b_4_1 (- (select ULTIMATE.start_main_~a~5 v_idx_14))) 0) (<= (- (select ULTIMATE.start_main_~a~5 v_idx_14) (- (select ULTIMATE.start_main_~a~5 v_idx_14))) 0) (<= (- (- v_b_5_1) (- (select ULTIMATE.start_main_~a~5 v_idx_14))) (- 1)) (<= (- (- v_b_5_1) (select ULTIMATE.start_main_~a~5 v_idx_14)) (- 1)) (<= (- (- ULTIMATE.start_main_~len~5) (select ULTIMATE.start_main_~a~5 v_idx_14)) (- 1)) (<= (- (- ULTIMATE.start_main_~len~5) (- (select ULTIMATE.start_main_~a~5 v_idx_14))) (- 1))) (< v_idx_15 v_b_5_1) (<= v_b_4_1 v_idx_13) (< v_idx_14 v_b_4_1) (<= v_b_5_1 v_idx_14))) (<= (- ULTIMATE.start_main_~len~5 (- v_v_56_1)) 1) (<= (- (- v_b_4_1) (- v_v_56_1)) 0) (<= (- (- v_b_5_1) v_b_5_1) (- 2)) (<= (- (- v_b_4_1) v_v_56_1) 0) (<= (- v_b_4_1 v_v_56_1) 0) (<= (- (- ULTIMATE.start_main_~len~5) v_b_4_1) (- 1)) (<= (- ULTIMATE.start_main_~len~5 (- v_b_5_1)) 2) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_5_1)) 0) (<= (- (- v_b_4_1) v_b_4_1) 0) (<= (- v_b_4_1 (- v_v_56_1)) 0) (<= (- ULTIMATE.start_main_~len~5 (- v_b_4_1)) 1) (<= (- (- v_b_4_1) v_b_5_1) (- 1)) (<= (- ULTIMATE.start_main_~len~5 (- ULTIMATE.start_main_~len~5)) 2) (<= (- v_b_4_1 (- v_b_5_1)) 1) (<= (- (- v_b_5_1) (- v_v_56_1)) (- 1)) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_4_1)) (- 1)) (<= (- (- ULTIMATE.start_main_~len~5) v_v_56_1) (- 1)) (<= (- (- ULTIMATE.start_main_~len~5) (- v_v_56_1)) (- 1)) (<= (- (- ULTIMATE.start_main_~len~5) v_b_5_1) (- 2)))) (exists ((v_b_7_1 Int) (v_v_4_1 Int) (v_b_0_1 Int)) (and (<= (- (- ULTIMATE.start_main_~len~5) v_v_4_1) (- 2)) (<= (- ULTIMATE.start_main_~len~5 v_b_7_1) 0) (<= (- v_b_0_1 v_b_7_1) (- 2)) (<= (- (- ULTIMATE.start_main_~len~5) ULTIMATE.start_main_~len~5) (- 4)) (<= (- (- v_b_0_1) v_b_7_1) (- 2)) (<= (- ULTIMATE.start_main_~len~5 (- ULTIMATE.start_main_~len~5)) 4) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_7_1)) 0) (<= (- (- ULTIMATE.start_main_~len~5) v_b_0_1) (- 2)) (<= (- ULTIMATE.start_main_~len~5 v_v_4_1) 2) (<= (- (- v_b_0_1) (- v_b_7_1)) 2) (<= (- (- v_b_0_1) v_v_4_1) 0) (<= (- ULTIMATE.start_main_~len~5 (- v_b_7_1)) 4) (<= (- v_b_7_1 (- v_b_7_1)) 4) (<= (- (- ULTIMATE.start_main_~len~5) (- v_v_4_1)) (- 2)) (<= (- v_b_0_1 (- v_v_4_1)) 0) (<= (- ULTIMATE.start_main_~len~5 v_b_0_1) 2) (<= (- (- ULTIMATE.start_main_~len~5) v_b_7_1) (- 4)) (<= (- v_b_0_1 (- v_b_7_1)) 2) (<= (- (- v_v_4_1) v_v_4_1) 0) (<= (- ULTIMATE.start_main_~len~5 (- v_v_4_1)) 2) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_0_1)) (- 2)) (<= (- (- v_b_7_1) v_b_7_1) (- 4)) (<= (- v_b_7_1 v_v_4_1) 2) (<= (- v_b_7_1 (- v_v_4_1)) 2) (<= (- v_b_0_1 (- v_b_0_1)) 0) (<= (- (- v_b_7_1) v_v_4_1) (- 2)) (<= (- (- v_b_7_1) (- v_v_4_1)) (- 2)) (<= (- (- v_b_0_1) v_b_0_1) 0) (<= (- v_v_4_1 (- v_v_4_1)) 0) (<= (- v_b_0_1 v_v_4_1) 0) (<= (- ULTIMATE.start_main_~len~5 (- v_b_0_1)) 2) (<= (- (- v_b_0_1) (- v_v_4_1)) 0) (forall ((v_idx_18 Int) (v_idx_16 Int) (v_idx_17 Int)) (or (< v_idx_17 v_b_0_1) (< v_idx_18 v_b_7_1) (<= v_b_0_1 v_idx_16) (<= v_b_7_1 v_idx_17) (and (<= (- (- ULTIMATE.start_main_~len~5) (select ULTIMATE.start_main_~a~5 v_idx_17)) (- 2)) (<= (- (- (select ULTIMATE.start_main_~a~5 v_idx_17)) (select ULTIMATE.start_main_~a~5 v_idx_17)) 0) (<= (- ULTIMATE.start_main_~len~5 (- (select ULTIMATE.start_main_~a~5 v_idx_17))) 2) (<= (- v_b_7_1 (select ULTIMATE.start_main_~a~5 v_idx_17)) 2) (<= (- v_b_7_1 (- (select ULTIMATE.start_main_~a~5 v_idx_17))) 2) (<= (- (- v_b_7_1) (select ULTIMATE.start_main_~a~5 v_idx_17)) (- 2)) (<= (- (- v_b_7_1) (- (select ULTIMATE.start_main_~a~5 v_idx_17))) (- 2)) (<= (- (select ULTIMATE.start_main_~a~5 v_idx_17) (- (select ULTIMATE.start_main_~a~5 v_idx_17))) 0) (<= (- ULTIMATE.start_main_~len~5 (select ULTIMATE.start_main_~a~5 v_idx_17)) 2) (<= (- (- v_b_0_1) (select ULTIMATE.start_main_~a~5 v_idx_17)) 0) (<= (- v_b_0_1 (select ULTIMATE.start_main_~a~5 v_idx_17)) 0) (<= (- (- v_b_0_1) (- (select ULTIMATE.start_main_~a~5 v_idx_17))) 0) (<= (- (- ULTIMATE.start_main_~len~5) (- (select ULTIMATE.start_main_~a~5 v_idx_17))) (- 2)) (<= (- v_b_0_1 (- (select ULTIMATE.start_main_~a~5 v_idx_17))) 0)))))))} [2018-12-19 12:25:51,695 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2018-12-19 12:25:51,696 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2018-12-19 12:25:51,696 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:25:51,697 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:25:51,697 WARN L224 ngHoareTripleChecker]: Pre: {2147483631#(or (exists ((v_v_4_1 Int) (v_b_0_1 Int) (v_b_1_1 Int)) (and (<= (- v_b_0_1 (- v_b_1_1)) 1) (<= (- (- v_b_0_1) v_b_1_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) c_ULTIMATE.start_main_~len~5) (- 2)) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_v_4_1)) (- 1)) (<= (- v_b_1_1 (- v_v_4_1)) 1) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_0_1)) 1) (<= (- (- v_b_0_1) v_v_4_1) 0) (<= (- v_b_1_1 (- v_b_1_1)) 2) (<= (- c_ULTIMATE.start_main_~len~5 v_b_0_1) 1) (<= (- v_b_1_1 v_v_4_1) 1) (<= (- (- v_b_0_1) (- v_b_1_1)) 1) (<= (- v_b_0_1 (- v_v_4_1)) 0) (<= (- (- v_b_1_1) (- v_v_4_1)) (- 1)) (<= (- (- v_b_1_1) v_b_1_1) (- 2)) (<= (- v_b_0_1 v_b_1_1) (- 1)) (<= (- (- v_v_4_1) v_v_4_1) 0) (forall ((v_idx_36 Int) (v_idx_34 Int) (v_idx_35 Int)) (or (<= v_b_1_1 v_idx_35) (<= v_b_0_1 v_idx_34) (< v_idx_35 v_b_0_1) (< v_idx_36 v_b_1_1) (and (<= (- (- (select c_ULTIMATE.start_main_~a~5 v_idx_35)) (select c_ULTIMATE.start_main_~a~5 v_idx_35)) 0) (<= (- c_ULTIMATE.start_main_~len~5 (select c_ULTIMATE.start_main_~a~5 v_idx_35)) 1) (<= (- c_ULTIMATE.start_main_~len~5 (- (select c_ULTIMATE.start_main_~a~5 v_idx_35))) 1) (<= (- (- c_ULTIMATE.start_main_~len~5) (select c_ULTIMATE.start_main_~a~5 v_idx_35)) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) (- (select c_ULTIMATE.start_main_~a~5 v_idx_35))) (- 1)) (<= (- v_b_1_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_35))) 1) (<= (- (select c_ULTIMATE.start_main_~a~5 v_idx_35) (- (select c_ULTIMATE.start_main_~a~5 v_idx_35))) 0) (<= (- (- v_b_0_1) (select c_ULTIMATE.start_main_~a~5 v_idx_35)) 0) (<= (- v_b_0_1 (select c_ULTIMATE.start_main_~a~5 v_idx_35)) 0) (<= (- v_b_1_1 (select c_ULTIMATE.start_main_~a~5 v_idx_35)) 1) (<= (- (- v_b_1_1) (select c_ULTIMATE.start_main_~a~5 v_idx_35)) (- 1)) (<= (- (- v_b_0_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_35))) 0) (<= (- v_b_0_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_35))) 0) (<= (- (- v_b_1_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_35))) (- 1))))) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_1_1)) 2) (<= (- c_ULTIMATE.start_main_~len~5 v_v_4_1) 1) (<= (- c_ULTIMATE.start_main_~len~5 (- v_v_4_1)) 1) (<= (- (- c_ULTIMATE.start_main_~len~5) v_v_4_1) (- 1)) (<= (- v_b_0_1 (- v_b_0_1)) 0) (<= (- c_ULTIMATE.start_main_~len~5 v_b_1_1) 0) (<= (- (- v_b_0_1) v_b_0_1) 0) (<= (- v_v_4_1 (- v_v_4_1)) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_1_1) (- 2)) (<= (- v_b_0_1 v_v_4_1) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- c_ULTIMATE.start_main_~len~5)) 2) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_0_1)) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_0_1) (- 1)) (<= (- (- v_b_1_1) v_v_4_1) (- 1)) (<= (- (- v_b_0_1) (- v_v_4_1)) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_1_1)) 0))) (exists ((v_b_11_1 Int) (v_b_10_1 Int) (v_v_167_1 Int)) (and (<= (- v_b_10_1 v_v_167_1) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_v_167_1)) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) c_ULTIMATE.start_main_~len~5) 0) (<= (- (- v_v_167_1) v_v_167_1) 0) (<= (- (- v_b_10_1) v_b_11_1) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_11_1)) 4) (<= (- v_b_10_1 (- v_b_10_1)) 0) (<= (- c_ULTIMATE.start_main_~len~5 v_v_167_1) 2) (<= (- c_ULTIMATE.start_main_~len~5 (- c_ULTIMATE.start_main_~len~5)) 4) (<= (- v_b_10_1 (- v_v_167_1)) 0) (<= (- v_b_10_1 v_b_11_1) 0) (<= (- (- v_b_11_1) v_b_11_1) 0) (<= (- v_b_10_1 (- v_b_11_1)) 2) (<= (- (- v_b_10_1) (- v_v_167_1)) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) v_v_167_1) 0) (<= (- (- v_b_10_1) v_v_167_1) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_11_1) 0) (<= (- c_ULTIMATE.start_main_~len~5 v_b_10_1) 2) (<= (- c_ULTIMATE.start_main_~len~5 (- v_v_167_1)) 2) (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_10_1) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_11_1)) 0) (<= (- c_ULTIMATE.start_main_~len~5 v_b_11_1) 0) (<= (- v_b_11_1 v_v_167_1) 2) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_10_1)) 2) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_10_1)) 0) (<= (- (- v_b_10_1) (- v_b_11_1)) 2) (<= (- v_b_11_1 (- v_v_167_1)) 2) (forall ((v_idx_37 Int) (v_idx_38 Int) (v_idx_39 Int)) (or (< v_idx_39 v_b_11_1) (<= v_b_11_1 v_idx_38) (<= v_b_10_1 v_idx_37) (and (<= (- v_b_10_1 (select c_ULTIMATE.start_main_~a~5 v_idx_38)) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) (- (select c_ULTIMATE.start_main_~a~5 v_idx_38))) 0) (<= (- (- (select c_ULTIMATE.start_main_~a~5 v_idx_38)) (select c_ULTIMATE.start_main_~a~5 v_idx_38)) 0) (<= (- c_ULTIMATE.start_main_~len~5 (select c_ULTIMATE.start_main_~a~5 v_idx_38)) 2) (<= (- c_ULTIMATE.start_main_~len~5 (- (select c_ULTIMATE.start_main_~a~5 v_idx_38))) 2) (<= (- v_b_10_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_38))) 0) (<= (- v_b_11_1 (select c_ULTIMATE.start_main_~a~5 v_idx_38)) 2) (<= (- v_b_11_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_38))) 2) (<= (- (- v_b_10_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_38))) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) (select c_ULTIMATE.start_main_~a~5 v_idx_38)) 0) (<= (- (- v_b_10_1) (select c_ULTIMATE.start_main_~a~5 v_idx_38)) 0) (<= (- (- v_b_11_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_38))) 0) (<= (- (- v_b_11_1) (select c_ULTIMATE.start_main_~a~5 v_idx_38)) 0) (<= (- (select c_ULTIMATE.start_main_~a~5 v_idx_38) (- (select c_ULTIMATE.start_main_~a~5 v_idx_38))) 0)) (< v_idx_38 v_b_10_1))) (<= (- (- v_b_10_1) v_b_10_1) 0) (<= (- (- v_b_11_1) (- v_v_167_1)) 0) (<= (- v_b_11_1 (- v_b_11_1)) 4) (<= (- (- v_b_11_1) v_v_167_1) 0) (<= (- v_v_167_1 (- v_v_167_1)) 0))))} [2018-12-19 12:25:51,697 WARN L228 ngHoareTripleChecker]: Action: assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; [2018-12-19 12:25:51,698 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (= 4 (mod c_ULTIMATE.start_main_~len~5 4294967296))) (= c_ULTIMATE.start_main_~a~5_primed (store c_ULTIMATE.start_main_~a~5 (mod c_ULTIMATE.start_main_~len~5 4294967296) 0)) (not (= 0 (mod |c_ULTIMATE.start_main_#t~nondet0| 256))) (= (+ c_ULTIMATE.start_main_~len~5 1) c_ULTIMATE.start_main_~len~5_primed)) [2018-12-19 12:25:51,698 WARN L230 ngHoareTripleChecker]: Post: {2147483630#(exists ((v_b_11_1 Int) (v_b_14_1 Int) (v_b_15_1 Int) (v_v_227_1 Int) (v_b_10_1 Int) (v_v_167_1 Int)) (and (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_11_1) (- 1)) (<= (- (- v_b_14_1) (- v_b_15_1)) 3) (<= (- v_b_15_1 (- v_v_167_1)) 3) (<= (- v_b_11_1 (- v_b_14_1)) 4) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_v_167_1)) (- 1)) (<= (- (- v_b_11_1) (- v_b_15_1)) 3) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_15_1)) 2) (<= (- v_b_10_1 (- v_b_14_1)) 2) (<= (- (- v_b_10_1) (- v_b_11_1)) 2) (<= (- v_b_11_1 (- v_v_167_1)) 2) (<= (- (- v_b_11_1) v_b_15_1) (- 1)) (<= (- (- v_b_11_1) (- v_b_14_1)) 2) (<= (- c_ULTIMATE.start_main_~len~5 v_b_11_1) 1) (<= (- c_ULTIMATE.start_main_~len~5 v_v_227_1) 3) (<= (- (- v_b_14_1) v_b_15_1) (- 1)) (<= (- c_ULTIMATE.start_main_~len~5 v_b_10_1) 3) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_14_1)) 1) (<= (- v_b_10_1 v_v_167_1) 0) (<= (- v_b_14_1 v_v_227_1) 2) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_14_1)) 5) (<= (- (- v_v_167_1) v_v_167_1) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- v_v_227_1)) 3) (<= (- v_v_167_1 v_v_227_1) 0) (<= (- v_b_10_1 (- v_v_167_1)) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) c_ULTIMATE.start_main_~len~5) (- 2)) (<= (- (- v_b_11_1) v_v_227_1) 0) (<= (- v_b_14_1 (- v_b_14_1)) 4) (<= (- c_ULTIMATE.start_main_~len~5 v_b_15_1) 2) (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_10_1) (- 1)) (<= (- v_b_10_1 (- v_b_11_1)) 2) (<= (- v_b_11_1 v_b_14_1) 2) (<= (- (- v_b_10_1) (- v_v_167_1)) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_15_1)) 6) (<= (- (- v_v_227_1) v_v_227_1) 0) (<= (- (- v_b_10_1) (- v_v_227_1)) 0) (<= (- (- v_b_10_1) (- v_b_14_1)) 2) (<= (- (- v_b_14_1) v_v_167_1) 0) (<= (- v_b_11_1 v_v_227_1) 2) (<= (- c_ULTIMATE.start_main_~len~5 (- v_v_167_1)) 3) (<= (- v_b_15_1 (- v_v_227_1)) 3) (<= (- c_ULTIMATE.start_main_~len~5 v_b_14_1) 3) (<= (- v_b_10_1 (- v_b_15_1)) 3) (<= (- (- v_b_10_1) v_b_14_1) 0) (<= (- v_b_14_1 v_v_167_1) 2) (<= (- (- v_b_11_1) (- v_v_167_1)) 0) (<= (- v_v_167_1 (- v_v_167_1)) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_v_227_1)) (- 1)) (<= (- v_b_15_1 (- v_b_15_1)) 6) (<= (- v_v_167_1 (- v_v_227_1)) 0) (<= (- (- v_b_10_1) v_b_11_1) 0) (<= (- (- v_b_11_1) v_b_14_1) 0) (<= (- (- v_b_15_1) v_b_15_1) (- 2)) (<= (- (- v_b_15_1) (- v_v_167_1)) (- 1)) (<= (- v_b_10_1 (- v_b_10_1)) 0) (<= (- (- v_b_11_1) v_b_11_1) 0) (<= (- v_b_15_1 v_v_167_1) 3) (<= (- v_b_11_1 (- v_b_15_1)) 5) (forall ((v_idx_43 Int) (v_idx_44 Int) (v_idx_41 Int) (v_idx_42 Int) (v_idx_40 Int)) (or (<= v_b_14_1 v_idx_42) (<= v_b_11_1 v_idx_41) (and (<= (- (select c_ULTIMATE.start_main_~a~5 v_idx_43) (- (select c_ULTIMATE.start_main_~a~5 v_idx_43))) 0) (<= (- v_b_10_1 (select c_ULTIMATE.start_main_~a~5 v_idx_41)) 0) (<= (- (select c_ULTIMATE.start_main_~a~5 v_idx_41) (- (select c_ULTIMATE.start_main_~a~5 v_idx_43))) 0) (<= (- v_b_14_1 (select c_ULTIMATE.start_main_~a~5 v_idx_43)) 2) (<= (- (- (select c_ULTIMATE.start_main_~a~5 v_idx_41)) (select c_ULTIMATE.start_main_~a~5 v_idx_41)) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- (select c_ULTIMATE.start_main_~a~5 v_idx_43))) 3) (<= (- (select c_ULTIMATE.start_main_~a~5 v_idx_41) (select c_ULTIMATE.start_main_~a~5 v_idx_43)) 0) (<= (- c_ULTIMATE.start_main_~len~5 (select c_ULTIMATE.start_main_~a~5 v_idx_41)) 3) (<= (- (- v_b_15_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_41))) (- 1)) (<= (- v_b_14_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_43))) 2) (<= (- v_b_15_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_41))) 3) (<= (- v_b_10_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_41))) 0) (<= (- (- v_b_11_1) (select c_ULTIMATE.start_main_~a~5 v_idx_43)) 0) (<= (- v_b_15_1 (select c_ULTIMATE.start_main_~a~5 v_idx_41)) 3) (<= (- (- c_ULTIMATE.start_main_~len~5) (select c_ULTIMATE.start_main_~a~5 v_idx_43)) (- 1)) (<= (- (- v_b_10_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_41))) 0) (<= (- v_b_15_1 (select c_ULTIMATE.start_main_~a~5 v_idx_43)) 3) (<= (- (- c_ULTIMATE.start_main_~len~5) (- (select c_ULTIMATE.start_main_~a~5 v_idx_41))) (- 1)) (<= (- (- v_b_10_1) (select c_ULTIMATE.start_main_~a~5 v_idx_41)) 0) (<= (- (- v_b_15_1) (select c_ULTIMATE.start_main_~a~5 v_idx_43)) (- 1)) (<= (- (- (select c_ULTIMATE.start_main_~a~5 v_idx_43)) (select c_ULTIMATE.start_main_~a~5 v_idx_43)) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) (select c_ULTIMATE.start_main_~a~5 v_idx_41)) (- 1)) (<= (- (- v_b_10_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_43))) 0) (<= (- (- v_b_14_1) (select c_ULTIMATE.start_main_~a~5 v_idx_41)) 0) (<= (- (- v_b_14_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_43))) 0) (<= (- v_b_10_1 (select c_ULTIMATE.start_main_~a~5 v_idx_43)) 0) (<= (- v_b_11_1 (select c_ULTIMATE.start_main_~a~5 v_idx_43)) 2) (<= (- (- v_b_10_1) (select c_ULTIMATE.start_main_~a~5 v_idx_43)) 0) (<= (- v_b_10_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_43))) 0) (<= (- (- v_b_15_1) (select c_ULTIMATE.start_main_~a~5 v_idx_41)) (- 1)) (<= (- c_ULTIMATE.start_main_~len~5 (- (select c_ULTIMATE.start_main_~a~5 v_idx_41))) 3) (<= (- v_b_11_1 (select c_ULTIMATE.start_main_~a~5 v_idx_41)) 2) (<= (- v_b_11_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_41))) 2) (<= (- v_b_15_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_43))) 3) (<= (- (- v_b_15_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_43))) (- 1)) (<= (- v_b_11_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_43))) 2) (<= (- c_ULTIMATE.start_main_~len~5 (select c_ULTIMATE.start_main_~a~5 v_idx_43)) 3) (<= (- (- v_b_14_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_41))) 0) (<= (- (- (select c_ULTIMATE.start_main_~a~5 v_idx_41)) (select c_ULTIMATE.start_main_~a~5 v_idx_43)) 0) (<= (- (- v_b_11_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_43))) 0) (<= (- v_b_14_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_41))) 2) (<= (- v_b_14_1 (select c_ULTIMATE.start_main_~a~5 v_idx_41)) 2) (<= (- (- v_b_11_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_41))) 0) (<= (- (- (select c_ULTIMATE.start_main_~a~5 v_idx_41)) (- (select c_ULTIMATE.start_main_~a~5 v_idx_43))) 0) (<= (- (- v_b_14_1) (select c_ULTIMATE.start_main_~a~5 v_idx_43)) 0) (<= (- (select c_ULTIMATE.start_main_~a~5 v_idx_41) (- (select c_ULTIMATE.start_main_~a~5 v_idx_41))) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) (- (select c_ULTIMATE.start_main_~a~5 v_idx_43))) (- 1)) (<= (- (- v_b_11_1) (select c_ULTIMATE.start_main_~a~5 v_idx_41)) 0)) (< v_idx_43 v_b_14_1) (< v_idx_42 v_b_11_1) (<= v_b_15_1 v_idx_43) (<= v_b_10_1 v_idx_40) (< v_idx_41 v_b_10_1) (< v_idx_44 v_b_15_1))) (<= (- (- c_ULTIMATE.start_main_~len~5) v_v_227_1) (- 1)) (<= (- v_b_15_1 v_v_227_1) 3) (<= (- v_b_10_1 v_v_227_1) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- c_ULTIMATE.start_main_~len~5)) 6) (<= (- (- v_b_15_1) v_v_167_1) (- 1)) (<= (- (- v_b_15_1) (- v_v_227_1)) (- 1)) (<= (- v_b_11_1 (- v_v_227_1)) 2) (<= (- v_b_14_1 (- v_b_15_1)) 5) (<= (- (- v_b_14_1) v_b_14_1) 0) (<= (- (- v_b_10_1) v_b_10_1) 0) (<= (- (- v_b_11_1) (- v_v_227_1)) 0) (<= (- v_b_14_1 (- v_v_167_1)) 2) (<= (- v_b_11_1 v_b_15_1) 1) (<= (- (- v_v_167_1) (- v_v_227_1)) 0) (<= (- v_b_11_1 (- v_b_11_1)) 4) (<= (- (- v_b_11_1) v_v_167_1) 0) (<= (- v_v_227_1 (- v_v_227_1)) 0) (<= (- c_ULTIMATE.start_main_~len~5 v_v_167_1) 3) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_11_1)) 5) (<= (- v_b_14_1 (- v_v_227_1)) 2) (<= (- (- v_b_10_1) v_b_15_1) (- 1)) (<= (- v_b_10_1 v_b_11_1) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_10_1)) 3) (<= (- v_b_10_1 v_b_14_1) 0) (<= (- (- v_b_10_1) v_v_167_1) 0) (<= (- (- v_b_15_1) v_v_227_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_15_1) (- 2)) (<= (- (- v_b_10_1) (- v_b_15_1)) 3) (<= (- (- c_ULTIMATE.start_main_~len~5) v_v_167_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_11_1)) (- 1)) (<= (- (- v_b_14_1) (- v_v_227_1)) 0) (<= (- (- v_b_10_1) v_v_227_1) 0) (<= (- v_b_10_1 (- v_v_227_1)) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_10_1)) (- 1)) (<= (- v_b_11_1 v_v_167_1) 2) (<= (- v_b_10_1 v_b_15_1) (- 1)) (<= (- (- v_b_14_1) (- v_v_167_1)) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_14_1) (- 1)) (<= (- (- v_v_167_1) v_v_227_1) 0) (<= (- v_b_14_1 v_b_15_1) 1) (<= (- (- v_b_14_1) v_v_227_1) 0)))} [2018-12-19 12:25:51,698 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:25:51,730 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:25:51,731 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:25:51,906 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 118 [2018-12-19 12:25:51,907 WARN L270 ngHoareTripleChecker]: Pre: {2147483631#(exists ((v_b_11_1 Int) (v_b_10_1 Int) (v_v_167_1 Int)) (and (<= (- v_b_10_1 v_v_167_1) 0) (<= (- (- ULTIMATE.start_main_~len~5) (- v_v_167_1)) 0) (<= (- (- ULTIMATE.start_main_~len~5) ULTIMATE.start_main_~len~5) 0) (<= (- (- v_v_167_1) v_v_167_1) 0) (<= (- (- v_b_10_1) v_b_11_1) 0) (<= (- ULTIMATE.start_main_~len~5 (- v_b_11_1)) 4) (<= (- v_b_10_1 (- v_b_10_1)) 0) (<= (- ULTIMATE.start_main_~len~5 v_v_167_1) 2) (<= (- ULTIMATE.start_main_~len~5 (- ULTIMATE.start_main_~len~5)) 4) (<= (- v_b_10_1 (- v_v_167_1)) 0) (<= (- v_b_10_1 v_b_11_1) 0) (<= (- (- v_b_11_1) v_b_11_1) 0) (<= (- v_b_10_1 (- v_b_11_1)) 2) (<= (- (- v_b_10_1) (- v_v_167_1)) 0) (<= (- (- ULTIMATE.start_main_~len~5) v_v_167_1) 0) (<= (- (- v_b_10_1) v_v_167_1) 0) (<= (- (- ULTIMATE.start_main_~len~5) v_b_11_1) 0) (<= (- ULTIMATE.start_main_~len~5 v_b_10_1) 2) (<= (- ULTIMATE.start_main_~len~5 (- v_v_167_1)) 2) (<= (- (- ULTIMATE.start_main_~len~5) v_b_10_1) 0) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_11_1)) 0) (<= (- ULTIMATE.start_main_~len~5 v_b_11_1) 0) (<= (- v_b_11_1 v_v_167_1) 2) (<= (- ULTIMATE.start_main_~len~5 (- v_b_10_1)) 2) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_10_1)) 0) (<= (- (- v_b_10_1) (- v_b_11_1)) 2) (<= (- v_b_11_1 (- v_v_167_1)) 2) (forall ((v_idx_37 Int) (v_idx_38 Int) (v_idx_39 Int)) (or (< v_idx_39 v_b_11_1) (<= v_b_11_1 v_idx_38) (<= v_b_10_1 v_idx_37) (and (<= (- v_b_10_1 (select ULTIMATE.start_main_~a~5 v_idx_38)) 0) (<= (- (- ULTIMATE.start_main_~len~5) (- (select ULTIMATE.start_main_~a~5 v_idx_38))) 0) (<= (- (- (select ULTIMATE.start_main_~a~5 v_idx_38)) (select ULTIMATE.start_main_~a~5 v_idx_38)) 0) (<= (- ULTIMATE.start_main_~len~5 (select ULTIMATE.start_main_~a~5 v_idx_38)) 2) (<= (- ULTIMATE.start_main_~len~5 (- (select ULTIMATE.start_main_~a~5 v_idx_38))) 2) (<= (- v_b_10_1 (- (select ULTIMATE.start_main_~a~5 v_idx_38))) 0) (<= (- v_b_11_1 (select ULTIMATE.start_main_~a~5 v_idx_38)) 2) (<= (- v_b_11_1 (- (select ULTIMATE.start_main_~a~5 v_idx_38))) 2) (<= (- (- v_b_10_1) (- (select ULTIMATE.start_main_~a~5 v_idx_38))) 0) (<= (- (- ULTIMATE.start_main_~len~5) (select ULTIMATE.start_main_~a~5 v_idx_38)) 0) (<= (- (- v_b_10_1) (select ULTIMATE.start_main_~a~5 v_idx_38)) 0) (<= (- (- v_b_11_1) (- (select ULTIMATE.start_main_~a~5 v_idx_38))) 0) (<= (- (- v_b_11_1) (select ULTIMATE.start_main_~a~5 v_idx_38)) 0) (<= (- (select ULTIMATE.start_main_~a~5 v_idx_38) (- (select ULTIMATE.start_main_~a~5 v_idx_38))) 0)) (< v_idx_38 v_b_10_1))) (<= (- (- v_b_10_1) v_b_10_1) 0) (<= (- (- v_b_11_1) (- v_v_167_1)) 0) (<= (- v_b_11_1 (- v_b_11_1)) 4) (<= (- (- v_b_11_1) v_v_167_1) 0) (<= (- v_v_167_1 (- v_v_167_1)) 0)))} [2018-12-19 12:25:51,907 WARN L274 ngHoareTripleChecker]: Action: assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; [2018-12-19 12:25:51,908 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (= 4 (mod c_ULTIMATE.start_main_~len~5 4294967296))) (= c_ULTIMATE.start_main_~a~5_primed (store c_ULTIMATE.start_main_~a~5 (mod c_ULTIMATE.start_main_~len~5 4294967296) 0)) (not (= 0 (mod |c_ULTIMATE.start_main_#t~nondet0| 256))) (= (+ c_ULTIMATE.start_main_~len~5 1) c_ULTIMATE.start_main_~len~5_primed)) [2018-12-19 12:25:53,727 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 48 [2018-12-19 12:25:56,018 WARN L276 ngHoareTripleChecker]: Post: {2147483630#(or (and (<= 1 ULTIMATE.start_main_~len~5) (<= 2 (* 2 ULTIMATE.start_main_~len~5)) (<= ULTIMATE.start_main_~len~5 3) (<= (* 2 ULTIMATE.start_main_~len~5) 6) (<= (- ULTIMATE.start_main_~len~5 (- ULTIMATE.start_main_~len~5)) 6) (exists ((v_b_11_1 Int) (v_b_14_1 Int) (v_b_15_1 Int) (v_b_10_1 Int)) (and (<= (- (- ULTIMATE.start_main_~len~5) v_b_11_1) (- 1)) (<= 0 v_b_11_1) (<= (- (- v_b_14_1) (- v_b_15_1)) 3) (forall ((v_prenex_9 Int)) (or (< v_prenex_9 v_b_14_1) (<= (- (select ULTIMATE.start_main_~a~5 v_prenex_9) (- (select ULTIMATE.start_main_~a~5 v_prenex_9))) 0) (<= v_b_15_1 v_prenex_9))) (<= (- v_b_11_1 (- v_b_14_1)) 4) (<= v_b_10_1 v_b_14_1) (<= v_b_14_1 (+ v_b_10_1 2)) (<= (- (- v_b_11_1) (- v_b_15_1)) 3) (<= (+ v_b_14_1 v_b_10_1) 2) (forall ((v_prenex_10 Int)) (or (< v_prenex_10 v_b_14_1) (<= v_b_15_1 v_prenex_10) (<= (- (- ULTIMATE.start_main_~len~5) (- (select ULTIMATE.start_main_~a~5 v_prenex_10))) (- 1)))) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_15_1)) 2) (<= (+ v_b_15_1 ULTIMATE.start_main_~len~5) 6) (<= (* 2 v_b_14_1) 4) (<= (- v_b_10_1 (- v_b_14_1)) 2) (forall ((v_prenex_16 Int)) (or (<= v_b_15_1 v_prenex_16) (< v_prenex_16 v_b_14_1) (<= (- (- v_b_10_1) (select ULTIMATE.start_main_~a~5 v_prenex_16)) 0))) (forall ((v_prenex_2 Int)) (or (<= (- ULTIMATE.start_main_~len~5 (select ULTIMATE.start_main_~a~5 v_prenex_2)) 3) (<= v_b_15_1 v_prenex_2) (< v_prenex_2 v_b_14_1))) (forall ((v_prenex_22 Int)) (or (< v_prenex_22 v_b_14_1) (<= v_b_15_1 v_prenex_22) (<= (- (- v_b_11_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_22))) 0))) (<= (- (- v_b_10_1) (- v_b_11_1)) 2) (<= (- (- v_b_11_1) v_b_15_1) (- 1)) (<= (- (- v_b_11_1) (- v_b_14_1)) 2) (<= (- ULTIMATE.start_main_~len~5 v_b_11_1) 1) (<= ULTIMATE.start_main_~len~5 (+ v_b_14_1 3)) (<= (* 2 v_b_15_1) 6) (<= 2 (+ v_b_15_1 ULTIMATE.start_main_~len~5)) (<= 0 v_b_14_1) (<= (- (- v_b_14_1) v_b_15_1) (- 1)) (forall ((v_prenex_29 Int)) (or (<= v_b_15_1 v_prenex_29) (<= (- (- v_b_14_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_29))) 0) (< v_prenex_29 v_b_14_1))) (<= v_b_10_1 0) (forall ((v_prenex_45 Int) (v_prenex_44 Int)) (or (<= v_b_11_1 v_prenex_45) (<= (- (- (select ULTIMATE.start_main_~a~5 v_prenex_45)) (select ULTIMATE.start_main_~a~5 v_prenex_44)) 0) (<= v_b_15_1 v_prenex_44) (< v_prenex_44 v_b_14_1) (< v_prenex_45 v_b_10_1))) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_14_1)) 1) (<= (- ULTIMATE.start_main_~len~5 v_b_10_1) 3) (forall ((v_prenex_14 Int)) (or (<= (- (- v_b_10_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_14))) 0) (<= v_b_15_1 v_prenex_14) (< v_prenex_14 v_b_14_1))) (<= (- ULTIMATE.start_main_~len~5 (- v_b_14_1)) 5) (<= (+ v_b_15_1 v_b_10_1) 3) (<= 1 (+ v_b_11_1 ULTIMATE.start_main_~len~5)) (<= v_b_11_1 (+ v_b_10_1 2)) (forall ((v_prenex_30 Int)) (or (< v_prenex_30 v_b_14_1) (<= v_b_15_1 v_prenex_30) (<= (- v_b_15_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_30))) 3))) (<= (- v_b_14_1 (- v_b_14_1)) 4) (<= (- ULTIMATE.start_main_~len~5 v_b_15_1) 2) (<= 0 (* 2 v_b_10_1)) (forall ((v_prenex_43 Int)) (or (<= (- (- v_b_15_1) (select ULTIMATE.start_main_~a~5 v_prenex_43)) (- 1)) (< v_prenex_43 v_b_14_1) (<= v_b_15_1 v_prenex_43))) (forall ((v_prenex_15 Int)) (or (<= (- (- v_b_11_1) (select ULTIMATE.start_main_~a~5 v_prenex_15)) 0) (<= v_b_15_1 v_prenex_15) (< v_prenex_15 v_b_14_1))) (<= (- v_b_10_1 (- v_b_11_1)) 2) (<= (- (- ULTIMATE.start_main_~len~5) v_b_10_1) (- 1)) (<= (- v_b_11_1 v_b_14_1) 2) (<= v_b_11_1 (+ v_b_15_1 1)) (<= 1 (+ v_b_14_1 ULTIMATE.start_main_~len~5)) (<= ULTIMATE.start_main_~len~5 (+ v_b_15_1 2)) (<= ULTIMATE.start_main_~len~5 (+ v_b_11_1 3)) (<= v_b_15_1 (+ v_b_10_1 3)) (<= (- ULTIMATE.start_main_~len~5 (- v_b_15_1)) 6) (<= (+ v_b_14_1 ULTIMATE.start_main_~len~5) 5) (<= 0 (+ v_b_11_1 v_b_10_1)) (<= (- (- v_b_10_1) (- v_b_14_1)) 2) (forall ((v_prenex_36 Int)) (or (< v_prenex_36 v_b_14_1) (<= v_b_15_1 v_prenex_36) (<= (- ULTIMATE.start_main_~len~5 (- (select ULTIMATE.start_main_~a~5 v_prenex_36))) 3))) (<= v_b_11_1 (+ ULTIMATE.start_main_~len~5 1)) (<= v_b_11_1 2) (<= v_b_10_1 v_b_11_1) (forall ((v_prenex_32 Int) (v_prenex_31 Int)) (or (<= (- (select ULTIMATE.start_main_~a~5 v_prenex_32) (- (select ULTIMATE.start_main_~a~5 v_prenex_31))) 0) (<= v_b_11_1 v_prenex_32) (< v_prenex_32 v_b_10_1) (< v_prenex_31 v_b_14_1) (<= v_b_15_1 v_prenex_31))) (<= 1 (+ v_b_11_1 v_b_15_1)) (< v_b_15_1 (+ v_b_14_1 1)) (<= (+ v_b_10_1 1) ULTIMATE.start_main_~len~5) (<= (- ULTIMATE.start_main_~len~5 v_b_14_1) 3) (forall ((v_prenex_7 Int)) (or (<= (- v_b_10_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_7))) 0) (<= v_b_15_1 v_prenex_7) (< v_prenex_7 v_b_14_1))) (<= (- v_b_10_1 (- v_b_15_1)) 3) (<= (- (- v_b_10_1) v_b_14_1) 0) (<= (- v_b_15_1 (- v_b_15_1)) 6) (forall ((v_prenex_27 Int) (v_prenex_28 Int)) (or (<= (- (- (select ULTIMATE.start_main_~a~5 v_prenex_28)) (- (select ULTIMATE.start_main_~a~5 v_prenex_27))) 0) (< v_prenex_28 v_b_10_1) (<= v_b_11_1 v_prenex_28) (< v_prenex_27 v_b_14_1) (<= v_b_15_1 v_prenex_27))) (<= v_b_15_1 (+ v_b_11_1 3)) (<= 0 (* 2 v_b_14_1)) (<= (- (- v_b_10_1) v_b_11_1) 0) (<= v_b_14_1 (+ v_b_15_1 1)) (<= (- (- v_b_11_1) v_b_14_1) 0) (<= (- (- v_b_15_1) v_b_15_1) (- 2)) (<= 0 (+ v_b_11_1 v_b_14_1)) (<= (- v_b_10_1 (- v_b_10_1)) 0) (<= v_b_15_1 (+ ULTIMATE.start_main_~len~5 2)) (<= (- (- v_b_11_1) v_b_11_1) 0) (forall ((v_prenex_49 Int) (v_prenex_48 Int)) (or (< v_prenex_48 v_b_14_1) (< v_prenex_49 v_b_10_1) (<= v_b_11_1 v_prenex_49) (<= v_b_15_1 v_prenex_48) (<= (- (select ULTIMATE.start_main_~a~5 v_prenex_49) (select ULTIMATE.start_main_~a~5 v_prenex_48)) 0))) (<= v_b_14_1 (+ v_b_11_1 2)) (<= v_b_11_1 (+ v_b_14_1 2)) (<= (- v_b_11_1 (- v_b_15_1)) 5) (forall ((v_prenex_18 Int)) (or (<= v_b_15_1 v_prenex_18) (<= (- (- (select ULTIMATE.start_main_~a~5 v_prenex_18)) (select ULTIMATE.start_main_~a~5 v_prenex_18)) 0) (< v_prenex_18 v_b_14_1))) (<= ULTIMATE.start_main_~len~5 (+ v_b_10_1 3)) (forall ((v_prenex_41 Int)) (or (<= v_b_15_1 v_prenex_41) (< v_prenex_41 v_b_14_1) (<= (- v_b_11_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_41))) 2))) (<= 2 (* 2 v_b_15_1)) (<= v_b_15_1 3) (<= (+ v_b_11_1 v_b_10_1) 2) (<= 0 v_b_10_1) (<= 1 (+ v_b_15_1 v_b_10_1)) (<= (- v_b_14_1 (- v_b_15_1)) 5) (forall ((v_idx_43 Int)) (or (< v_idx_43 v_b_14_1) (<= (- v_b_10_1 (select ULTIMATE.start_main_~a~5 v_idx_43)) 0) (<= v_b_15_1 v_idx_43))) (<= (+ ULTIMATE.start_main_~len~5 v_b_10_1) 3) (<= (- (- v_b_14_1) v_b_14_1) 0) (<= (- (- v_b_10_1) v_b_10_1) 0) (<= (- v_b_11_1 v_b_15_1) 1) (<= (- v_b_11_1 (- v_b_11_1)) 4) (forall ((v_prenex_1 Int)) (or (<= (- (- v_b_14_1) (select ULTIMATE.start_main_~a~5 v_prenex_1)) 0) (<= v_b_15_1 v_prenex_1) (< v_prenex_1 v_b_14_1))) (<= (+ v_b_11_1 v_b_15_1) 5) (forall ((v_prenex_46 Int)) (or (< v_prenex_46 v_b_14_1) (<= (- v_b_11_1 (select ULTIMATE.start_main_~a~5 v_prenex_46)) 2) (<= v_b_15_1 v_prenex_46))) (<= (- ULTIMATE.start_main_~len~5 (- v_b_11_1)) 5) (forall ((v_prenex_17 Int)) (or (< v_prenex_17 v_b_14_1) (<= v_b_15_1 v_prenex_17) (<= (- v_b_15_1 (select ULTIMATE.start_main_~a~5 v_prenex_17)) 3))) (forall ((v_prenex_12 Int)) (or (<= v_b_15_1 v_prenex_12) (<= (- (- ULTIMATE.start_main_~len~5) (select ULTIMATE.start_main_~a~5 v_prenex_12)) (- 1)) (< v_prenex_12 v_b_14_1))) (<= 1 (+ ULTIMATE.start_main_~len~5 v_b_10_1)) (<= 1 (+ v_b_14_1 v_b_15_1)) (<= (- (- v_b_10_1) v_b_15_1) (- 1)) (<= (+ v_b_10_1 1) v_b_15_1) (<= v_b_14_1 2) (<= (- v_b_10_1 v_b_11_1) 0) (<= (+ v_b_14_1 v_b_15_1) 5) (<= v_b_14_1 (+ ULTIMATE.start_main_~len~5 1)) (<= (- v_b_10_1 v_b_14_1) 0) (<= (- ULTIMATE.start_main_~len~5 (- v_b_10_1)) 3) (forall ((v_prenex_34 Int)) (or (<= (- v_b_14_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_34))) 2) (< v_prenex_34 v_b_14_1) (<= v_b_15_1 v_prenex_34))) (<= 0 (* 2 v_b_11_1)) (<= v_b_15_1 (+ v_b_14_1 3)) (<= 1 v_b_15_1) (<= (- (- ULTIMATE.start_main_~len~5) v_b_15_1) (- 2)) (<= (- (- v_b_10_1) (- v_b_15_1)) 3) (<= (* 2 v_b_10_1) 0) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_11_1)) (- 1)) (forall ((v_prenex_5 Int)) (or (<= v_b_15_1 v_prenex_5) (<= (- (- v_b_15_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_5))) (- 1)) (< v_prenex_5 v_b_14_1))) (forall ((v_prenex_42 Int)) (or (<= (- v_b_14_1 (select ULTIMATE.start_main_~a~5 v_prenex_42)) 2) (< v_prenex_42 v_b_14_1) (<= v_b_15_1 v_prenex_42))) (<= 0 (+ v_b_14_1 v_b_10_1)) (<= (* 2 v_b_11_1) 4) (<= (+ v_b_11_1 v_b_14_1) 4) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_10_1)) (- 1)) (<= (- v_b_10_1 v_b_15_1) (- 1)) (<= (- (- ULTIMATE.start_main_~len~5) v_b_14_1) (- 1)) (<= (+ v_b_11_1 ULTIMATE.start_main_~len~5) 5) (<= (- v_b_14_1 v_b_15_1) 1))) (<= (- (- ULTIMATE.start_main_~len~5) ULTIMATE.start_main_~len~5) (- 2))) (and (<= 1 ULTIMATE.start_main_~len~5) (exists ((v_b_11_1 Int) (v_b_14_1 Int) (v_b_15_1 Int) (v_b_10_1 Int)) (and (<= (- (- ULTIMATE.start_main_~len~5) v_b_11_1) (- 1)) (<= 0 v_b_11_1) (<= (- (- v_b_14_1) (- v_b_15_1)) 3) (forall ((v_prenex_9 Int)) (or (< v_prenex_9 v_b_14_1) (<= (- (select ULTIMATE.start_main_~a~5 v_prenex_9) (- (select ULTIMATE.start_main_~a~5 v_prenex_9))) 0) (<= v_b_15_1 v_prenex_9))) (forall ((v_prenex_47 Int)) (or (< v_prenex_47 v_b_10_1) (<= v_b_11_1 v_prenex_47) (<= (- (- v_b_15_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_47))) (- 1)))) (<= (- v_b_11_1 (- v_b_14_1)) 4) (forall ((v_prenex_33 Int)) (or (<= (- ULTIMATE.start_main_~len~5 (select ULTIMATE.start_main_~a~5 v_prenex_33)) 3) (< v_prenex_33 v_b_10_1) (<= v_b_11_1 v_prenex_33))) (forall ((v_prenex_25 Int)) (or (<= v_b_11_1 v_prenex_25) (< v_prenex_25 v_b_10_1) (<= (- (- v_b_10_1) (select ULTIMATE.start_main_~a~5 v_prenex_25)) 0))) (<= v_b_10_1 v_b_14_1) (<= v_b_14_1 (+ v_b_10_1 2)) (<= (- (- v_b_11_1) (- v_b_15_1)) 3) (forall ((v_prenex_6 Int)) (or (<= (- (- ULTIMATE.start_main_~len~5) (- (select ULTIMATE.start_main_~a~5 v_prenex_6))) (- 1)) (<= v_b_11_1 v_prenex_6) (< v_prenex_6 v_b_10_1))) (<= (+ v_b_14_1 v_b_10_1) 2) (forall ((v_prenex_10 Int)) (or (< v_prenex_10 v_b_14_1) (<= v_b_15_1 v_prenex_10) (<= (- (- ULTIMATE.start_main_~len~5) (- (select ULTIMATE.start_main_~a~5 v_prenex_10))) (- 1)))) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_15_1)) 2) (<= (+ v_b_15_1 ULTIMATE.start_main_~len~5) 6) (<= (* 2 v_b_14_1) 4) (<= (- v_b_10_1 (- v_b_14_1)) 2) (forall ((v_prenex_16 Int)) (or (<= v_b_15_1 v_prenex_16) (< v_prenex_16 v_b_14_1) (<= (- (- v_b_10_1) (select ULTIMATE.start_main_~a~5 v_prenex_16)) 0))) (forall ((v_prenex_38 Int)) (or (< v_prenex_38 v_b_10_1) (<= v_b_11_1 v_prenex_38) (<= (- v_b_11_1 (select ULTIMATE.start_main_~a~5 v_prenex_38)) 2))) (forall ((v_prenex_2 Int)) (or (<= (- ULTIMATE.start_main_~len~5 (select ULTIMATE.start_main_~a~5 v_prenex_2)) 3) (<= v_b_15_1 v_prenex_2) (< v_prenex_2 v_b_14_1))) (forall ((v_prenex_22 Int)) (or (< v_prenex_22 v_b_14_1) (<= v_b_15_1 v_prenex_22) (<= (- (- v_b_11_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_22))) 0))) (forall ((v_prenex_19 Int)) (or (<= v_b_11_1 v_prenex_19) (<= (- v_b_14_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_19))) 2) (< v_prenex_19 v_b_10_1))) (<= (- (- v_b_10_1) (- v_b_11_1)) 2) (forall ((v_prenex_24 Int)) (or (<= v_b_11_1 v_prenex_24) (<= (- ULTIMATE.start_main_~len~5 (- (select ULTIMATE.start_main_~a~5 v_prenex_24))) 3) (< v_prenex_24 v_b_10_1))) (<= (- (- v_b_11_1) v_b_15_1) (- 1)) (<= (- (- v_b_11_1) (- v_b_14_1)) 2) (<= (- ULTIMATE.start_main_~len~5 v_b_11_1) 1) (<= ULTIMATE.start_main_~len~5 (+ v_b_14_1 3)) (<= (* 2 v_b_15_1) 6) (<= 2 (+ v_b_15_1 ULTIMATE.start_main_~len~5)) (forall ((v_prenex_50 Int)) (or (<= v_b_11_1 v_prenex_50) (< v_prenex_50 v_b_10_1) (<= (- (- v_b_14_1) (select ULTIMATE.start_main_~a~5 v_prenex_50)) 0))) (forall ((v_prenex_39 Int)) (or (<= v_b_11_1 v_prenex_39) (< v_prenex_39 v_b_10_1) (<= (- (select ULTIMATE.start_main_~a~5 v_prenex_39) (- (select ULTIMATE.start_main_~a~5 v_prenex_39))) 0))) (<= 0 v_b_14_1) (<= (- (- v_b_14_1) v_b_15_1) (- 1)) (forall ((v_prenex_29 Int)) (or (<= v_b_15_1 v_prenex_29) (<= (- (- v_b_14_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_29))) 0) (< v_prenex_29 v_b_14_1))) (<= v_b_10_1 0) (forall ((v_prenex_45 Int) (v_prenex_44 Int)) (or (<= v_b_11_1 v_prenex_45) (<= (- (- (select ULTIMATE.start_main_~a~5 v_prenex_45)) (select ULTIMATE.start_main_~a~5 v_prenex_44)) 0) (<= v_b_15_1 v_prenex_44) (< v_prenex_44 v_b_14_1) (< v_prenex_45 v_b_10_1))) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_14_1)) 1) (<= (- ULTIMATE.start_main_~len~5 v_b_10_1) 3) (forall ((v_prenex_14 Int)) (or (<= (- (- v_b_10_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_14))) 0) (<= v_b_15_1 v_prenex_14) (< v_prenex_14 v_b_14_1))) (<= (- ULTIMATE.start_main_~len~5 (- v_b_14_1)) 5) (<= (+ v_b_15_1 v_b_10_1) 3) (<= 1 (+ v_b_11_1 ULTIMATE.start_main_~len~5)) (<= v_b_11_1 (+ v_b_10_1 2)) (forall ((v_prenex_30 Int)) (or (< v_prenex_30 v_b_14_1) (<= v_b_15_1 v_prenex_30) (<= (- v_b_15_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_30))) 3))) (<= (- v_b_14_1 (- v_b_14_1)) 4) (<= (- ULTIMATE.start_main_~len~5 v_b_15_1) 2) (<= 0 (* 2 v_b_10_1)) (forall ((v_prenex_43 Int)) (or (<= (- (- v_b_15_1) (select ULTIMATE.start_main_~a~5 v_prenex_43)) (- 1)) (< v_prenex_43 v_b_14_1) (<= v_b_15_1 v_prenex_43))) (forall ((v_prenex_15 Int)) (or (<= (- (- v_b_11_1) (select ULTIMATE.start_main_~a~5 v_prenex_15)) 0) (<= v_b_15_1 v_prenex_15) (< v_prenex_15 v_b_14_1))) (<= (- v_b_10_1 (- v_b_11_1)) 2) (<= (- (- ULTIMATE.start_main_~len~5) v_b_10_1) (- 1)) (<= (- v_b_11_1 v_b_14_1) 2) (<= v_b_11_1 (+ v_b_15_1 1)) (<= 1 (+ v_b_14_1 ULTIMATE.start_main_~len~5)) (<= ULTIMATE.start_main_~len~5 (+ v_b_15_1 2)) (forall ((v_prenex_21 Int)) (or (<= v_b_11_1 v_prenex_21) (< v_prenex_21 v_b_10_1) (<= (- v_b_15_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_21))) 3))) (<= ULTIMATE.start_main_~len~5 (+ v_b_11_1 3)) (<= v_b_15_1 (+ v_b_10_1 3)) (<= (- ULTIMATE.start_main_~len~5 (- v_b_15_1)) 6) (<= (+ v_b_14_1 ULTIMATE.start_main_~len~5) 5) (<= 0 (+ v_b_11_1 v_b_10_1)) (<= (- (- v_b_10_1) (- v_b_14_1)) 2) (forall ((v_prenex_36 Int)) (or (< v_prenex_36 v_b_14_1) (<= v_b_15_1 v_prenex_36) (<= (- ULTIMATE.start_main_~len~5 (- (select ULTIMATE.start_main_~a~5 v_prenex_36))) 3))) (<= v_b_11_1 (+ ULTIMATE.start_main_~len~5 1)) (<= v_b_11_1 2) (<= v_b_10_1 v_b_11_1) (forall ((v_prenex_32 Int) (v_prenex_31 Int)) (or (<= (- (select ULTIMATE.start_main_~a~5 v_prenex_32) (- (select ULTIMATE.start_main_~a~5 v_prenex_31))) 0) (<= v_b_11_1 v_prenex_32) (< v_prenex_32 v_b_10_1) (< v_prenex_31 v_b_14_1) (<= v_b_15_1 v_prenex_31))) (forall ((v_prenex_26 Int)) (or (< v_prenex_26 v_b_10_1) (<= (- v_b_10_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_26))) 0) (<= v_b_11_1 v_prenex_26))) (<= 1 (+ v_b_11_1 v_b_15_1)) (<= (+ v_b_10_1 1) ULTIMATE.start_main_~len~5) (<= (- ULTIMATE.start_main_~len~5 v_b_14_1) 3) (forall ((v_prenex_7 Int)) (or (<= (- v_b_10_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_7))) 0) (<= v_b_15_1 v_prenex_7) (< v_prenex_7 v_b_14_1))) (<= (- v_b_10_1 (- v_b_15_1)) 3) (<= (- (- v_b_10_1) v_b_14_1) 0) (forall ((v_prenex_40 Int)) (or (< v_prenex_40 v_b_10_1) (<= v_b_11_1 v_prenex_40) (<= (- (- ULTIMATE.start_main_~len~5) (select ULTIMATE.start_main_~a~5 v_prenex_40)) (- 1)))) (<= (- v_b_15_1 (- v_b_15_1)) 6) (forall ((v_prenex_27 Int) (v_prenex_28 Int)) (or (<= (- (- (select ULTIMATE.start_main_~a~5 v_prenex_28)) (- (select ULTIMATE.start_main_~a~5 v_prenex_27))) 0) (< v_prenex_28 v_b_10_1) (<= v_b_11_1 v_prenex_28) (< v_prenex_27 v_b_14_1) (<= v_b_15_1 v_prenex_27))) (<= v_b_15_1 (+ v_b_11_1 3)) (<= 0 (* 2 v_b_14_1)) (<= (- (- v_b_10_1) v_b_11_1) 0) (<= v_b_14_1 (+ v_b_15_1 1)) (<= (- (- v_b_11_1) v_b_14_1) 0) (<= (- (- v_b_15_1) v_b_15_1) (- 2)) (<= 0 (+ v_b_11_1 v_b_14_1)) (<= (- v_b_10_1 (- v_b_10_1)) 0) (<= v_b_15_1 (+ ULTIMATE.start_main_~len~5 2)) (<= (- (- v_b_11_1) v_b_11_1) 0) (forall ((v_prenex_4 Int)) (or (< v_prenex_4 v_b_10_1) (<= v_b_11_1 v_prenex_4) (<= (- (- v_b_10_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_4))) 0))) (forall ((v_prenex_49 Int) (v_prenex_48 Int)) (or (< v_prenex_48 v_b_14_1) (< v_prenex_49 v_b_10_1) (<= v_b_11_1 v_prenex_49) (<= v_b_15_1 v_prenex_48) (<= (- (select ULTIMATE.start_main_~a~5 v_prenex_49) (select ULTIMATE.start_main_~a~5 v_prenex_48)) 0))) (forall ((v_prenex_20 Int)) (or (<= v_b_11_1 v_prenex_20) (< v_prenex_20 v_b_10_1) (<= (- (- v_b_14_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_20))) 0))) (<= v_b_14_1 (+ v_b_11_1 2)) (<= v_b_11_1 (+ v_b_14_1 2)) (<= (- v_b_11_1 (- v_b_15_1)) 5) (forall ((v_prenex_18 Int)) (or (<= v_b_15_1 v_prenex_18) (<= (- (- (select ULTIMATE.start_main_~a~5 v_prenex_18)) (select ULTIMATE.start_main_~a~5 v_prenex_18)) 0) (< v_prenex_18 v_b_14_1))) (<= ULTIMATE.start_main_~len~5 (+ v_b_10_1 3)) (forall ((v_prenex_41 Int)) (or (<= v_b_15_1 v_prenex_41) (< v_prenex_41 v_b_14_1) (<= (- v_b_11_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_41))) 2))) (forall ((v_prenex_8 Int)) (or (< v_prenex_8 v_b_10_1) (<= (- (- (select ULTIMATE.start_main_~a~5 v_prenex_8)) (select ULTIMATE.start_main_~a~5 v_prenex_8)) 0) (<= v_b_11_1 v_prenex_8))) (forall ((v_prenex_13 Int)) (or (<= v_b_11_1 v_prenex_13) (<= (- v_b_14_1 (select ULTIMATE.start_main_~a~5 v_prenex_13)) 2) (< v_prenex_13 v_b_10_1))) (forall ((v_prenex_37 Int)) (or (<= (- v_b_10_1 (select ULTIMATE.start_main_~a~5 v_prenex_37)) 0) (<= v_b_11_1 v_prenex_37) (< v_prenex_37 v_b_10_1))) (forall ((v_prenex_11 Int)) (or (< v_prenex_11 v_b_10_1) (<= (- (- v_b_11_1) (select ULTIMATE.start_main_~a~5 v_prenex_11)) 0) (<= v_b_11_1 v_prenex_11))) (<= 2 (* 2 v_b_15_1)) (<= v_b_15_1 3) (<= (+ v_b_11_1 v_b_10_1) 2) (<= 0 v_b_10_1) (<= 1 (+ v_b_15_1 v_b_10_1)) (<= (- v_b_14_1 (- v_b_15_1)) 5) (forall ((v_idx_43 Int)) (or (< v_idx_43 v_b_14_1) (<= (- v_b_10_1 (select ULTIMATE.start_main_~a~5 v_idx_43)) 0) (<= v_b_15_1 v_idx_43))) (<= (+ ULTIMATE.start_main_~len~5 v_b_10_1) 3) (<= (- (- v_b_14_1) v_b_14_1) 0) (<= (- (- v_b_10_1) v_b_10_1) 0) (<= (- v_b_11_1 v_b_15_1) 1) (forall ((v_prenex_3 Int)) (or (<= v_b_11_1 v_prenex_3) (< v_prenex_3 v_b_10_1) (<= (- v_b_11_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_3))) 2))) (<= (- v_b_11_1 (- v_b_11_1)) 4) (forall ((v_prenex_1 Int)) (or (<= (- (- v_b_14_1) (select ULTIMATE.start_main_~a~5 v_prenex_1)) 0) (<= v_b_15_1 v_prenex_1) (< v_prenex_1 v_b_14_1))) (<= (+ v_b_11_1 v_b_15_1) 5) (forall ((v_prenex_46 Int)) (or (< v_prenex_46 v_b_14_1) (<= (- v_b_11_1 (select ULTIMATE.start_main_~a~5 v_prenex_46)) 2) (<= v_b_15_1 v_prenex_46))) (<= (- ULTIMATE.start_main_~len~5 (- v_b_11_1)) 5) (forall ((v_prenex_17 Int)) (or (< v_prenex_17 v_b_14_1) (<= v_b_15_1 v_prenex_17) (<= (- v_b_15_1 (select ULTIMATE.start_main_~a~5 v_prenex_17)) 3))) (forall ((v_prenex_12 Int)) (or (<= v_b_15_1 v_prenex_12) (<= (- (- ULTIMATE.start_main_~len~5) (select ULTIMATE.start_main_~a~5 v_prenex_12)) (- 1)) (< v_prenex_12 v_b_14_1))) (<= 1 (+ ULTIMATE.start_main_~len~5 v_b_10_1)) (<= 1 (+ v_b_14_1 v_b_15_1)) (<= (- (- v_b_10_1) v_b_15_1) (- 1)) (<= (+ v_b_10_1 1) v_b_15_1) (<= v_b_14_1 2) (<= (- v_b_10_1 v_b_11_1) 0) (<= (+ v_b_14_1 v_b_15_1) 5) (forall ((v_prenex_35 Int)) (or (<= v_b_11_1 v_prenex_35) (<= (- v_b_15_1 (select ULTIMATE.start_main_~a~5 v_prenex_35)) 3) (< v_prenex_35 v_b_10_1))) (<= v_b_14_1 (+ ULTIMATE.start_main_~len~5 1)) (<= (- v_b_10_1 v_b_14_1) 0) (<= (- ULTIMATE.start_main_~len~5 (- v_b_10_1)) 3) (forall ((v_idx_41 Int)) (or (<= (- (- v_b_15_1) (select ULTIMATE.start_main_~a~5 v_idx_41)) (- 1)) (<= v_b_11_1 v_idx_41) (< v_idx_41 v_b_10_1))) (forall ((v_prenex_34 Int)) (or (<= (- v_b_14_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_34))) 2) (< v_prenex_34 v_b_14_1) (<= v_b_15_1 v_prenex_34))) (<= 0 (* 2 v_b_11_1)) (<= v_b_15_1 (+ v_b_14_1 3)) (<= 1 v_b_15_1) (<= (- (- ULTIMATE.start_main_~len~5) v_b_15_1) (- 2)) (<= (- (- v_b_10_1) (- v_b_15_1)) 3) (<= (* 2 v_b_10_1) 0) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_11_1)) (- 1)) (forall ((v_prenex_5 Int)) (or (<= v_b_15_1 v_prenex_5) (<= (- (- v_b_15_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_5))) (- 1)) (< v_prenex_5 v_b_14_1))) (forall ((v_prenex_42 Int)) (or (<= (- v_b_14_1 (select ULTIMATE.start_main_~a~5 v_prenex_42)) 2) (< v_prenex_42 v_b_14_1) (<= v_b_15_1 v_prenex_42))) (<= 0 (+ v_b_14_1 v_b_10_1)) (<= (* 2 v_b_11_1) 4) (<= (+ v_b_11_1 v_b_14_1) 4) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_10_1)) (- 1)) (forall ((v_prenex_23 Int)) (or (< v_prenex_23 v_b_10_1) (<= (- (- v_b_11_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_23))) 0) (<= v_b_11_1 v_prenex_23))) (<= (- v_b_10_1 v_b_15_1) (- 1)) (<= (- (- ULTIMATE.start_main_~len~5) v_b_14_1) (- 1)) (<= (+ v_b_11_1 ULTIMATE.start_main_~len~5) 5) (<= (- v_b_14_1 v_b_15_1) 1))) (<= 2 (* 2 ULTIMATE.start_main_~len~5)) (<= ULTIMATE.start_main_~len~5 3) (<= (* 2 ULTIMATE.start_main_~len~5) 6) (<= (- ULTIMATE.start_main_~len~5 (- ULTIMATE.start_main_~len~5)) 6) (<= (- (- ULTIMATE.start_main_~len~5) ULTIMATE.start_main_~len~5) (- 2))) (and (<= 0 (+ ULTIMATE.start_main_~len~5 10)) (<= ULTIMATE.start_main_~len~5 6) (<= 0 (+ ULTIMATE.start_main_~len~5 17)) (<= (* 2 ULTIMATE.start_main_~len~5) 16) (<= 0 (+ ULTIMATE.start_main_~len~5 13)) (<= 0 (+ (* 2 ULTIMATE.start_main_~len~5) 6)) (<= 0 (+ (* 2 ULTIMATE.start_main_~len~5) 12)) (<= 0 (+ ULTIMATE.start_main_~len~5 1)) (<= 0 (+ (* 2 ULTIMATE.start_main_~len~5) 22)) (<= 0 (+ ULTIMATE.start_main_~len~5 23)) (<= 0 (+ (* 2 ULTIMATE.start_main_~len~5) 10)) (<= 0 (+ ULTIMATE.start_main_~len~5 4)) (<= ULTIMATE.start_main_~len~5 4) (<= 0 (+ ULTIMATE.start_main_~len~5 15)) (<= 0 (* 2 ULTIMATE.start_main_~len~5)) (<= ULTIMATE.start_main_~len~5 22) (<= ULTIMATE.start_main_~len~5 26) (<= 0 (+ ULTIMATE.start_main_~len~5 19)) (<= 0 (+ ULTIMATE.start_main_~len~5 7)) (<= 0 (+ ULTIMATE.start_main_~len~5 2)) (<= 0 (+ (* 2 ULTIMATE.start_main_~len~5) 2)) (<= ULTIMATE.start_main_~len~5 5) (<= 0 (+ (* 2 ULTIMATE.start_main_~len~5) 4)) (<= ULTIMATE.start_main_~len~5 31) (<= 0 (+ (* 2 ULTIMATE.start_main_~len~5) 26)) (<= (* 2 ULTIMATE.start_main_~len~5) 30) (<= 0 (+ ULTIMATE.start_main_~len~5 20)) (<= 0 (+ ULTIMATE.start_main_~len~5 22)) (<= 0 (+ ULTIMATE.start_main_~len~5 24)) (<= ULTIMATE.start_main_~len~5 17) (<= ULTIMATE.start_main_~len~5 13) (<= 0 (+ ULTIMATE.start_main_~len~5 3)) (<= ULTIMATE.start_main_~len~5 27) (<= ULTIMATE.start_main_~len~5 3) (<= (* 2 ULTIMATE.start_main_~len~5) 26) (<= ULTIMATE.start_main_~len~5 14) (<= 0 (+ (* 2 ULTIMATE.start_main_~len~5) 24)) (<= 0 (+ ULTIMATE.start_main_~len~5 26)) (<= (- ULTIMATE.start_main_~len~5 (- ULTIMATE.start_main_~len~5)) 6) (<= ULTIMATE.start_main_~len~5 12) (<= ULTIMATE.start_main_~len~5 7) (<= ULTIMATE.start_main_~len~5 28) (<= 0 (+ ULTIMATE.start_main_~len~5 18)) (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 23) (<= ULTIMATE.start_main_~len~5 15) (<= (* 2 ULTIMATE.start_main_~len~5) 22) (<= ULTIMATE.start_main_~len~5 24) (<= (* 2 ULTIMATE.start_main_~len~5) 8) (<= ULTIMATE.start_main_~len~5 29) (<= ULTIMATE.start_main_~len~5 30) (<= (* 2 ULTIMATE.start_main_~len~5) 6) (<= (- (- ULTIMATE.start_main_~len~5) ULTIMATE.start_main_~len~5) (- 2)) (<= 0 ULTIMATE.start_main_~len~5) (<= (* 2 ULTIMATE.start_main_~len~5) 24) (<= 0 (+ (* 2 ULTIMATE.start_main_~len~5) 16)) (<= ULTIMATE.start_main_~len~5 25) (<= ULTIMATE.start_main_~len~5 10) (<= (* 2 ULTIMATE.start_main_~len~5) 34) (<= 0 (+ ULTIMATE.start_main_~len~5 11)) (<= 0 (+ ULTIMATE.start_main_~len~5 21)) (<= (* 2 ULTIMATE.start_main_~len~5) 12) (<= 0 (+ (* 2 ULTIMATE.start_main_~len~5) 14)) (<= 0 (+ ULTIMATE.start_main_~len~5 27)) (<= ULTIMATE.start_main_~len~5 8) (<= (* 2 ULTIMATE.start_main_~len~5) 32) (<= 0 (+ ULTIMATE.start_main_~len~5 6)) (<= ULTIMATE.start_main_~len~5 20) (<= (* 2 ULTIMATE.start_main_~len~5) 10) (<= 0 (+ ULTIMATE.start_main_~len~5 25)) (<= 0 (+ ULTIMATE.start_main_~len~5 9)) (<= 0 (+ ULTIMATE.start_main_~len~5 14)) (<= 0 (+ (* 2 ULTIMATE.start_main_~len~5) 18)) (<= (* 2 ULTIMATE.start_main_~len~5) 20) (<= 0 (+ ULTIMATE.start_main_~len~5 8)) (<= 0 (+ ULTIMATE.start_main_~len~5 16)) (<= 0 (+ ULTIMATE.start_main_~len~5 5)) (<= ULTIMATE.start_main_~len~5 21) (<= ULTIMATE.start_main_~len~5 9) (<= (* 2 ULTIMATE.start_main_~len~5) 28) (<= (* 2 ULTIMATE.start_main_~len~5) 14) (<= ULTIMATE.start_main_~len~5 18) (<= 2 (* 2 ULTIMATE.start_main_~len~5)) (<= ULTIMATE.start_main_~len~5 19) (<= ULTIMATE.start_main_~len~5 11) (<= 0 (+ (* 2 ULTIMATE.start_main_~len~5) 20)) (<= 0 (+ ULTIMATE.start_main_~len~5 12)) (<= 0 (+ (* 2 ULTIMATE.start_main_~len~5) 8)) (<= ULTIMATE.start_main_~len~5 16) (<= (* 2 ULTIMATE.start_main_~len~5) 18)) (and (<= 1 ULTIMATE.start_main_~len~5) (<= 2 (* 2 ULTIMATE.start_main_~len~5)) (<= ULTIMATE.start_main_~len~5 3) (<= (* 2 ULTIMATE.start_main_~len~5) 6) (exists ((v_b_11_1 Int) (v_b_14_1 Int) (v_b_15_1 Int) (v_b_10_1 Int)) (and (<= (- (- ULTIMATE.start_main_~len~5) v_b_11_1) (- 1)) (<= 0 v_b_11_1) (<= (- (- v_b_14_1) (- v_b_15_1)) 3) (forall ((v_prenex_47 Int)) (or (< v_prenex_47 v_b_10_1) (<= v_b_11_1 v_prenex_47) (<= (- (- v_b_15_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_47))) (- 1)))) (<= (- v_b_11_1 (- v_b_14_1)) 4) (forall ((v_prenex_33 Int)) (or (<= (- ULTIMATE.start_main_~len~5 (select ULTIMATE.start_main_~a~5 v_prenex_33)) 3) (< v_prenex_33 v_b_10_1) (<= v_b_11_1 v_prenex_33))) (forall ((v_prenex_25 Int)) (or (<= v_b_11_1 v_prenex_25) (< v_prenex_25 v_b_10_1) (<= (- (- v_b_10_1) (select ULTIMATE.start_main_~a~5 v_prenex_25)) 0))) (<= v_b_10_1 v_b_14_1) (<= v_b_14_1 (+ v_b_10_1 2)) (<= (- (- v_b_11_1) (- v_b_15_1)) 3) (forall ((v_prenex_6 Int)) (or (<= (- (- ULTIMATE.start_main_~len~5) (- (select ULTIMATE.start_main_~a~5 v_prenex_6))) (- 1)) (<= v_b_11_1 v_prenex_6) (< v_prenex_6 v_b_10_1))) (<= (+ v_b_14_1 v_b_10_1) 2) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_15_1)) 2) (<= (+ v_b_15_1 ULTIMATE.start_main_~len~5) 6) (<= (* 2 v_b_14_1) 4) (<= (- v_b_10_1 (- v_b_14_1)) 2) (forall ((v_prenex_38 Int)) (or (< v_prenex_38 v_b_10_1) (<= v_b_11_1 v_prenex_38) (<= (- v_b_11_1 (select ULTIMATE.start_main_~a~5 v_prenex_38)) 2))) (forall ((v_prenex_19 Int)) (or (<= v_b_11_1 v_prenex_19) (<= (- v_b_14_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_19))) 2) (< v_prenex_19 v_b_10_1))) (<= (- (- v_b_10_1) (- v_b_11_1)) 2) (forall ((v_prenex_24 Int)) (or (<= v_b_11_1 v_prenex_24) (<= (- ULTIMATE.start_main_~len~5 (- (select ULTIMATE.start_main_~a~5 v_prenex_24))) 3) (< v_prenex_24 v_b_10_1))) (<= (- (- v_b_11_1) v_b_15_1) (- 1)) (<= (- (- v_b_11_1) (- v_b_14_1)) 2) (<= (- ULTIMATE.start_main_~len~5 v_b_11_1) 1) (<= ULTIMATE.start_main_~len~5 (+ v_b_14_1 3)) (<= (* 2 v_b_15_1) 6) (<= 2 (+ v_b_15_1 ULTIMATE.start_main_~len~5)) (forall ((v_prenex_50 Int)) (or (<= v_b_11_1 v_prenex_50) (< v_prenex_50 v_b_10_1) (<= (- (- v_b_14_1) (select ULTIMATE.start_main_~a~5 v_prenex_50)) 0))) (forall ((v_prenex_39 Int)) (or (<= v_b_11_1 v_prenex_39) (< v_prenex_39 v_b_10_1) (<= (- (select ULTIMATE.start_main_~a~5 v_prenex_39) (- (select ULTIMATE.start_main_~a~5 v_prenex_39))) 0))) (<= 0 v_b_14_1) (< v_b_11_1 (+ v_b_10_1 1)) (<= (- (- v_b_14_1) v_b_15_1) (- 1)) (<= v_b_10_1 0) (forall ((v_prenex_45 Int) (v_prenex_44 Int)) (or (<= v_b_11_1 v_prenex_45) (<= (- (- (select ULTIMATE.start_main_~a~5 v_prenex_45)) (select ULTIMATE.start_main_~a~5 v_prenex_44)) 0) (<= v_b_15_1 v_prenex_44) (< v_prenex_44 v_b_14_1) (< v_prenex_45 v_b_10_1))) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_14_1)) 1) (<= (- ULTIMATE.start_main_~len~5 v_b_10_1) 3) (<= (- ULTIMATE.start_main_~len~5 (- v_b_14_1)) 5) (<= (+ v_b_15_1 v_b_10_1) 3) (<= 1 (+ v_b_11_1 ULTIMATE.start_main_~len~5)) (<= v_b_11_1 (+ v_b_10_1 2)) (<= (- v_b_14_1 (- v_b_14_1)) 4) (<= (- ULTIMATE.start_main_~len~5 v_b_15_1) 2) (<= 0 (* 2 v_b_10_1)) (<= (- v_b_10_1 (- v_b_11_1)) 2) (<= (- (- ULTIMATE.start_main_~len~5) v_b_10_1) (- 1)) (<= (- v_b_11_1 v_b_14_1) 2) (<= v_b_11_1 (+ v_b_15_1 1)) (<= 1 (+ v_b_14_1 ULTIMATE.start_main_~len~5)) (<= ULTIMATE.start_main_~len~5 (+ v_b_15_1 2)) (forall ((v_prenex_21 Int)) (or (<= v_b_11_1 v_prenex_21) (< v_prenex_21 v_b_10_1) (<= (- v_b_15_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_21))) 3))) (<= ULTIMATE.start_main_~len~5 (+ v_b_11_1 3)) (<= v_b_15_1 (+ v_b_10_1 3)) (<= (- ULTIMATE.start_main_~len~5 (- v_b_15_1)) 6) (<= (+ v_b_14_1 ULTIMATE.start_main_~len~5) 5) (<= 0 (+ v_b_11_1 v_b_10_1)) (<= (- (- v_b_10_1) (- v_b_14_1)) 2) (<= v_b_11_1 (+ ULTIMATE.start_main_~len~5 1)) (<= v_b_11_1 2) (<= v_b_10_1 v_b_11_1) (forall ((v_prenex_32 Int) (v_prenex_31 Int)) (or (<= (- (select ULTIMATE.start_main_~a~5 v_prenex_32) (- (select ULTIMATE.start_main_~a~5 v_prenex_31))) 0) (<= v_b_11_1 v_prenex_32) (< v_prenex_32 v_b_10_1) (< v_prenex_31 v_b_14_1) (<= v_b_15_1 v_prenex_31))) (forall ((v_prenex_26 Int)) (or (< v_prenex_26 v_b_10_1) (<= (- v_b_10_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_26))) 0) (<= v_b_11_1 v_prenex_26))) (<= 1 (+ v_b_11_1 v_b_15_1)) (<= (+ v_b_10_1 1) ULTIMATE.start_main_~len~5) (<= (- ULTIMATE.start_main_~len~5 v_b_14_1) 3) (<= (- v_b_10_1 (- v_b_15_1)) 3) (<= (- (- v_b_10_1) v_b_14_1) 0) (forall ((v_prenex_40 Int)) (or (< v_prenex_40 v_b_10_1) (<= v_b_11_1 v_prenex_40) (<= (- (- ULTIMATE.start_main_~len~5) (select ULTIMATE.start_main_~a~5 v_prenex_40)) (- 1)))) (<= (- v_b_15_1 (- v_b_15_1)) 6) (forall ((v_prenex_27 Int) (v_prenex_28 Int)) (or (<= (- (- (select ULTIMATE.start_main_~a~5 v_prenex_28)) (- (select ULTIMATE.start_main_~a~5 v_prenex_27))) 0) (< v_prenex_28 v_b_10_1) (<= v_b_11_1 v_prenex_28) (< v_prenex_27 v_b_14_1) (<= v_b_15_1 v_prenex_27))) (<= v_b_15_1 (+ v_b_11_1 3)) (<= 0 (* 2 v_b_14_1)) (<= (- (- v_b_10_1) v_b_11_1) 0) (<= v_b_14_1 (+ v_b_15_1 1)) (<= (- (- v_b_11_1) v_b_14_1) 0) (<= (- (- v_b_15_1) v_b_15_1) (- 2)) (<= 0 (+ v_b_11_1 v_b_14_1)) (<= (- v_b_10_1 (- v_b_10_1)) 0) (<= v_b_15_1 (+ ULTIMATE.start_main_~len~5 2)) (<= (- (- v_b_11_1) v_b_11_1) 0) (forall ((v_prenex_4 Int)) (or (< v_prenex_4 v_b_10_1) (<= v_b_11_1 v_prenex_4) (<= (- (- v_b_10_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_4))) 0))) (forall ((v_prenex_49 Int) (v_prenex_48 Int)) (or (< v_prenex_48 v_b_14_1) (< v_prenex_49 v_b_10_1) (<= v_b_11_1 v_prenex_49) (<= v_b_15_1 v_prenex_48) (<= (- (select ULTIMATE.start_main_~a~5 v_prenex_49) (select ULTIMATE.start_main_~a~5 v_prenex_48)) 0))) (forall ((v_prenex_20 Int)) (or (<= v_b_11_1 v_prenex_20) (< v_prenex_20 v_b_10_1) (<= (- (- v_b_14_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_20))) 0))) (<= v_b_14_1 (+ v_b_11_1 2)) (<= v_b_11_1 (+ v_b_14_1 2)) (<= (- v_b_11_1 (- v_b_15_1)) 5) (<= ULTIMATE.start_main_~len~5 (+ v_b_10_1 3)) (forall ((v_prenex_8 Int)) (or (< v_prenex_8 v_b_10_1) (<= (- (- (select ULTIMATE.start_main_~a~5 v_prenex_8)) (select ULTIMATE.start_main_~a~5 v_prenex_8)) 0) (<= v_b_11_1 v_prenex_8))) (forall ((v_prenex_13 Int)) (or (<= v_b_11_1 v_prenex_13) (<= (- v_b_14_1 (select ULTIMATE.start_main_~a~5 v_prenex_13)) 2) (< v_prenex_13 v_b_10_1))) (forall ((v_prenex_37 Int)) (or (<= (- v_b_10_1 (select ULTIMATE.start_main_~a~5 v_prenex_37)) 0) (<= v_b_11_1 v_prenex_37) (< v_prenex_37 v_b_10_1))) (forall ((v_prenex_11 Int)) (or (< v_prenex_11 v_b_10_1) (<= (- (- v_b_11_1) (select ULTIMATE.start_main_~a~5 v_prenex_11)) 0) (<= v_b_11_1 v_prenex_11))) (<= 2 (* 2 v_b_15_1)) (<= v_b_15_1 3) (<= (+ v_b_11_1 v_b_10_1) 2) (<= 0 v_b_10_1) (<= 1 (+ v_b_15_1 v_b_10_1)) (<= (- v_b_14_1 (- v_b_15_1)) 5) (<= (+ ULTIMATE.start_main_~len~5 v_b_10_1) 3) (<= (- (- v_b_14_1) v_b_14_1) 0) (<= (- (- v_b_10_1) v_b_10_1) 0) (<= (- v_b_11_1 v_b_15_1) 1) (forall ((v_prenex_3 Int)) (or (<= v_b_11_1 v_prenex_3) (< v_prenex_3 v_b_10_1) (<= (- v_b_11_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_3))) 2))) (<= (- v_b_11_1 (- v_b_11_1)) 4) (<= (+ v_b_11_1 v_b_15_1) 5) (<= (- ULTIMATE.start_main_~len~5 (- v_b_11_1)) 5) (<= 1 (+ ULTIMATE.start_main_~len~5 v_b_10_1)) (<= 1 (+ v_b_14_1 v_b_15_1)) (<= (- (- v_b_10_1) v_b_15_1) (- 1)) (<= (+ v_b_10_1 1) v_b_15_1) (<= v_b_14_1 2) (<= (- v_b_10_1 v_b_11_1) 0) (<= (+ v_b_14_1 v_b_15_1) 5) (forall ((v_prenex_35 Int)) (or (<= v_b_11_1 v_prenex_35) (<= (- v_b_15_1 (select ULTIMATE.start_main_~a~5 v_prenex_35)) 3) (< v_prenex_35 v_b_10_1))) (<= v_b_14_1 (+ ULTIMATE.start_main_~len~5 1)) (<= (- v_b_10_1 v_b_14_1) 0) (<= (- ULTIMATE.start_main_~len~5 (- v_b_10_1)) 3) (forall ((v_idx_41 Int)) (or (<= (- (- v_b_15_1) (select ULTIMATE.start_main_~a~5 v_idx_41)) (- 1)) (<= v_b_11_1 v_idx_41) (< v_idx_41 v_b_10_1))) (<= 0 (* 2 v_b_11_1)) (<= v_b_15_1 (+ v_b_14_1 3)) (<= 1 v_b_15_1) (<= (- (- ULTIMATE.start_main_~len~5) v_b_15_1) (- 2)) (<= (- (- v_b_10_1) (- v_b_15_1)) 3) (<= (* 2 v_b_10_1) 0) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_11_1)) (- 1)) (<= 0 (+ v_b_14_1 v_b_10_1)) (<= (* 2 v_b_11_1) 4) (<= (+ v_b_11_1 v_b_14_1) 4) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_10_1)) (- 1)) (forall ((v_prenex_23 Int)) (or (< v_prenex_23 v_b_10_1) (<= (- (- v_b_11_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_23))) 0) (<= v_b_11_1 v_prenex_23))) (<= (- v_b_10_1 v_b_15_1) (- 1)) (<= (- (- ULTIMATE.start_main_~len~5) v_b_14_1) (- 1)) (<= (+ v_b_11_1 ULTIMATE.start_main_~len~5) 5) (<= (- v_b_14_1 v_b_15_1) 1))) (<= (- ULTIMATE.start_main_~len~5 (- ULTIMATE.start_main_~len~5)) 6) (<= (- (- ULTIMATE.start_main_~len~5) ULTIMATE.start_main_~len~5) (- 2))) (and (<= 1 ULTIMATE.start_main_~len~5) (<= 2 (* 2 ULTIMATE.start_main_~len~5)) (<= ULTIMATE.start_main_~len~5 3) (<= (* 2 ULTIMATE.start_main_~len~5) 6) (<= (- ULTIMATE.start_main_~len~5 (- ULTIMATE.start_main_~len~5)) 6) (<= (- (- ULTIMATE.start_main_~len~5) ULTIMATE.start_main_~len~5) (- 2)) (exists ((v_b_11_1 Int) (v_b_14_1 Int) (v_b_15_1 Int) (v_b_10_1 Int)) (and (<= (- (- ULTIMATE.start_main_~len~5) v_b_11_1) (- 1)) (<= 0 v_b_11_1) (<= (- (- v_b_14_1) (- v_b_15_1)) 3) (<= (- v_b_11_1 (- v_b_14_1)) 4) (<= v_b_10_1 v_b_14_1) (<= v_b_14_1 (+ v_b_10_1 2)) (<= (- (- v_b_11_1) (- v_b_15_1)) 3) (<= (+ v_b_14_1 v_b_10_1) 2) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_15_1)) 2) (<= (+ v_b_15_1 ULTIMATE.start_main_~len~5) 6) (<= (* 2 v_b_14_1) 4) (<= (- v_b_10_1 (- v_b_14_1)) 2) (<= (- (- v_b_10_1) (- v_b_11_1)) 2) (<= (- (- v_b_11_1) v_b_15_1) (- 1)) (<= (- (- v_b_11_1) (- v_b_14_1)) 2) (<= (- ULTIMATE.start_main_~len~5 v_b_11_1) 1) (<= ULTIMATE.start_main_~len~5 (+ v_b_14_1 3)) (<= (* 2 v_b_15_1) 6) (<= 2 (+ v_b_15_1 ULTIMATE.start_main_~len~5)) (<= 0 v_b_14_1) (< v_b_11_1 (+ v_b_10_1 1)) (<= (- (- v_b_14_1) v_b_15_1) (- 1)) (<= v_b_10_1 0) (forall ((v_prenex_45 Int) (v_prenex_44 Int)) (or (<= v_b_11_1 v_prenex_45) (<= (- (- (select ULTIMATE.start_main_~a~5 v_prenex_45)) (select ULTIMATE.start_main_~a~5 v_prenex_44)) 0) (<= v_b_15_1 v_prenex_44) (< v_prenex_44 v_b_14_1) (< v_prenex_45 v_b_10_1))) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_14_1)) 1) (<= (- ULTIMATE.start_main_~len~5 v_b_10_1) 3) (<= (- ULTIMATE.start_main_~len~5 (- v_b_14_1)) 5) (<= (+ v_b_15_1 v_b_10_1) 3) (<= 1 (+ v_b_11_1 ULTIMATE.start_main_~len~5)) (<= v_b_11_1 (+ v_b_10_1 2)) (<= (- v_b_14_1 (- v_b_14_1)) 4) (<= (- ULTIMATE.start_main_~len~5 v_b_15_1) 2) (<= 0 (* 2 v_b_10_1)) (<= (- v_b_10_1 (- v_b_11_1)) 2) (<= (- (- ULTIMATE.start_main_~len~5) v_b_10_1) (- 1)) (<= (- v_b_11_1 v_b_14_1) 2) (<= v_b_11_1 (+ v_b_15_1 1)) (<= 1 (+ v_b_14_1 ULTIMATE.start_main_~len~5)) (<= ULTIMATE.start_main_~len~5 (+ v_b_15_1 2)) (<= ULTIMATE.start_main_~len~5 (+ v_b_11_1 3)) (<= v_b_15_1 (+ v_b_10_1 3)) (<= (- ULTIMATE.start_main_~len~5 (- v_b_15_1)) 6) (<= (+ v_b_14_1 ULTIMATE.start_main_~len~5) 5) (<= 0 (+ v_b_11_1 v_b_10_1)) (<= (- (- v_b_10_1) (- v_b_14_1)) 2) (<= v_b_11_1 (+ ULTIMATE.start_main_~len~5 1)) (<= v_b_11_1 2) (<= v_b_10_1 v_b_11_1) (forall ((v_prenex_32 Int) (v_prenex_31 Int)) (or (<= (- (select ULTIMATE.start_main_~a~5 v_prenex_32) (- (select ULTIMATE.start_main_~a~5 v_prenex_31))) 0) (<= v_b_11_1 v_prenex_32) (< v_prenex_32 v_b_10_1) (< v_prenex_31 v_b_14_1) (<= v_b_15_1 v_prenex_31))) (<= 1 (+ v_b_11_1 v_b_15_1)) (< v_b_15_1 (+ v_b_14_1 1)) (<= (+ v_b_10_1 1) ULTIMATE.start_main_~len~5) (<= (- ULTIMATE.start_main_~len~5 v_b_14_1) 3) (<= (- v_b_10_1 (- v_b_15_1)) 3) (<= (- (- v_b_10_1) v_b_14_1) 0) (<= (- v_b_15_1 (- v_b_15_1)) 6) (forall ((v_prenex_27 Int) (v_prenex_28 Int)) (or (<= (- (- (select ULTIMATE.start_main_~a~5 v_prenex_28)) (- (select ULTIMATE.start_main_~a~5 v_prenex_27))) 0) (< v_prenex_28 v_b_10_1) (<= v_b_11_1 v_prenex_28) (< v_prenex_27 v_b_14_1) (<= v_b_15_1 v_prenex_27))) (<= v_b_15_1 (+ v_b_11_1 3)) (<= 0 (* 2 v_b_14_1)) (<= (- (- v_b_10_1) v_b_11_1) 0) (<= v_b_14_1 (+ v_b_15_1 1)) (<= (- (- v_b_11_1) v_b_14_1) 0) (<= (- (- v_b_15_1) v_b_15_1) (- 2)) (<= 0 (+ v_b_11_1 v_b_14_1)) (<= (- v_b_10_1 (- v_b_10_1)) 0) (<= v_b_15_1 (+ ULTIMATE.start_main_~len~5 2)) (<= (- (- v_b_11_1) v_b_11_1) 0) (forall ((v_prenex_49 Int) (v_prenex_48 Int)) (or (< v_prenex_48 v_b_14_1) (< v_prenex_49 v_b_10_1) (<= v_b_11_1 v_prenex_49) (<= v_b_15_1 v_prenex_48) (<= (- (select ULTIMATE.start_main_~a~5 v_prenex_49) (select ULTIMATE.start_main_~a~5 v_prenex_48)) 0))) (<= v_b_14_1 (+ v_b_11_1 2)) (<= v_b_11_1 (+ v_b_14_1 2)) (<= (- v_b_11_1 (- v_b_15_1)) 5) (<= ULTIMATE.start_main_~len~5 (+ v_b_10_1 3)) (<= 2 (* 2 v_b_15_1)) (<= v_b_15_1 3) (<= (+ v_b_11_1 v_b_10_1) 2) (<= 0 v_b_10_1) (<= 1 (+ v_b_15_1 v_b_10_1)) (<= (- v_b_14_1 (- v_b_15_1)) 5) (<= (+ ULTIMATE.start_main_~len~5 v_b_10_1) 3) (<= (- (- v_b_14_1) v_b_14_1) 0) (<= (- (- v_b_10_1) v_b_10_1) 0) (<= (- v_b_11_1 v_b_15_1) 1) (<= (- v_b_11_1 (- v_b_11_1)) 4) (<= (+ v_b_11_1 v_b_15_1) 5) (<= (- ULTIMATE.start_main_~len~5 (- v_b_11_1)) 5) (<= 1 (+ ULTIMATE.start_main_~len~5 v_b_10_1)) (<= 1 (+ v_b_14_1 v_b_15_1)) (<= (- (- v_b_10_1) v_b_15_1) (- 1)) (<= (+ v_b_10_1 1) v_b_15_1) (<= v_b_14_1 2) (<= (- v_b_10_1 v_b_11_1) 0) (<= (+ v_b_14_1 v_b_15_1) 5) (<= v_b_14_1 (+ ULTIMATE.start_main_~len~5 1)) (<= (- v_b_10_1 v_b_14_1) 0) (<= (- ULTIMATE.start_main_~len~5 (- v_b_10_1)) 3) (<= 0 (* 2 v_b_11_1)) (<= v_b_15_1 (+ v_b_14_1 3)) (<= 1 v_b_15_1) (<= (- (- ULTIMATE.start_main_~len~5) v_b_15_1) (- 2)) (<= (- (- v_b_10_1) (- v_b_15_1)) 3) (<= (* 2 v_b_10_1) 0) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_11_1)) (- 1)) (<= 0 (+ v_b_14_1 v_b_10_1)) (<= (* 2 v_b_11_1) 4) (<= (+ v_b_11_1 v_b_14_1) 4) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_10_1)) (- 1)) (<= (- v_b_10_1 v_b_15_1) (- 1)) (<= (- (- ULTIMATE.start_main_~len~5) v_b_14_1) (- 1)) (<= (+ v_b_11_1 ULTIMATE.start_main_~len~5) 5) (<= (- v_b_14_1 v_b_15_1) 1)))))} [2018-12-19 12:35:07,713 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2018-12-19 12:35:07,714 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2018-12-19 12:35:07,714 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2018-12-19 12:35:07,714 WARN L223 ngHoareTripleChecker]: -- [2018-12-19 12:35:07,714 WARN L224 ngHoareTripleChecker]: Pre: {2147483601#(or (and (<= (- (- c_ULTIMATE.start_main_~len~5) c_ULTIMATE.start_main_~len~5) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- c_ULTIMATE.start_main_~len~5)) 4294967296)) (and (<= (- (- c_ULTIMATE.start_main_~len~5) c_ULTIMATE.start_main_~len~5) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- c_ULTIMATE.start_main_~len~5)) 1024)))} [2018-12-19 12:35:07,715 WARN L228 ngHoareTripleChecker]: Action: assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; [2018-12-19 12:35:07,715 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (= 4 (mod c_ULTIMATE.start_main_~len~5 4294967296))) (= c_ULTIMATE.start_main_~a~5_primed (store c_ULTIMATE.start_main_~a~5 (mod c_ULTIMATE.start_main_~len~5 4294967296) 0)) (not (= 0 (mod |c_ULTIMATE.start_main_#t~nondet0| 256))) (= (+ c_ULTIMATE.start_main_~len~5 1) c_ULTIMATE.start_main_~len~5_primed)) [2018-12-19 12:35:07,715 WARN L230 ngHoareTripleChecker]: Post: {2147483600#(exists ((v_v_1018_1 Int) (v_b_58_1 Int) (v_b_57_1 Int)) (and (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_58_1) (- 2)) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_58_1)) 4294967298) (forall ((v_idx_89 Int) (v_idx_87 Int) (v_idx_88 Int)) (or (<= v_b_58_1 v_idx_88) (< v_idx_89 v_b_58_1) (and (<= (- (- c_ULTIMATE.start_main_~len~5) (select c_ULTIMATE.start_main_~a~5 v_idx_88)) (- 1)) (<= (- (- v_b_58_1) (select c_ULTIMATE.start_main_~a~5 v_idx_88)) (- 1)) (<= (- v_b_57_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_88))) 2147483648) (<= (- c_ULTIMATE.start_main_~len~5 (- (select c_ULTIMATE.start_main_~a~5 v_idx_88))) 2147483649) (<= (- v_b_57_1 (select c_ULTIMATE.start_main_~a~5 v_idx_88)) 2147483648) (<= (- v_b_58_1 (select c_ULTIMATE.start_main_~a~5 v_idx_88)) 2147483649) (<= (- (- c_ULTIMATE.start_main_~len~5) (- (select c_ULTIMATE.start_main_~a~5 v_idx_88))) (- 1)) (<= (- v_b_58_1 (- (select c_ULTIMATE.start_main_~a~5 v_idx_88))) 2147483649) (<= (- (- (select c_ULTIMATE.start_main_~a~5 v_idx_88)) (select c_ULTIMATE.start_main_~a~5 v_idx_88)) 0) (<= (- (- v_b_58_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_88))) (- 1)) (<= (- (select c_ULTIMATE.start_main_~a~5 v_idx_88) (- (select c_ULTIMATE.start_main_~a~5 v_idx_88))) 0) (<= (- c_ULTIMATE.start_main_~len~5 (select c_ULTIMATE.start_main_~a~5 v_idx_88)) 2147483649) (<= (- (- v_b_57_1) (select c_ULTIMATE.start_main_~a~5 v_idx_88)) 0) (<= (- (- v_b_57_1) (- (select c_ULTIMATE.start_main_~a~5 v_idx_88))) 0)) (<= v_b_57_1 v_idx_87) (< v_idx_88 v_b_57_1))) (<= (- v_b_58_1 (- v_b_58_1)) 4294967298) (<= (- c_ULTIMATE.start_main_~len~5 v_b_57_1) 2147483649) (<= (- (- v_b_58_1) v_v_1018_1) (- 1)) (<= (- v_b_57_1 (- v_v_1018_1)) 2147483648) (<= (- (- c_ULTIMATE.start_main_~len~5) c_ULTIMATE.start_main_~len~5) (- 2)) (<= (- (- v_b_57_1) (- v_b_58_1)) 2147483649) (<= (- v_b_57_1 v_v_1018_1) 2147483648) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_57_1)) 2147483647) (<= (- v_b_58_1 (- v_v_1018_1)) 2147483649) (<= (- c_ULTIMATE.start_main_~len~5 (- v_b_57_1)) 4294967297) (<= (- (- v_b_57_1) (- v_v_1018_1)) 0) (<= (- (- v_b_57_1) v_b_57_1) 0) (<= (- (- c_ULTIMATE.start_main_~len~5) v_v_1018_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_b_58_1)) 2147483648) (<= (- v_b_57_1 v_b_58_1) 2147483647) (<= (- (- v_b_57_1) v_b_58_1) (- 1)) (<= (- c_ULTIMATE.start_main_~len~5 (- v_v_1018_1)) 2147483649) (<= (- v_b_57_1 (- v_b_57_1)) 4294967296) (<= (- c_ULTIMATE.start_main_~len~5 v_b_58_1) 2147483648) (<= (- v_b_58_1 v_v_1018_1) 2147483649) (<= (- (- c_ULTIMATE.start_main_~len~5) (- v_v_1018_1)) (- 1)) (<= (- (- c_ULTIMATE.start_main_~len~5) v_b_57_1) (- 1)) (<= (- (- v_v_1018_1) v_v_1018_1) 0) (<= (- (- v_b_58_1) (- v_v_1018_1)) (- 1)) (<= (- v_v_1018_1 (- v_v_1018_1)) 0) (<= (- c_ULTIMATE.start_main_~len~5 (- c_ULTIMATE.start_main_~len~5)) 4294967298) (<= (- (- v_b_58_1) v_b_58_1) (- 2)) (<= (- c_ULTIMATE.start_main_~len~5 v_v_1018_1) 2147483649) (<= (- (- v_b_57_1) v_v_1018_1) 0) (<= (- v_b_57_1 (- v_b_58_1)) 4294967297)))} [2018-12-19 12:35:07,715 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2018-12-19 12:35:07,729 WARN L268 ngHoareTripleChecker]: -- [2018-12-19 12:35:07,730 WARN L269 ngHoareTripleChecker]: Simplified triple [2018-12-19 12:35:07,828 WARN L270 ngHoareTripleChecker]: Pre: {2147483601#(and (<= (- (- ULTIMATE.start_main_~len~5) ULTIMATE.start_main_~len~5) 0) (<= (- ULTIMATE.start_main_~len~5 (- ULTIMATE.start_main_~len~5)) 4294967296))} [2018-12-19 12:35:07,828 WARN L274 ngHoareTripleChecker]: Action: assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; [2018-12-19 12:35:07,829 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (= 4 (mod c_ULTIMATE.start_main_~len~5 4294967296))) (= c_ULTIMATE.start_main_~a~5_primed (store c_ULTIMATE.start_main_~a~5 (mod c_ULTIMATE.start_main_~len~5 4294967296) 0)) (not (= 0 (mod |c_ULTIMATE.start_main_#t~nondet0| 256))) (= (+ c_ULTIMATE.start_main_~len~5 1) c_ULTIMATE.start_main_~len~5_primed)) [2018-12-19 12:35:08,162 WARN L276 ngHoareTripleChecker]: Post: {2147483600#(and (<= ULTIMATE.start_main_~len~5 2147483649) (<= (* 2 ULTIMATE.start_main_~len~5) 4294967298) (<= 1 ULTIMATE.start_main_~len~5) (<= (- ULTIMATE.start_main_~len~5 (- ULTIMATE.start_main_~len~5)) 4294967298) (exists ((v_b_58_1 Int) (v_b_57_1 Int)) (and (forall ((v_idx_88 Int)) (or (<= v_b_58_1 v_idx_88) (<= (- (- ULTIMATE.start_main_~len~5) (select ULTIMATE.start_main_~a~5 v_idx_88)) (- 1)) (< v_idx_88 v_b_57_1))) (<= (- ULTIMATE.start_main_~len~5 (- v_b_58_1)) 4294967298) (<= 1 (+ ULTIMATE.start_main_~len~5 v_b_57_1)) (<= v_b_57_1 2147483648) (<= (- (- v_b_57_1) (- v_b_58_1)) 2147483649) (<= (* 2 v_b_57_1) 4294967296) (<= 1 v_b_58_1) (<= (+ v_b_58_1 ULTIMATE.start_main_~len~5) 4294967298) (<= (- ULTIMATE.start_main_~len~5 (- v_b_57_1)) 4294967297) (<= 0 (* 2 v_b_57_1)) (forall ((v_prenex_53 Int)) (or (<= (- (- v_b_57_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_53))) 0) (<= v_b_58_1 v_prenex_53) (< v_prenex_53 v_b_57_1))) (<= v_b_57_1 (+ v_b_58_1 2147483647)) (<= v_b_58_1 (+ v_b_57_1 2147483649)) (<= (- (- v_b_57_1) v_b_57_1) 0) (forall ((v_prenex_57 Int)) (or (<= v_b_58_1 v_prenex_57) (<= (- (- v_b_58_1) (select ULTIMATE.start_main_~a~5 v_prenex_57)) (- 1)) (< v_prenex_57 v_b_57_1))) (forall ((v_prenex_51 Int)) (or (< v_prenex_51 v_b_57_1) (<= v_b_58_1 v_prenex_51) (<= (- ULTIMATE.start_main_~len~5 (- (select ULTIMATE.start_main_~a~5 v_prenex_51))) 2147483649))) (<= 2 (+ v_b_58_1 ULTIMATE.start_main_~len~5)) (<= (+ ULTIMATE.start_main_~len~5 v_b_58_1) 4294967298) (forall ((v_prenex_61 Int)) (or (< v_prenex_61 v_b_57_1) (<= (- (- (select ULTIMATE.start_main_~a~5 v_prenex_61)) (select ULTIMATE.start_main_~a~5 v_prenex_61)) 0) (<= v_b_58_1 v_prenex_61))) (forall ((v_prenex_62 Int)) (or (< v_prenex_62 v_b_57_1) (<= (- (- ULTIMATE.start_main_~len~5) (- (select ULTIMATE.start_main_~a~5 v_prenex_62))) (- 1)) (<= v_b_58_1 v_prenex_62))) (<= v_b_58_1 2147483649) (<= (- ULTIMATE.start_main_~len~5 v_b_58_1) 2147483648) (<= (- v_b_57_1 (- v_b_57_1)) 4294967296) (<= (- (- v_b_58_1) v_b_58_1) (- 2)) (forall ((v_prenex_59 Int)) (or (< v_prenex_59 v_b_57_1) (<= v_b_58_1 v_prenex_59) (<= (- v_b_57_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_59))) 2147483648))) (<= 2 (+ ULTIMATE.start_main_~len~5 v_b_58_1)) (<= v_b_57_1 (+ ULTIMATE.start_main_~len~5 2147483647)) (<= (- (- ULTIMATE.start_main_~len~5) v_b_58_1) (- 2)) (<= (- v_b_58_1 (- v_b_58_1)) 4294967298) (<= (- ULTIMATE.start_main_~len~5 v_b_57_1) 2147483649) (<= ULTIMATE.start_main_~len~5 (+ v_b_58_1 2147483648)) (forall ((v_prenex_58 Int)) (or (<= v_b_58_1 v_prenex_58) (< v_prenex_58 v_b_57_1) (<= (- (- v_b_58_1) (- (select ULTIMATE.start_main_~a~5 v_prenex_58))) (- 1)))) (<= (+ v_b_58_1 v_b_57_1) 4294967297) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_57_1)) 2147483647) (<= (* 2 v_b_58_1) 4294967298) (forall ((v_prenex_55 Int)) (or (<= v_b_58_1 v_prenex_55) (<= (- (select ULTIMATE.start_main_~a~5 v_prenex_55) (- (select ULTIMATE.start_main_~a~5 v_prenex_55))) 0) (< v_prenex_55 v_b_57_1))) (forall ((v_prenex_52 Int)) (or (< v_prenex_52 v_b_57_1) (<= (- v_b_58_1 (- (select ULTIMATE.start_main_~a~5 v_prenex_52))) 2147483649) (<= v_b_58_1 v_prenex_52))) (forall ((v_prenex_60 Int)) (or (< v_prenex_60 v_b_57_1) (<= (- (- v_b_57_1) (select ULTIMATE.start_main_~a~5 v_prenex_60)) 0) (<= v_b_58_1 v_prenex_60))) (<= 2 (* 2 v_b_58_1)) (forall ((v_prenex_63 Int)) (or (< v_prenex_63 v_b_57_1) (<= v_b_58_1 v_prenex_63) (<= (- v_b_58_1 (select ULTIMATE.start_main_~a~5 v_prenex_63)) 2147483649))) (forall ((v_prenex_54 Int)) (or (<= v_b_58_1 v_prenex_54) (<= (- v_b_57_1 (select ULTIMATE.start_main_~a~5 v_prenex_54)) 2147483648) (< v_prenex_54 v_b_57_1))) (<= (- (- ULTIMATE.start_main_~len~5) (- v_b_58_1)) 2147483648) (<= (- v_b_57_1 v_b_58_1) 2147483647) (<= v_b_58_1 (+ ULTIMATE.start_main_~len~5 2147483648)) (<= (- (- v_b_57_1) v_b_58_1) (- 1)) (<= 0 v_b_57_1) (<= (+ ULTIMATE.start_main_~len~5 v_b_57_1) 4294967297) (<= (- (- ULTIMATE.start_main_~len~5) v_b_57_1) (- 1)) (<= (- v_b_57_1 (- v_b_58_1)) 4294967297) (forall ((v_prenex_56 Int)) (or (< v_prenex_56 v_b_57_1) (<= v_b_58_1 v_prenex_56) (<= (- ULTIMATE.start_main_~len~5 (select ULTIMATE.start_main_~a~5 v_prenex_56)) 2147483649))) (<= 1 (+ v_b_58_1 v_b_57_1)) (<= ULTIMATE.start_main_~len~5 (+ v_b_57_1 2147483649)))) (<= 2 (* 2 ULTIMATE.start_main_~len~5)) (<= (- (- ULTIMATE.start_main_~len~5) ULTIMATE.start_main_~len~5) (- 2)))} [2018-12-19 12:35:09,229 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-19 12:35:09,231 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 3 different actions 27 times. Widened at 2 different actions 12 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-19 12:35:09,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:35:09,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-19 12:35:09,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:35:09,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:35:09,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:35:09,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:35:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:35:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:35:09,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:35:09,359 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {47#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:35:09,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {55#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-19 12:35:09,361 INFO L273 TraceCheckUtils]: 2: Hoare triple {55#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2018-12-19 12:35:09,362 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-12-19 12:35:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:35:09,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:35:09,396 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-12-19 12:35:09,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {65#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2018-12-19 12:35:09,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {69#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {65#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} is VALID [2018-12-19 12:35:09,398 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {69#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} is VALID [2018-12-19 12:35:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:35:09,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:35:09,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-19 12:35:09,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:35:09,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-19 12:35:09,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:35:09,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-12-19 12:35:09,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:35:09,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-19 12:35:09,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-19 12:35:09,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:35:09,436 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-19 12:35:09,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:35:09,471 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-19 12:35:09,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-19 12:35:09,471 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-19 12:35:09,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:35:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-19 12:35:09,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-12-19 12:35:09,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-19 12:35:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2018-12-19 12:35:09,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 8 transitions. [2018-12-19 12:35:09,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:35:09,490 INFO L225 Difference]: With dead ends: 8 [2018-12-19 12:35:09,490 INFO L226 Difference]: Without dead ends: 6 [2018-12-19 12:35:09,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-19 12:35:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-19 12:35:09,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-19 12:35:09,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:35:09,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2018-12-19 12:35:09,502 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-19 12:35:09,503 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-19 12:35:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:35:09,504 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-19 12:35:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-19 12:35:09,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:35:09,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:35:09,504 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2018-12-19 12:35:09,505 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2018-12-19 12:35:09,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:35:09,506 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-12-19 12:35:09,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-19 12:35:09,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:35:09,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:35:09,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:35:09,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:35:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:35:09,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-19 12:35:09,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-19 12:35:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:35:09,508 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-19 12:35:09,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-19 12:35:09,508 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-19 12:35:09,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-19 12:35:09,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:35:09,509 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-19 12:35:09,509 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:35:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:35:09,510 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-19 12:35:09,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:35:09,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:35:09,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:35:09,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:35:09,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:35:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:35:09,722 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {109#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:35:09,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {110#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-19 12:35:09,726 INFO L273 TraceCheckUtils]: 2: Hoare triple {110#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {111#(and (<= ULTIMATE.start_main_~len~5 2) (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)))} is VALID [2018-12-19 12:35:09,727 INFO L273 TraceCheckUtils]: 3: Hoare triple {111#(and (<= ULTIMATE.start_main_~len~5 2) (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {108#false} is VALID [2018-12-19 12:35:09,728 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#false} assume !false; {108#false} is VALID [2018-12-19 12:35:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:35:09,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:35:09,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:35:09,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-19 12:35:09,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-19 12:35:09,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:35:09,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:35:09,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-19 12:35:09,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-19 12:35:09,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-19 12:35:09,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-19 12:35:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:35:09,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:35:09,827 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {109#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:35:09,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {110#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-19 12:35:09,835 INFO L273 TraceCheckUtils]: 2: Hoare triple {110#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {121#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:35:09,836 INFO L273 TraceCheckUtils]: 3: Hoare triple {121#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {108#false} is VALID [2018-12-19 12:35:09,836 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#false} assume !false; {108#false} is VALID [2018-12-19 12:35:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:35:09,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:35:09,904 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#false} assume !false; {108#false} is VALID [2018-12-19 12:35:09,912 INFO L273 TraceCheckUtils]: 3: Hoare triple {131#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {108#false} is VALID [2018-12-19 12:35:09,914 INFO L273 TraceCheckUtils]: 2: Hoare triple {135#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {131#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} is VALID [2018-12-19 12:35:09,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {139#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {135#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} is VALID [2018-12-19 12:35:09,915 INFO L273 TraceCheckUtils]: 0: Hoare triple {107#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {139#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} is VALID [2018-12-19 12:35:09,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:35:09,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:35:09,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-19 12:35:09,936 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:35:09,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-19 12:35:09,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:35:09,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-19 12:35:09,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:35:09,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-19 12:35:09,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-19 12:35:09,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-19 12:35:09,958 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-19 12:35:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:35:10,032 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-19 12:35:10,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-19 12:35:10,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-19 12:35:10,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:35:10,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:35:10,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2018-12-19 12:35:10,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-19 12:35:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2018-12-19 12:35:10,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 9 transitions. [2018-12-19 12:35:10,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:35:10,050 INFO L225 Difference]: With dead ends: 9 [2018-12-19 12:35:10,051 INFO L226 Difference]: Without dead ends: 7 [2018-12-19 12:35:10,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-19 12:35:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-19 12:35:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-19 12:35:10,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:35:10,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2018-12-19 12:35:10,064 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-19 12:35:10,064 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-19 12:35:10,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:35:10,065 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-12-19 12:35:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-19 12:35:10,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:35:10,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:35:10,066 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2018-12-19 12:35:10,066 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2018-12-19 12:35:10,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:35:10,067 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-12-19 12:35:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-19 12:35:10,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:35:10,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:35:10,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:35:10,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:35:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-19 12:35:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-19 12:35:10,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-19 12:35:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:35:10,069 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-19 12:35:10,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-19 12:35:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-19 12:35:10,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-19 12:35:10,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:35:10,070 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-19 12:35:10,070 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:35:10,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:35:10,071 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-19 12:35:10,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:35:10,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:35:10,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-19 12:35:10,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:35:10,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:35:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:35:10,205 INFO L273 TraceCheckUtils]: 0: Hoare triple {183#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {185#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:35:10,207 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {186#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-19 12:35:10,208 INFO L273 TraceCheckUtils]: 2: Hoare triple {186#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {187#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:35:10,210 INFO L273 TraceCheckUtils]: 3: Hoare triple {187#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {188#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 3))} is VALID [2018-12-19 12:35:10,212 INFO L273 TraceCheckUtils]: 4: Hoare triple {188#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 3))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {184#false} is VALID [2018-12-19 12:35:10,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {184#false} assume !false; {184#false} is VALID [2018-12-19 12:35:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:35:10,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:35:10,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:35:10,213 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-19 12:35:10,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-19 12:35:10,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:35:10,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:35:10,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-19 12:35:10,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-19 12:35:10,230 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-19 12:35:10,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-19 12:35:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:35:10,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:35:10,278 INFO L273 TraceCheckUtils]: 0: Hoare triple {183#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {185#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:35:10,280 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {186#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-19 12:35:10,281 INFO L273 TraceCheckUtils]: 2: Hoare triple {186#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {187#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:35:10,283 INFO L273 TraceCheckUtils]: 3: Hoare triple {187#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {201#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:35:10,284 INFO L273 TraceCheckUtils]: 4: Hoare triple {201#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {184#false} is VALID [2018-12-19 12:35:10,284 INFO L273 TraceCheckUtils]: 5: Hoare triple {184#false} assume !false; {184#false} is VALID [2018-12-19 12:35:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:35:10,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:35:10,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {184#false} assume !false; {184#false} is VALID [2018-12-19 12:35:10,355 INFO L273 TraceCheckUtils]: 4: Hoare triple {211#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {184#false} is VALID [2018-12-19 12:35:10,356 INFO L273 TraceCheckUtils]: 3: Hoare triple {215#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {211#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} is VALID [2018-12-19 12:35:10,358 INFO L273 TraceCheckUtils]: 2: Hoare triple {219#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {215#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} is VALID [2018-12-19 12:35:10,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {223#(< (mod (+ ULTIMATE.start_main_~len~5 3) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {219#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} is VALID [2018-12-19 12:35:10,361 INFO L273 TraceCheckUtils]: 0: Hoare triple {183#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {223#(< (mod (+ ULTIMATE.start_main_~len~5 3) 4294967296) 5)} is VALID [2018-12-19 12:35:10,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:35:10,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:35:10,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-19 12:35:10,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:35:10,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-19 12:35:10,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:35:10,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-12-19 12:35:10,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:35:10,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-19 12:35:10,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-19 12:35:10,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-19 12:35:10,395 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-19 12:35:10,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:35:10,567 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-19 12:35:10,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-19 12:35:10,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-19 12:35:10,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:35:10,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-19 12:35:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-12-19 12:35:10,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-19 12:35:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-12-19 12:35:10,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 10 transitions. [2018-12-19 12:35:10,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:35:10,603 INFO L225 Difference]: With dead ends: 10 [2018-12-19 12:35:10,603 INFO L226 Difference]: Without dead ends: 8 [2018-12-19 12:35:10,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-19 12:35:10,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-19 12:35:10,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-19 12:35:10,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:35:10,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2018-12-19 12:35:10,612 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-19 12:35:10,612 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-19 12:35:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:35:10,614 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-19 12:35:10,614 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-19 12:35:10,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:35:10,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:35:10,615 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2018-12-19 12:35:10,615 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2018-12-19 12:35:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:35:10,616 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-19 12:35:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-19 12:35:10,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:35:10,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:35:10,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:35:10,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:35:10,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:35:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-19 12:35:10,617 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-19 12:35:10,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:35:10,618 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-19 12:35:10,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-19 12:35:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-19 12:35:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-19 12:35:10,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-19 12:35:10,618 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-19 12:35:10,618 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-19 12:35:10,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-19 12:35:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-19 12:35:10,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-19 12:35:10,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:35:10,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-19 12:35:10,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-19 12:35:10,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-19 12:35:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:35:10,821 INFO L273 TraceCheckUtils]: 0: Hoare triple {273#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {275#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:35:10,822 INFO L273 TraceCheckUtils]: 1: Hoare triple {275#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {276#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-19 12:35:10,823 INFO L273 TraceCheckUtils]: 2: Hoare triple {276#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {277#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:35:10,824 INFO L273 TraceCheckUtils]: 3: Hoare triple {277#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {278#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:35:10,829 INFO L273 TraceCheckUtils]: 4: Hoare triple {278#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {279#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 4))} is VALID [2018-12-19 12:35:10,830 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#(and (< 0 (+ (div ULTIMATE.start_main_~len~5 4294967296) 1)) (<= ULTIMATE.start_main_~len~5 4))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {274#false} is VALID [2018-12-19 12:35:10,831 INFO L273 TraceCheckUtils]: 6: Hoare triple {274#false} assume !false; {274#false} is VALID [2018-12-19 12:35:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:35:10,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:35:10,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-19 12:35:10,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-19 12:35:10,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-19 12:35:10,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-19 12:35:10,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-19 12:35:10,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-19 12:35:10,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-19 12:35:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:35:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-19 12:35:10,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-19 12:35:10,902 INFO L273 TraceCheckUtils]: 0: Hoare triple {273#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {275#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:35:10,904 INFO L273 TraceCheckUtils]: 1: Hoare triple {275#(and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {276#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} is VALID [2018-12-19 12:35:10,905 INFO L273 TraceCheckUtils]: 2: Hoare triple {276#(and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {277#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:35:10,905 INFO L273 TraceCheckUtils]: 3: Hoare triple {277#(and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {278#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} is VALID [2018-12-19 12:35:10,907 INFO L273 TraceCheckUtils]: 4: Hoare triple {278#(and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5))} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {295#(and (<= 4 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 4))} is VALID [2018-12-19 12:35:10,908 INFO L273 TraceCheckUtils]: 5: Hoare triple {295#(and (<= 4 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 4))} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {274#false} is VALID [2018-12-19 12:35:10,908 INFO L273 TraceCheckUtils]: 6: Hoare triple {274#false} assume !false; {274#false} is VALID [2018-12-19 12:35:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:35:10,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-19 12:35:10,999 INFO L273 TraceCheckUtils]: 6: Hoare triple {274#false} assume !false; {274#false} is VALID [2018-12-19 12:35:11,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {305#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} assume !(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;__VERIFIER_assert_#in~cond := (if main_~len~5 % 4294967296 >= 0 && main_~len~5 % 4294967296 < 5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {274#false} is VALID [2018-12-19 12:35:11,005 INFO L273 TraceCheckUtils]: 4: Hoare triple {309#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {305#(< (mod ULTIMATE.start_main_~len~5 4294967296) 5)} is VALID [2018-12-19 12:35:11,006 INFO L273 TraceCheckUtils]: 3: Hoare triple {313#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {309#(< (mod (+ ULTIMATE.start_main_~len~5 1) 4294967296) 5)} is VALID [2018-12-19 12:35:11,007 INFO L273 TraceCheckUtils]: 2: Hoare triple {317#(< (mod (+ ULTIMATE.start_main_~len~5 3) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {313#(< (mod (+ ULTIMATE.start_main_~len~5 2) 4294967296) 5)} is VALID [2018-12-19 12:35:11,009 INFO L273 TraceCheckUtils]: 1: Hoare triple {321#(< (mod (+ ULTIMATE.start_main_~len~5 4) 4294967296) 5)} assume !!(main_#t~nondet0 % 256 != 0);havoc main_#t~nondet0;assume !(main_~len~5 % 4294967296 == 4);main_~a~5 := main_~a~5[main_~len~5 % 4294967296 := 0];main_#t~post1 := main_~len~5;main_~len~5 := main_#t~post1 + 1;havoc main_#t~post1; {317#(< (mod (+ ULTIMATE.start_main_~len~5 3) 4294967296) 5)} is VALID [2018-12-19 12:35:11,009 INFO L273 TraceCheckUtils]: 0: Hoare triple {273#true} havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~5, main_~len~5, main_~i~5;havoc main_~a~5;main_~len~5 := 0;havoc main_~i~5; {321#(< (mod (+ ULTIMATE.start_main_~len~5 4) 4294967296) 5)} is VALID [2018-12-19 12:35:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-19 12:35:11,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-19 12:35:11,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-19 12:35:11,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-19 12:35:11,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-19 12:35:11,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-19 12:35:11,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-12-19 12:35:11,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:35:11,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-19 12:35:11,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-19 12:35:11,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-19 12:35:11,042 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-19 12:35:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:35:11,134 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-19 12:35:11,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-19 12:35:11,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-19 12:35:11,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-19 12:35:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:35:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-12-19 12:35:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-19 12:35:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-12-19 12:35:11,137 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 10 transitions. [2018-12-19 12:35:11,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-19 12:35:11,151 INFO L225 Difference]: With dead ends: 9 [2018-12-19 12:35:11,151 INFO L226 Difference]: Without dead ends: 0 [2018-12-19 12:35:11,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-19 12:35:11,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-19 12:35:11,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-19 12:35:11,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-19 12:35:11,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-12-19 12:35:11,153 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 12:35:11,153 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 12:35:11,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:35:11,153 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 12:35:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:35:11,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:35:11,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:35:11,154 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-12-19 12:35:11,154 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-12-19 12:35:11,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-19 12:35:11,154 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-19 12:35:11,154 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:35:11,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:35:11,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-19 12:35:11,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-19 12:35:11,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-19 12:35:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-19 12:35:11,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-19 12:35:11,155 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2018-12-19 12:35:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-19 12:35:11,156 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-19 12:35:11,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-19 12:35:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-19 12:35:11,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-19 12:35:11,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-19 12:35:11,249 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 43) no Hoare annotation was computed. [2018-12-19 12:35:11,249 INFO L444 ceAbstractionStarter]: At program point L31(lines 31 41) the Hoare annotation is: false [2018-12-19 12:35:11,249 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 42) no Hoare annotation was computed. [2018-12-19 12:35:11,249 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 43) no Hoare annotation was computed. [2018-12-19 12:35:11,249 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2018-12-19 12:35:11,250 INFO L444 ceAbstractionStarter]: At program point L40(lines 17 40) the Hoare annotation is: (or (and (<= ULTIMATE.start_main_~len~5 0) (<= 0 ULTIMATE.start_main_~len~5)) (and (<= 1 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 1)) (and (<= ULTIMATE.start_main_~len~5 2) (<= 2 ULTIMATE.start_main_~len~5)) (and (<= ULTIMATE.start_main_~len~5 3) (<= 3 ULTIMATE.start_main_~len~5)) (and (<= 4 ULTIMATE.start_main_~len~5) (<= ULTIMATE.start_main_~len~5 4))) [2018-12-19 12:35:11,251 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-19 12:35:11,258 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2018-12-19 12:35:11,258 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-12-19 12:35:11,258 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-12-19 12:35:11,258 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-19 12:35:11,266 INFO L202 PluginConnector]: Adding new model n.c11.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:35:11 BoogieIcfgContainer [2018-12-19 12:35:11,266 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-19 12:35:11,268 INFO L168 Benchmark]: Toolchain (without parser) took 578022.76 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 692.1 MB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -432.9 MB). Peak memory consumption was 259.2 MB. Max. memory is 7.1 GB. [2018-12-19 12:35:11,269 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 12:35:11,269 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 12:35:11,270 INFO L168 Benchmark]: Boogie Preprocessor took 26.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-19 12:35:11,270 INFO L168 Benchmark]: RCFGBuilder took 322.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-19 12:35:11,271 INFO L168 Benchmark]: TraceAbstraction took 577621.97 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 692.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -454.0 MB). Peak memory consumption was 238.1 MB. Max. memory is 7.1 GB. [2018-12-19 12:35:11,275 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 46.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 322.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 577621.97 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 692.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -454.0 MB). Peak memory consumption was 238.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: ((((main_~len~5 <= 0 && 0 <= main_~len~5) || (1 <= main_~len~5 && main_~len~5 <= 1)) || (main_~len~5 <= 2 && 2 <= main_~len~5)) || (main_~len~5 <= 3 && 3 <= main_~len~5)) || (4 <= main_~len~5 && main_~len~5 <= 4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 577.5s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 0 SDslu, 11 SDs, 0 SdLazy, 76 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 574.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 37 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534 SizeOfPredicates, 12 NumberOfNonLiveVariables, 102 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 0/60 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...