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/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 18:37:09,101 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 18:37:09,104 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 18:37:09,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 18:37:09,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 18:37:09,117 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 18:37:09,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 18:37:09,123 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 18:37:09,125 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 18:37:09,126 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 18:37:09,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 18:37:09,129 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 18:37:09,131 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 18:37:09,132 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 18:37:09,135 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 18:37:09,136 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 18:37:09,137 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 18:37:09,141 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 18:37:09,143 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 18:37:09,145 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 18:37:09,146 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 18:37:09,147 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 18:37:09,153 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 18:37:09,154 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 18:37:09,154 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 18:37:09,158 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 18:37:09,159 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 18:37:09,163 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 18:37:09,164 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 18:37:09,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 18:37:09,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 18:37:09,167 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 18:37:09,167 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 18:37:09,167 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 18:37:09,169 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 18:37:09,170 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 18:37:09,170 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-07 18:37:09,193 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 18:37:09,193 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 18:37:09,194 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 18:37:09,194 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 18:37:09,195 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 18:37:09,195 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 18:37:09,195 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 18:37:09,195 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 18:37:09,195 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 18:37:09,196 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 18:37:09,196 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 18:37:09,197 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 18:37:09,197 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 18:37:09,198 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 18:37:09,198 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 18:37:09,198 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 18:37:09,198 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 18:37:09,200 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 18:37:09,201 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 18:37:09,201 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 18:37:09,201 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 18:37:09,201 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 18:37:09,202 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 18:37:09,202 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 18:37:09,202 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 18:37:09,203 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 18:37:09,203 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 18:37:09,203 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 18:37:09,203 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 18:37:09,203 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 18:37:09,204 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 18:37:09,204 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 18:37:09,204 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 18:37:09,204 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 18:37:09,205 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 18:37:09,206 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 18:37:09,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 18:37:09,206 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 18:37:09,206 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 18:37:09,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 18:37:09,251 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 18:37:09,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 18:37:09,258 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 18:37:09,259 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 18:37:09,260 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2019-01-07 18:37:09,261 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2019-01-07 18:37:09,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 18:37:09,333 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 18:37:09,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 18:37:09,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 18:37:09,334 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 18:37:09,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:37:09" (1/1) ... [2019-01-07 18:37:09,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:37:09" (1/1) ... [2019-01-07 18:37:09,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 18:37:09,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 18:37:09,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 18:37:09,374 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 18:37:09,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:37:09" (1/1) ... [2019-01-07 18:37:09,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:37:09" (1/1) ... [2019-01-07 18:37:09,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:37:09" (1/1) ... [2019-01-07 18:37:09,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:37:09" (1/1) ... [2019-01-07 18:37:09,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:37:09" (1/1) ... [2019-01-07 18:37:09,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:37:09" (1/1) ... [2019-01-07 18:37:09,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:37:09" (1/1) ... [2019-01-07 18:37:09,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 18:37:09,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 18:37:09,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 18:37:09,397 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 18:37:09,398 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:37:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 18:37:09,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 18:37:09,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 18:37:09,968 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 18:37:09,969 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-07 18:37:09,970 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 06:37:09 BoogieIcfgContainer [2019-01-07 18:37:09,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 18:37:09,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 18:37:09,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 18:37:09,978 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 18:37:09,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 06:37:09" (1/2) ... [2019-01-07 18:37:09,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276ab078 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 06:37:09, skipping insertion in model container [2019-01-07 18:37:09,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 06:37:09" (2/2) ... [2019-01-07 18:37:09,981 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2019-01-07 18:37:09,995 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 18:37:10,004 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 18:37:10,020 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 18:37:10,054 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 18:37:10,055 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 18:37:10,055 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 18:37:10,055 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 18:37:10,055 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 18:37:10,055 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 18:37:10,056 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 18:37:10,056 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 18:37:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-07 18:37:10,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 18:37:10,077 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:37:10,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 18:37:10,080 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:37:10,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:37:10,087 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-07 18:37:10,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:37:10,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:37:10,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:37:10,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:37:10,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:37:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:37:10,331 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {10#true} is VALID [2019-01-07 18:37:10,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {10#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {12#(<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))} is VALID [2019-01-07 18:37:10,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {12#(<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {11#false} is VALID [2019-01-07 18:37:10,341 INFO L273 TraceCheckUtils]: 3: Hoare triple {11#false} assume !false; {11#false} is VALID [2019-01-07 18:37:10,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:37:10,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 18:37:10,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-07 18:37:10,346 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 18:37:10,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-07 18:37:10,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:37:10,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 18:37:10,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:37:10,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 18:37:10,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 18:37:10,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 18:37:10,415 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-07 18:37:10,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:37:10,549 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-07 18:37:10,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 18:37:10,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-07 18:37:10,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:37:10,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 18:37:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-07 18:37:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 18:37:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-07 18:37:10,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 12 transitions. [2019-01-07 18:37:10,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:37:10,698 INFO L225 Difference]: With dead ends: 10 [2019-01-07 18:37:10,698 INFO L226 Difference]: Without dead ends: 6 [2019-01-07 18:37:10,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 18:37:10,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-07 18:37:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-07 18:37:10,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:37:10,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states. Second operand 6 states. [2019-01-07 18:37:10,796 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-07 18:37:10,797 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-07 18:37:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:37:10,800 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-01-07 18:37:10,802 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-07 18:37:10,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:37:10,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:37:10,803 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states. [2019-01-07 18:37:10,803 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states. [2019-01-07 18:37:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:37:10,805 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-01-07 18:37:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-07 18:37:10,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:37:10,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:37:10,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:37:10,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:37:10,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 18:37:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-07 18:37:10,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-01-07 18:37:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:37:10,810 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-07 18:37:10,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 18:37:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-07 18:37:10,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 18:37:10,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:37:10,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 18:37:10,812 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:37:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:37:10,813 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2019-01-07 18:37:10,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:37:10,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:37:10,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:37:10,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:37:10,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:37:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:37:11,099 INFO L273 TraceCheckUtils]: 0: Hoare triple {52#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {54#(<= ULTIMATE.start_main_~i~6 0)} is VALID [2019-01-07 18:37:11,109 INFO L273 TraceCheckUtils]: 1: Hoare triple {54#(<= ULTIMATE.start_main_~i~6 0)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {55#(<= (+ ULTIMATE.start_main_~i~6 1) 0)} is VALID [2019-01-07 18:37:11,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {55#(<= (+ ULTIMATE.start_main_~i~6 1) 0)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {53#false} is VALID [2019-01-07 18:37:11,123 INFO L273 TraceCheckUtils]: 3: Hoare triple {53#false} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {53#false} is VALID [2019-01-07 18:37:11,123 INFO L273 TraceCheckUtils]: 4: Hoare triple {53#false} assume !false; {53#false} is VALID [2019-01-07 18:37:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:37:11,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 18:37:11,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-07 18:37:11,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 18:37:11,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-07 18:37:11,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:37:11,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 18:37:11,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:37:11,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 18:37:11,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 18:37:11,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-07 18:37:11,171 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-01-07 18:37:11,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:37:11,475 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-07 18:37:11,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 18:37:11,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-07 18:37:11,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:37:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 18:37:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-07 18:37:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 18:37:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-07 18:37:11,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 12 transitions. [2019-01-07 18:37:11,520 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:37:11,521 INFO L225 Difference]: With dead ends: 11 [2019-01-07 18:37:11,521 INFO L226 Difference]: Without dead ends: 7 [2019-01-07 18:37:11,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-07 18:37:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-07 18:37:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-07 18:37:11,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:37:11,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-01-07 18:37:11,570 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-07 18:37:11,570 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-07 18:37:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:37:11,571 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-01-07 18:37:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-07 18:37:11,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:37:11,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:37:11,574 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-07 18:37:11,575 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-07 18:37:11,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:37:11,578 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-01-07 18:37:11,578 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-07 18:37:11,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:37:11,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:37:11,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:37:11,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:37:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 18:37:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-07 18:37:11,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-01-07 18:37:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:37:11,580 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-07 18:37:11,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 18:37:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-07 18:37:11,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 18:37:11,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:37:11,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 18:37:11,582 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:37:11,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:37:11,582 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-07 18:37:11,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:37:11,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:37:11,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:37:11,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:37:11,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:37:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:37:12,052 INFO L273 TraceCheckUtils]: 0: Hoare triple {103#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {105#(or (and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6)) (not (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6)))} is VALID [2019-01-07 18:37:12,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {105#(or (and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6)) (not (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {106#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 1 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:37:12,055 INFO L273 TraceCheckUtils]: 2: Hoare triple {106#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 1 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {107#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:37:12,058 INFO L273 TraceCheckUtils]: 3: Hoare triple {107#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {108#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:37:12,059 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {104#false} is VALID [2019-01-07 18:37:12,059 INFO L273 TraceCheckUtils]: 5: Hoare triple {104#false} assume !false; {104#false} is VALID [2019-01-07 18:37:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:37:12,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:37:12,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:37:12,063 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 18:37:12,065 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-07 18:37:12,127 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 18:37:12,127 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 18:37:12,208 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-01-07 18:47:05,443 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 18:47:05,445 INFO L272 AbstractInterpreter]: Visited 6 different actions 125 times. Merged at 5 different actions 82 times. Widened at 4 different actions 55 times. Found 34 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-07 18:47:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:05,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 18:47:05,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:05,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:47:05,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:47:05,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:47:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:05,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:05,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:47:05,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:05,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:05,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-07 18:47:05,723 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:05,723 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_7]. (and (= (store v_ULTIMATE.start_main_~str2~6_7 0 (select ULTIMATE.start_main_~str1~6 0)) ULTIMATE.start_main_~str2~6) (< 0 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 1)) [2019-01-07 18:47:05,724 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (< 0 ULTIMATE.start_main_~MAX~6) (= (select ULTIMATE.start_main_~str2~6 0) (select ULTIMATE.start_main_~str1~6 0)) (<= ULTIMATE.start_main_~MAX~6 1)) [2019-01-07 18:47:05,801 INFO L273 TraceCheckUtils]: 0: Hoare triple {103#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {112#(= ULTIMATE.start_main_~i~6 0)} is VALID [2019-01-07 18:47:05,802 INFO L273 TraceCheckUtils]: 1: Hoare triple {112#(= ULTIMATE.start_main_~i~6 0)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {116#(and (< 0 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~i~6 1))} is VALID [2019-01-07 18:47:05,803 INFO L273 TraceCheckUtils]: 2: Hoare triple {116#(and (< 0 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~i~6 1))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {120#(and (< 0 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 0) (<= ULTIMATE.start_main_~MAX~6 1))} is VALID [2019-01-07 18:47:05,804 INFO L273 TraceCheckUtils]: 3: Hoare triple {120#(and (< 0 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 0) (<= ULTIMATE.start_main_~MAX~6 1))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {124#(and (< 0 ULTIMATE.start_main_~MAX~6) (= (select ULTIMATE.start_main_~str2~6 0) (select ULTIMATE.start_main_~str1~6 0)) (<= ULTIMATE.start_main_~MAX~6 1))} is VALID [2019-01-07 18:47:05,804 INFO L273 TraceCheckUtils]: 4: Hoare triple {124#(and (< 0 ULTIMATE.start_main_~MAX~6) (= (select ULTIMATE.start_main_~str2~6 0) (select ULTIMATE.start_main_~str1~6 0)) (<= ULTIMATE.start_main_~MAX~6 1))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {104#false} is VALID [2019-01-07 18:47:05,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {104#false} assume !false; {104#false} is VALID [2019-01-07 18:47:05,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:05,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:06,165 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-07 18:47:06,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:47:06,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:06,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:06,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-07 18:47:06,332 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:06,332 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) [2019-01-07 18:47:06,332 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6) [2019-01-07 18:47:06,551 INFO L273 TraceCheckUtils]: 5: Hoare triple {104#false} assume !false; {104#false} is VALID [2019-01-07 18:47:06,552 INFO L273 TraceCheckUtils]: 4: Hoare triple {108#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {104#false} is VALID [2019-01-07 18:47:06,553 INFO L273 TraceCheckUtils]: 3: Hoare triple {107#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {108#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:06,554 INFO L273 TraceCheckUtils]: 2: Hoare triple {106#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 1 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {107#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:06,555 INFO L273 TraceCheckUtils]: 1: Hoare triple {112#(= ULTIMATE.start_main_~i~6 0)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {106#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 1 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:06,556 INFO L273 TraceCheckUtils]: 0: Hoare triple {103#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {112#(= ULTIMATE.start_main_~i~6 0)} is VALID [2019-01-07 18:47:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:06,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:06,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-07 18:47:06,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:06,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 18:47:06,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:06,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-01-07 18:47:06,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:06,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 18:47:06,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 18:47:06,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-07 18:47:06,597 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 10 states. [2019-01-07 18:47:07,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:07,192 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-07 18:47:07,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 18:47:07,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-07 18:47:07,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 18:47:07,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-07 18:47:07,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 18:47:07,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-07 18:47:07,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 14 transitions. [2019-01-07 18:47:07,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:07,238 INFO L225 Difference]: With dead ends: 12 [2019-01-07 18:47:07,238 INFO L226 Difference]: Without dead ends: 8 [2019-01-07 18:47:07,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-01-07 18:47:07,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-07 18:47:07,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-07 18:47:07,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:07,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2019-01-07 18:47:07,279 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-07 18:47:07,279 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-07 18:47:07,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:07,280 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-01-07 18:47:07,280 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-07 18:47:07,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:07,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:07,281 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2019-01-07 18:47:07,281 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2019-01-07 18:47:07,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:07,282 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-01-07 18:47:07,282 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-07 18:47:07,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:07,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:07,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:07,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 18:47:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-07 18:47:07,286 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-01-07 18:47:07,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:07,289 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-07 18:47:07,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 18:47:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-07 18:47:07,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 18:47:07,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:07,290 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-07 18:47:07,290 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:07,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:07,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1949841836, now seen corresponding path program 2 times [2019-01-07 18:47:07,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:07,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:07,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:47:07,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:07,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:07,464 INFO L273 TraceCheckUtils]: 0: Hoare triple {204#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {206#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:07,465 INFO L273 TraceCheckUtils]: 1: Hoare triple {206#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {207#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:07,466 INFO L273 TraceCheckUtils]: 2: Hoare triple {207#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {208#(<= 2 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:07,467 INFO L273 TraceCheckUtils]: 3: Hoare triple {208#(<= 2 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {207#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:07,468 INFO L273 TraceCheckUtils]: 4: Hoare triple {207#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {206#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:07,469 INFO L273 TraceCheckUtils]: 5: Hoare triple {206#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {205#false} is VALID [2019-01-07 18:47:07,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {205#false} assume !false; {205#false} is VALID [2019-01-07 18:47:07,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:07,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:07,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:07,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:07,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:07,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:07,471 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 [2019-01-07 18:47:07,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 18:47:07,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 18:47:07,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 18:47:07,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:47:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:07,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:07,728 INFO L273 TraceCheckUtils]: 0: Hoare triple {204#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {206#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:07,729 INFO L273 TraceCheckUtils]: 1: Hoare triple {206#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {207#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:07,731 INFO L273 TraceCheckUtils]: 2: Hoare triple {207#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {208#(<= 2 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:07,732 INFO L273 TraceCheckUtils]: 3: Hoare triple {208#(<= 2 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {207#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:07,733 INFO L273 TraceCheckUtils]: 4: Hoare triple {207#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {206#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:07,734 INFO L273 TraceCheckUtils]: 5: Hoare triple {206#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {205#false} is VALID [2019-01-07 18:47:07,734 INFO L273 TraceCheckUtils]: 6: Hoare triple {205#false} assume !false; {205#false} is VALID [2019-01-07 18:47:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:07,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:07,975 INFO L273 TraceCheckUtils]: 6: Hoare triple {205#false} assume !false; {205#false} is VALID [2019-01-07 18:47:07,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {206#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {205#false} is VALID [2019-01-07 18:47:07,978 INFO L273 TraceCheckUtils]: 4: Hoare triple {207#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {206#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:07,979 INFO L273 TraceCheckUtils]: 3: Hoare triple {208#(<= 2 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {207#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:07,980 INFO L273 TraceCheckUtils]: 2: Hoare triple {207#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {208#(<= 2 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:07,983 INFO L273 TraceCheckUtils]: 1: Hoare triple {206#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {207#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:07,984 INFO L273 TraceCheckUtils]: 0: Hoare triple {204#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {206#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:08,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:08,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-01-07 18:47:08,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:08,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-07 18:47:08,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:08,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-01-07 18:47:08,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:08,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-07 18:47:08,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-07 18:47:08,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-07 18:47:08,016 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-01-07 18:47:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:08,119 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-01-07 18:47:08,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 18:47:08,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-07 18:47:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:08,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 18:47:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2019-01-07 18:47:08,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 18:47:08,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 12 transitions. [2019-01-07 18:47:08,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 12 transitions. [2019-01-07 18:47:08,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:08,140 INFO L225 Difference]: With dead ends: 11 [2019-01-07 18:47:08,140 INFO L226 Difference]: Without dead ends: 9 [2019-01-07 18:47:08,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-07 18:47:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-07 18:47:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-07 18:47:08,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:08,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-01-07 18:47:08,180 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-01-07 18:47:08,181 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-01-07 18:47:08,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:08,182 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-07 18:47:08,182 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-07 18:47:08,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:08,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:08,183 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-01-07 18:47:08,183 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-01-07 18:47:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:08,184 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-07 18:47:08,184 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-07 18:47:08,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:08,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:08,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:08,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:08,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-07 18:47:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-07 18:47:08,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-01-07 18:47:08,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:08,205 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-07 18:47:08,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-07 18:47:08,205 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-07 18:47:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 18:47:08,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:08,205 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-07 18:47:08,208 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:08,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:08,210 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 3 times [2019-01-07 18:47:08,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:08,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:08,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:47:08,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:08,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:08,414 INFO L273 TraceCheckUtils]: 0: Hoare triple {304#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {306#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:08,416 INFO L273 TraceCheckUtils]: 1: Hoare triple {306#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {307#(or (not (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6)) (and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6)))} is VALID [2019-01-07 18:47:08,427 INFO L273 TraceCheckUtils]: 2: Hoare triple {307#(or (not (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6)) (and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {308#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 2 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:08,428 INFO L273 TraceCheckUtils]: 3: Hoare triple {308#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 2 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {309#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:08,433 INFO L273 TraceCheckUtils]: 4: Hoare triple {309#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {310#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:08,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {310#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {311#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:08,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {311#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {305#false} is VALID [2019-01-07 18:47:08,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {305#false} assume !false; {305#false} is VALID [2019-01-07 18:47:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:08,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:08,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:08,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:08,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:08,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:08,437 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 [2019-01-07 18:47:08,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 18:47:08,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 18:47:08,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 18:47:08,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:47:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:08,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:08,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:47:08,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:08,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:08,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-07 18:47:08,610 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:08,610 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_10]. (and (<= 2 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 3)) (= (store v_ULTIMATE.start_main_~str2~6_10 1 (select ULTIMATE.start_main_~str1~6 0)) ULTIMATE.start_main_~str2~6)) [2019-01-07 18:47:08,611 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 1)) (<= 2 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 3))) [2019-01-07 18:47:08,644 INFO L273 TraceCheckUtils]: 0: Hoare triple {304#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {304#true} is VALID [2019-01-07 18:47:08,644 INFO L273 TraceCheckUtils]: 1: Hoare triple {304#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {304#true} is VALID [2019-01-07 18:47:08,645 INFO L273 TraceCheckUtils]: 2: Hoare triple {304#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {304#true} is VALID [2019-01-07 18:47:08,646 INFO L273 TraceCheckUtils]: 3: Hoare triple {304#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {324#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:08,647 INFO L273 TraceCheckUtils]: 4: Hoare triple {324#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {328#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} is VALID [2019-01-07 18:47:08,647 INFO L273 TraceCheckUtils]: 5: Hoare triple {328#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {332#(and (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 1)) (<= 2 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 3)))} is VALID [2019-01-07 18:47:08,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {332#(and (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 1)) (<= 2 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 3)))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {305#false} is VALID [2019-01-07 18:47:08,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {305#false} assume !false; {305#false} is VALID [2019-01-07 18:47:08,650 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 18:47:08,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:08,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:47:08,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:08,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:08,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-07 18:47:08,853 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:08,853 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (or (not (<= 0 ULTIMATE.start_main_~i~6)) (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) (< 0 ULTIMATE.start_main_~i~6)) [2019-01-07 18:47:08,853 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:47:08,924 INFO L273 TraceCheckUtils]: 7: Hoare triple {305#false} assume !false; {305#false} is VALID [2019-01-07 18:47:08,926 INFO L273 TraceCheckUtils]: 6: Hoare triple {342#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {305#false} is VALID [2019-01-07 18:47:08,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {346#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {342#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:08,929 INFO L273 TraceCheckUtils]: 4: Hoare triple {350#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {346#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:08,931 INFO L273 TraceCheckUtils]: 3: Hoare triple {304#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {350#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} is VALID [2019-01-07 18:47:08,931 INFO L273 TraceCheckUtils]: 2: Hoare triple {304#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {304#true} is VALID [2019-01-07 18:47:08,932 INFO L273 TraceCheckUtils]: 1: Hoare triple {304#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {304#true} is VALID [2019-01-07 18:47:08,932 INFO L273 TraceCheckUtils]: 0: Hoare triple {304#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {304#true} is VALID [2019-01-07 18:47:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-07 18:47:08,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:08,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2019-01-07 18:47:08,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:08,954 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-07 18:47:08,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:08,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2019-01-07 18:47:09,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:09,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 18:47:09,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 18:47:09,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-07 18:47:09,032 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 11 states. [2019-01-07 18:47:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:09,974 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-07 18:47:09,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-07 18:47:09,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-07 18:47:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 18:47:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2019-01-07 18:47:09,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 18:47:09,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2019-01-07 18:47:09,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 21 transitions. [2019-01-07 18:47:10,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:10,012 INFO L225 Difference]: With dead ends: 17 [2019-01-07 18:47:10,012 INFO L226 Difference]: Without dead ends: 11 [2019-01-07 18:47:10,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-01-07 18:47:10,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-07 18:47:10,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-07 18:47:10,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:10,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-01-07 18:47:10,059 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-01-07 18:47:10,059 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-01-07 18:47:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:10,061 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-01-07 18:47:10,061 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-07 18:47:10,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:10,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:10,061 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-01-07 18:47:10,061 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-01-07 18:47:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:10,062 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-01-07 18:47:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-07 18:47:10,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:10,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:10,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:10,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 18:47:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-07 18:47:10,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-07 18:47:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:10,064 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-07 18:47:10,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 18:47:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-07 18:47:10,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 18:47:10,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:10,065 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-07 18:47:10,066 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:10,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:10,066 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 4 times [2019-01-07 18:47:10,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:10,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:10,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:47:10,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:10,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:10,982 INFO L273 TraceCheckUtils]: 0: Hoare triple {449#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {451#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:10,984 INFO L273 TraceCheckUtils]: 1: Hoare triple {451#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {452#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:10,985 INFO L273 TraceCheckUtils]: 2: Hoare triple {452#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {453#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6)))} is VALID [2019-01-07 18:47:10,986 INFO L273 TraceCheckUtils]: 3: Hoare triple {453#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {454#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 3 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:10,986 INFO L273 TraceCheckUtils]: 4: Hoare triple {454#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 3 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {455#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:10,988 INFO L273 TraceCheckUtils]: 5: Hoare triple {455#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {456#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:10,989 INFO L273 TraceCheckUtils]: 6: Hoare triple {456#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {457#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:10,991 INFO L273 TraceCheckUtils]: 7: Hoare triple {457#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {458#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:10,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {458#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {450#false} is VALID [2019-01-07 18:47:10,993 INFO L273 TraceCheckUtils]: 9: Hoare triple {450#false} assume !false; {450#false} is VALID [2019-01-07 18:47:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:10,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:10,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:10,995 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:10,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:10,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:10,996 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 [2019-01-07 18:47:11,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:47:11,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:47:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:11,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:11,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:47:11,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:11,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:11,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-07 18:47:11,373 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:11,373 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_13]. (and (= ULTIMATE.start_main_~str2~6 (store v_ULTIMATE.start_main_~str2~6_13 2 (select ULTIMATE.start_main_~str1~6 0))) (<= ULTIMATE.start_main_~MAX~6 3) (<= 3 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:47:11,373 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 2)) (<= ULTIMATE.start_main_~MAX~6 3) (<= 3 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:47:11,410 INFO L273 TraceCheckUtils]: 0: Hoare triple {449#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {451#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:11,411 INFO L273 TraceCheckUtils]: 1: Hoare triple {451#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {452#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:11,412 INFO L273 TraceCheckUtils]: 2: Hoare triple {452#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {468#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:11,413 INFO L273 TraceCheckUtils]: 3: Hoare triple {468#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {472#(and (<= 3 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:11,414 INFO L273 TraceCheckUtils]: 4: Hoare triple {472#(and (<= 3 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~i~6 3))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {476#(and (= ULTIMATE.start_main_~j~6 0) (<= ULTIMATE.start_main_~MAX~6 3) (<= 3 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:11,415 INFO L273 TraceCheckUtils]: 5: Hoare triple {476#(and (= ULTIMATE.start_main_~j~6 0) (<= ULTIMATE.start_main_~MAX~6 3) (<= 3 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {480#(and (= ULTIMATE.start_main_~j~6 1) (<= ULTIMATE.start_main_~MAX~6 3) (<= 3 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:11,416 INFO L273 TraceCheckUtils]: 6: Hoare triple {480#(and (= ULTIMATE.start_main_~j~6 1) (<= ULTIMATE.start_main_~MAX~6 3) (<= 3 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {484#(and (<= ULTIMATE.start_main_~MAX~6 3) (<= 3 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:47:11,417 INFO L273 TraceCheckUtils]: 7: Hoare triple {484#(and (<= ULTIMATE.start_main_~MAX~6 3) (<= 3 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {488#(and (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 2)) (<= ULTIMATE.start_main_~MAX~6 3) (<= 3 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:11,419 INFO L273 TraceCheckUtils]: 8: Hoare triple {488#(and (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 2)) (<= ULTIMATE.start_main_~MAX~6 3) (<= 3 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {450#false} is VALID [2019-01-07 18:47:11,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {450#false} assume !false; {450#false} is VALID [2019-01-07 18:47:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:11,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:11,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:47:11,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:11,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:11,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-07 18:47:11,474 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:11,474 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) [2019-01-07 18:47:11,474 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6) [2019-01-07 18:47:11,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {450#false} assume !false; {450#false} is VALID [2019-01-07 18:47:11,543 INFO L273 TraceCheckUtils]: 8: Hoare triple {458#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {450#false} is VALID [2019-01-07 18:47:11,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {457#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {458#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:11,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {456#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {457#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:11,547 INFO L273 TraceCheckUtils]: 5: Hoare triple {455#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {456#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:11,547 INFO L273 TraceCheckUtils]: 4: Hoare triple {454#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 3 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {455#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:11,548 INFO L273 TraceCheckUtils]: 3: Hoare triple {468#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {454#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 3 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:11,549 INFO L273 TraceCheckUtils]: 2: Hoare triple {452#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {468#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:11,550 INFO L273 TraceCheckUtils]: 1: Hoare triple {451#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {452#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:11,550 INFO L273 TraceCheckUtils]: 0: Hoare triple {449#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {451#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:11,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:11,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2019-01-07 18:47:11,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:11,573 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2019-01-07 18:47:11,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:11,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2019-01-07 18:47:11,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:11,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-07 18:47:11,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-07 18:47:11,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-01-07 18:47:11,597 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 16 states. [2019-01-07 18:47:12,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:12,381 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-01-07 18:47:12,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-07 18:47:12,381 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2019-01-07 18:47:12,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 18:47:12,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-01-07 18:47:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 18:47:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-01-07 18:47:12,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 18 transitions. [2019-01-07 18:47:12,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:12,421 INFO L225 Difference]: With dead ends: 18 [2019-01-07 18:47:12,421 INFO L226 Difference]: Without dead ends: 12 [2019-01-07 18:47:12,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-01-07 18:47:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-07 18:47:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-07 18:47:12,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:12,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-01-07 18:47:12,551 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-07 18:47:12,551 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-07 18:47:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:12,553 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-01-07 18:47:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-01-07 18:47:12,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:12,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:12,553 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-07 18:47:12,553 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-07 18:47:12,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:12,554 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-01-07 18:47:12,554 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-01-07 18:47:12,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:12,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:12,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:12,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 18:47:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-07 18:47:12,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-01-07 18:47:12,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:12,556 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-07 18:47:12,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-07 18:47:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-01-07 18:47:12,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-07 18:47:12,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:12,557 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2019-01-07 18:47:12,558 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:12,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:12,558 INFO L82 PathProgramCache]: Analyzing trace with hash 375043724, now seen corresponding path program 5 times [2019-01-07 18:47:12,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:12,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:12,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:47:12,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:12,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:12,691 INFO L273 TraceCheckUtils]: 0: Hoare triple {612#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {614#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {614#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {615#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {615#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {616#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,694 INFO L273 TraceCheckUtils]: 3: Hoare triple {616#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {617#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,695 INFO L273 TraceCheckUtils]: 4: Hoare triple {617#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {618#(<= 4 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:12,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {618#(<= 4 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {617#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,703 INFO L273 TraceCheckUtils]: 6: Hoare triple {617#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {616#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {616#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {615#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,705 INFO L273 TraceCheckUtils]: 8: Hoare triple {615#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {614#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,705 INFO L273 TraceCheckUtils]: 9: Hoare triple {614#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {613#false} is VALID [2019-01-07 18:47:12,706 INFO L273 TraceCheckUtils]: 10: Hoare triple {613#false} assume !false; {613#false} is VALID [2019-01-07 18:47:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:12,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:12,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:12,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:12,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:12,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:12,706 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:47:12,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 18:47:12,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 18:47:12,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 18:47:12,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:47:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:12,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:12,845 INFO L273 TraceCheckUtils]: 0: Hoare triple {612#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {614#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,846 INFO L273 TraceCheckUtils]: 1: Hoare triple {614#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {615#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {615#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {616#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,849 INFO L273 TraceCheckUtils]: 3: Hoare triple {616#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {617#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,850 INFO L273 TraceCheckUtils]: 4: Hoare triple {617#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {618#(<= 4 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:12,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {618#(<= 4 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {617#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {617#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {616#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,854 INFO L273 TraceCheckUtils]: 7: Hoare triple {616#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {615#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,855 INFO L273 TraceCheckUtils]: 8: Hoare triple {615#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {614#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,871 INFO L273 TraceCheckUtils]: 9: Hoare triple {614#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {613#false} is VALID [2019-01-07 18:47:12,872 INFO L273 TraceCheckUtils]: 10: Hoare triple {613#false} assume !false; {613#false} is VALID [2019-01-07 18:47:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:12,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:12,958 INFO L273 TraceCheckUtils]: 10: Hoare triple {613#false} assume !false; {613#false} is VALID [2019-01-07 18:47:12,959 INFO L273 TraceCheckUtils]: 9: Hoare triple {614#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {613#false} is VALID [2019-01-07 18:47:12,960 INFO L273 TraceCheckUtils]: 8: Hoare triple {615#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {614#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {616#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {615#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,965 INFO L273 TraceCheckUtils]: 6: Hoare triple {617#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {616#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {618#(<= 4 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {617#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,967 INFO L273 TraceCheckUtils]: 4: Hoare triple {617#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {618#(<= 4 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:12,968 INFO L273 TraceCheckUtils]: 3: Hoare triple {616#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {617#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {615#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {616#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {614#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {615#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,970 INFO L273 TraceCheckUtils]: 0: Hoare triple {612#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {614#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:12,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:12,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-01-07 18:47:12,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:12,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-07 18:47:12,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:12,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-01-07 18:47:13,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:13,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 18:47:13,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 18:47:13,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-07 18:47:13,008 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2019-01-07 18:47:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:13,219 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-07 18:47:13,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-07 18:47:13,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-07 18:47:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 18:47:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-07 18:47:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 18:47:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-07 18:47:13,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 16 transitions. [2019-01-07 18:47:13,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:13,248 INFO L225 Difference]: With dead ends: 15 [2019-01-07 18:47:13,249 INFO L226 Difference]: Without dead ends: 13 [2019-01-07 18:47:13,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-07 18:47:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-07 18:47:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-07 18:47:13,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:13,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2019-01-07 18:47:13,332 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-01-07 18:47:13,333 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-01-07 18:47:13,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:13,334 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-01-07 18:47:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-07 18:47:13,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:13,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:13,334 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-01-07 18:47:13,334 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-01-07 18:47:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:13,335 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-01-07 18:47:13,336 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-07 18:47:13,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:13,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:13,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:13,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-07 18:47:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-07 18:47:13,337 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-01-07 18:47:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:13,338 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-07 18:47:13,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 18:47:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-07 18:47:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-07 18:47:13,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:13,338 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-07 18:47:13,339 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:13,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:13,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 6 times [2019-01-07 18:47:13,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:13,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:13,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:47:13,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:13,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:13,633 INFO L273 TraceCheckUtils]: 0: Hoare triple {766#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {768#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:13,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {768#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {769#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:13,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {769#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {770#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:13,637 INFO L273 TraceCheckUtils]: 3: Hoare triple {770#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {771#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3)))} is VALID [2019-01-07 18:47:13,638 INFO L273 TraceCheckUtils]: 4: Hoare triple {771#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {772#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 4 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:13,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {772#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 4 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {773#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:13,641 INFO L273 TraceCheckUtils]: 6: Hoare triple {773#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {774#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:13,642 INFO L273 TraceCheckUtils]: 7: Hoare triple {774#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {775#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:13,643 INFO L273 TraceCheckUtils]: 8: Hoare triple {775#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {776#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:13,645 INFO L273 TraceCheckUtils]: 9: Hoare triple {776#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {777#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:13,646 INFO L273 TraceCheckUtils]: 10: Hoare triple {777#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {767#false} is VALID [2019-01-07 18:47:13,646 INFO L273 TraceCheckUtils]: 11: Hoare triple {767#false} assume !false; {767#false} is VALID [2019-01-07 18:47:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:13,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:13,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:13,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:13,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:13,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:13,648 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:47:13,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 18:47:13,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 18:47:13,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 18:47:13,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:47:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:13,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:13,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:47:13,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:13,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:13,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-07 18:47:13,865 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:13,866 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_20]. (and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)) (= ULTIMATE.start_main_~str2~6 (store v_ULTIMATE.start_main_~str2~6_20 3 (select ULTIMATE.start_main_~str1~6 0))) (<= 4 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:47:13,866 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 3)) (<= 4 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:47:13,903 INFO L273 TraceCheckUtils]: 0: Hoare triple {766#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {766#true} is VALID [2019-01-07 18:47:13,903 INFO L273 TraceCheckUtils]: 1: Hoare triple {766#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {766#true} is VALID [2019-01-07 18:47:13,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {766#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {766#true} is VALID [2019-01-07 18:47:13,904 INFO L273 TraceCheckUtils]: 3: Hoare triple {766#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {766#true} is VALID [2019-01-07 18:47:13,904 INFO L273 TraceCheckUtils]: 4: Hoare triple {766#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {766#true} is VALID [2019-01-07 18:47:13,905 INFO L273 TraceCheckUtils]: 5: Hoare triple {766#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {796#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:13,906 INFO L273 TraceCheckUtils]: 6: Hoare triple {796#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {800#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} is VALID [2019-01-07 18:47:13,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {800#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {804#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:47:13,915 INFO L273 TraceCheckUtils]: 8: Hoare triple {804#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {808#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} is VALID [2019-01-07 18:47:13,916 INFO L273 TraceCheckUtils]: 9: Hoare triple {808#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {812#(and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 3)) (<= 4 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:13,917 INFO L273 TraceCheckUtils]: 10: Hoare triple {812#(and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 3)) (<= 4 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {767#false} is VALID [2019-01-07 18:47:13,917 INFO L273 TraceCheckUtils]: 11: Hoare triple {767#false} assume !false; {767#false} is VALID [2019-01-07 18:47:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-07 18:47:13,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:14,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:47:14,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:14,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:14,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-07 18:47:14,040 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:14,040 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (or (not (<= 0 ULTIMATE.start_main_~i~6)) (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) (< 0 ULTIMATE.start_main_~i~6)) [2019-01-07 18:47:14,041 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:47:14,368 INFO L273 TraceCheckUtils]: 11: Hoare triple {767#false} assume !false; {767#false} is VALID [2019-01-07 18:47:14,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {822#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {767#false} is VALID [2019-01-07 18:47:14,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {826#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {822#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:14,407 INFO L273 TraceCheckUtils]: 8: Hoare triple {830#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {826#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:14,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {834#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {830#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} is VALID [2019-01-07 18:47:14,432 INFO L273 TraceCheckUtils]: 6: Hoare triple {838#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {834#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:14,445 INFO L273 TraceCheckUtils]: 5: Hoare triple {766#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {838#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:14,445 INFO L273 TraceCheckUtils]: 4: Hoare triple {766#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {766#true} is VALID [2019-01-07 18:47:14,446 INFO L273 TraceCheckUtils]: 3: Hoare triple {766#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {766#true} is VALID [2019-01-07 18:47:14,446 INFO L273 TraceCheckUtils]: 2: Hoare triple {766#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {766#true} is VALID [2019-01-07 18:47:14,446 INFO L273 TraceCheckUtils]: 1: Hoare triple {766#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {766#true} is VALID [2019-01-07 18:47:14,446 INFO L273 TraceCheckUtils]: 0: Hoare triple {766#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {766#true} is VALID [2019-01-07 18:47:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-07 18:47:14,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:14,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2019-01-07 18:47:14,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:14,483 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2019-01-07 18:47:14,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:14,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2019-01-07 18:47:14,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:14,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-07 18:47:14,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-07 18:47:14,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-01-07 18:47:14,598 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 17 states. [2019-01-07 18:47:16,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:16,020 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-01-07 18:47:16,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-07 18:47:16,020 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2019-01-07 18:47:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-07 18:47:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-01-07 18:47:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-07 18:47:16,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-01-07 18:47:16,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 27 transitions. [2019-01-07 18:47:16,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:16,090 INFO L225 Difference]: With dead ends: 23 [2019-01-07 18:47:16,090 INFO L226 Difference]: Without dead ends: 15 [2019-01-07 18:47:16,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2019-01-07 18:47:16,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-07 18:47:16,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-07 18:47:16,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:16,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2019-01-07 18:47:16,186 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2019-01-07 18:47:16,186 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2019-01-07 18:47:16,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:16,188 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-07 18:47:16,188 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-07 18:47:16,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:16,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:16,189 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2019-01-07 18:47:16,189 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2019-01-07 18:47:16,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:16,190 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-07 18:47:16,190 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-07 18:47:16,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:16,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:16,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:16,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-07 18:47:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-07 18:47:16,192 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-07 18:47:16,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:16,192 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-07 18:47:16,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-07 18:47:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-07 18:47:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-07 18:47:16,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:16,192 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-07 18:47:16,193 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:16,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:16,193 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 7 times [2019-01-07 18:47:16,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:16,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:16,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:47:16,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:16,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:16,540 INFO L273 TraceCheckUtils]: 0: Hoare triple {975#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {977#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:16,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {977#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {978#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:16,543 INFO L273 TraceCheckUtils]: 2: Hoare triple {978#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {979#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:16,544 INFO L273 TraceCheckUtils]: 3: Hoare triple {979#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {980#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:16,545 INFO L273 TraceCheckUtils]: 4: Hoare triple {980#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {981#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6)))} is VALID [2019-01-07 18:47:16,547 INFO L273 TraceCheckUtils]: 5: Hoare triple {981#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {982#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 5 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:16,548 INFO L273 TraceCheckUtils]: 6: Hoare triple {982#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 5 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {983#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:16,549 INFO L273 TraceCheckUtils]: 7: Hoare triple {983#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {984#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:16,550 INFO L273 TraceCheckUtils]: 8: Hoare triple {984#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {985#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:16,554 INFO L273 TraceCheckUtils]: 9: Hoare triple {985#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {986#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:16,555 INFO L273 TraceCheckUtils]: 10: Hoare triple {986#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {987#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:16,556 INFO L273 TraceCheckUtils]: 11: Hoare triple {987#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {988#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:16,557 INFO L273 TraceCheckUtils]: 12: Hoare triple {988#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {976#false} is VALID [2019-01-07 18:47:16,557 INFO L273 TraceCheckUtils]: 13: Hoare triple {976#false} assume !false; {976#false} is VALID [2019-01-07 18:47:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:16,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:16,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:16,559 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:16,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:16,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:16,559 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:47:16,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:47:16,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:47:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:16,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:16,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:47:16,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:16,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:16,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-07 18:47:16,961 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:16,962 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_25]. (and (= (store v_ULTIMATE.start_main_~str2~6_25 4 (select ULTIMATE.start_main_~str1~6 0)) ULTIMATE.start_main_~str2~6) (<= 5 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 5)) [2019-01-07 18:47:16,962 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 5 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 5) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 4))) [2019-01-07 18:47:17,010 INFO L273 TraceCheckUtils]: 0: Hoare triple {975#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {977#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:17,014 INFO L273 TraceCheckUtils]: 1: Hoare triple {977#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {978#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:17,015 INFO L273 TraceCheckUtils]: 2: Hoare triple {978#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {979#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:17,015 INFO L273 TraceCheckUtils]: 3: Hoare triple {979#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {980#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:17,016 INFO L273 TraceCheckUtils]: 4: Hoare triple {980#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1004#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:17,017 INFO L273 TraceCheckUtils]: 5: Hoare triple {1004#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1008#(and (<= 5 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:47:17,018 INFO L273 TraceCheckUtils]: 6: Hoare triple {1008#(and (<= 5 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~i~6 5))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {1012#(and (<= 5 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 0) (<= ULTIMATE.start_main_~MAX~6 5))} is VALID [2019-01-07 18:47:17,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {1012#(and (<= 5 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 0) (<= ULTIMATE.start_main_~MAX~6 5))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1016#(and (<= 5 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 1) (<= ULTIMATE.start_main_~MAX~6 5))} is VALID [2019-01-07 18:47:17,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {1016#(and (<= 5 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 1) (<= ULTIMATE.start_main_~MAX~6 5))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1020#(and (<= 5 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 5) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:47:17,022 INFO L273 TraceCheckUtils]: 9: Hoare triple {1020#(and (<= 5 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 5) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1024#(and (<= 5 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 3) (<= ULTIMATE.start_main_~MAX~6 5))} is VALID [2019-01-07 18:47:17,022 INFO L273 TraceCheckUtils]: 10: Hoare triple {1024#(and (<= 5 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 3) (<= ULTIMATE.start_main_~MAX~6 5))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1028#(and (<= 5 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 4) (<= ULTIMATE.start_main_~MAX~6 5))} is VALID [2019-01-07 18:47:17,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {1028#(and (<= 5 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 4) (<= ULTIMATE.start_main_~MAX~6 5))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1032#(and (<= 5 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 5) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 4)))} is VALID [2019-01-07 18:47:17,024 INFO L273 TraceCheckUtils]: 12: Hoare triple {1032#(and (<= 5 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 5) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 4)))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {976#false} is VALID [2019-01-07 18:47:17,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {976#false} assume !false; {976#false} is VALID [2019-01-07 18:47:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:17,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:17,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:47:17,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:17,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:17,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-07 18:47:17,099 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:17,100 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) [2019-01-07 18:47:17,100 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6) [2019-01-07 18:47:17,174 INFO L273 TraceCheckUtils]: 13: Hoare triple {976#false} assume !false; {976#false} is VALID [2019-01-07 18:47:17,175 INFO L273 TraceCheckUtils]: 12: Hoare triple {988#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {976#false} is VALID [2019-01-07 18:47:17,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {987#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {988#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:17,177 INFO L273 TraceCheckUtils]: 10: Hoare triple {986#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {987#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:17,177 INFO L273 TraceCheckUtils]: 9: Hoare triple {985#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {986#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:17,178 INFO L273 TraceCheckUtils]: 8: Hoare triple {984#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {985#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:17,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {983#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {984#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:17,187 INFO L273 TraceCheckUtils]: 6: Hoare triple {982#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 5 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {983#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:17,188 INFO L273 TraceCheckUtils]: 5: Hoare triple {1004#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {982#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 5 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:17,188 INFO L273 TraceCheckUtils]: 4: Hoare triple {980#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1004#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:17,189 INFO L273 TraceCheckUtils]: 3: Hoare triple {979#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {980#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:17,190 INFO L273 TraceCheckUtils]: 2: Hoare triple {978#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {979#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:17,192 INFO L273 TraceCheckUtils]: 1: Hoare triple {977#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {978#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:17,193 INFO L273 TraceCheckUtils]: 0: Hoare triple {975#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {977#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:17,193 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:17,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:17,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2019-01-07 18:47:17,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:17,215 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2019-01-07 18:47:17,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:17,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2019-01-07 18:47:17,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:17,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-07 18:47:17,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-07 18:47:17,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-01-07 18:47:17,246 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 22 states. [2019-01-07 18:47:18,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:18,748 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-07 18:47:18,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-07 18:47:18,748 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2019-01-07 18:47:18,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-07 18:47:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-01-07 18:47:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-07 18:47:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2019-01-07 18:47:18,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 22 transitions. [2019-01-07 18:47:18,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:18,805 INFO L225 Difference]: With dead ends: 24 [2019-01-07 18:47:18,805 INFO L226 Difference]: Without dead ends: 16 [2019-01-07 18:47:18,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-01-07 18:47:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-07 18:47:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-07 18:47:18,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:18,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2019-01-07 18:47:18,923 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2019-01-07 18:47:18,923 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2019-01-07 18:47:18,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:18,924 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-01-07 18:47:18,925 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-01-07 18:47:18,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:18,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:18,925 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2019-01-07 18:47:18,925 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2019-01-07 18:47:18,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:18,926 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2019-01-07 18:47:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-01-07 18:47:18,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:18,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:18,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:18,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 18:47:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-01-07 18:47:18,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-01-07 18:47:18,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:18,928 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-01-07 18:47:18,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-07 18:47:18,929 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-01-07 18:47:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-07 18:47:18,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:18,929 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2019-01-07 18:47:18,929 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:18,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1662915732, now seen corresponding path program 8 times [2019-01-07 18:47:18,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:18,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:18,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:47:18,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:18,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:19,058 INFO L273 TraceCheckUtils]: 0: Hoare triple {1200#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {1202#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {1202#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1203#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,061 INFO L273 TraceCheckUtils]: 2: Hoare triple {1203#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1204#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,062 INFO L273 TraceCheckUtils]: 3: Hoare triple {1204#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1205#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,063 INFO L273 TraceCheckUtils]: 4: Hoare triple {1205#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1206#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,064 INFO L273 TraceCheckUtils]: 5: Hoare triple {1206#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1207#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {1207#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1208#(<= 6 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:19,066 INFO L273 TraceCheckUtils]: 7: Hoare triple {1208#(<= 6 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {1207#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,067 INFO L273 TraceCheckUtils]: 8: Hoare triple {1207#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1206#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {1206#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1205#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,069 INFO L273 TraceCheckUtils]: 10: Hoare triple {1205#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1204#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,071 INFO L273 TraceCheckUtils]: 11: Hoare triple {1204#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1203#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,072 INFO L273 TraceCheckUtils]: 12: Hoare triple {1203#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1202#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,072 INFO L273 TraceCheckUtils]: 13: Hoare triple {1202#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1201#false} is VALID [2019-01-07 18:47:19,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {1201#false} assume !false; {1201#false} is VALID [2019-01-07 18:47:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:19,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:19,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:19,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:19,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:19,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:19,074 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:47:19,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 18:47:19,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 18:47:19,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-07 18:47:19,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:47:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:19,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:19,250 INFO L273 TraceCheckUtils]: 0: Hoare triple {1200#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {1202#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,250 INFO L273 TraceCheckUtils]: 1: Hoare triple {1202#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1203#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,251 INFO L273 TraceCheckUtils]: 2: Hoare triple {1203#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1204#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,253 INFO L273 TraceCheckUtils]: 3: Hoare triple {1204#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1205#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,255 INFO L273 TraceCheckUtils]: 4: Hoare triple {1205#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1206#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {1206#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1207#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,257 INFO L273 TraceCheckUtils]: 6: Hoare triple {1207#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1208#(<= 6 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:19,258 INFO L273 TraceCheckUtils]: 7: Hoare triple {1208#(<= 6 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {1207#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {1207#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1206#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {1206#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1205#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {1205#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1204#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,263 INFO L273 TraceCheckUtils]: 11: Hoare triple {1204#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1203#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {1203#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1202#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {1202#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1201#false} is VALID [2019-01-07 18:47:19,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {1201#false} assume !false; {1201#false} is VALID [2019-01-07 18:47:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:19,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:19,392 INFO L273 TraceCheckUtils]: 14: Hoare triple {1201#false} assume !false; {1201#false} is VALID [2019-01-07 18:47:19,393 INFO L273 TraceCheckUtils]: 13: Hoare triple {1202#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1201#false} is VALID [2019-01-07 18:47:19,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {1203#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1202#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {1204#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1203#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {1205#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1204#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {1206#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1205#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {1207#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1206#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,399 INFO L273 TraceCheckUtils]: 7: Hoare triple {1208#(<= 6 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {1207#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {1207#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1208#(<= 6 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:19,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {1206#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1207#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,401 INFO L273 TraceCheckUtils]: 4: Hoare triple {1205#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1206#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,402 INFO L273 TraceCheckUtils]: 3: Hoare triple {1204#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1205#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,406 INFO L273 TraceCheckUtils]: 2: Hoare triple {1203#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1204#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {1202#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1203#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,408 INFO L273 TraceCheckUtils]: 0: Hoare triple {1200#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {1202#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:19,409 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:19,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:19,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2019-01-07 18:47:19,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:19,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-01-07 18:47:19,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:19,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2019-01-07 18:47:19,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:19,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 18:47:19,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 18:47:19,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-07 18:47:19,457 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2019-01-07 18:47:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:19,792 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-01-07 18:47:19,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-07 18:47:19,792 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-01-07 18:47:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-07 18:47:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-01-07 18:47:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-07 18:47:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-01-07 18:47:19,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 20 transitions. [2019-01-07 18:47:19,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:19,816 INFO L225 Difference]: With dead ends: 19 [2019-01-07 18:47:19,816 INFO L226 Difference]: Without dead ends: 17 [2019-01-07 18:47:19,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-07 18:47:19,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-07 18:47:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-07 18:47:20,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:20,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2019-01-07 18:47:20,018 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2019-01-07 18:47:20,018 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2019-01-07 18:47:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:20,019 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-01-07 18:47:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-07 18:47:20,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:20,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:20,019 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2019-01-07 18:47:20,020 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2019-01-07 18:47:20,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:20,020 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2019-01-07 18:47:20,020 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-07 18:47:20,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:20,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:20,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:20,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-07 18:47:20,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-07 18:47:20,022 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-07 18:47:20,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:20,022 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-07 18:47:20,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 18:47:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-07 18:47:20,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-07 18:47:20,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:20,023 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-07 18:47:20,023 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:20,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:20,024 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 9 times [2019-01-07 18:47:20,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:20,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:20,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:47:20,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:20,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:20,431 INFO L273 TraceCheckUtils]: 0: Hoare triple {1408#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {1410#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:20,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {1410#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1411#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:20,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {1411#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1412#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:20,434 INFO L273 TraceCheckUtils]: 3: Hoare triple {1412#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1413#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:20,436 INFO L273 TraceCheckUtils]: 4: Hoare triple {1413#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1414#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:20,437 INFO L273 TraceCheckUtils]: 5: Hoare triple {1414#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1415#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5)))} is VALID [2019-01-07 18:47:20,438 INFO L273 TraceCheckUtils]: 6: Hoare triple {1415#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1416#(or (= 6 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:20,439 INFO L273 TraceCheckUtils]: 7: Hoare triple {1416#(or (= 6 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {1417#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:20,441 INFO L273 TraceCheckUtils]: 8: Hoare triple {1417#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1418#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:20,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {1418#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1419#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:20,443 INFO L273 TraceCheckUtils]: 10: Hoare triple {1419#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1420#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:20,444 INFO L273 TraceCheckUtils]: 11: Hoare triple {1420#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1421#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:20,445 INFO L273 TraceCheckUtils]: 12: Hoare triple {1421#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1422#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:20,446 INFO L273 TraceCheckUtils]: 13: Hoare triple {1422#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1423#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:20,447 INFO L273 TraceCheckUtils]: 14: Hoare triple {1423#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1409#false} is VALID [2019-01-07 18:47:20,447 INFO L273 TraceCheckUtils]: 15: Hoare triple {1409#false} assume !false; {1409#false} is VALID [2019-01-07 18:47:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:20,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:20,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:20,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:20,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:20,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:20,449 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:47:20,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 18:47:20,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 18:47:20,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 18:47:20,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:47:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:20,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:20,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:47:20,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:20,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:20,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-07 18:47:20,748 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:20,749 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_36]. (and (<= 6 ULTIMATE.start_main_~MAX~6) (= (store v_ULTIMATE.start_main_~str2~6_36 5 (select ULTIMATE.start_main_~str1~6 0)) ULTIMATE.start_main_~str2~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7))) [2019-01-07 18:47:20,749 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 6 ULTIMATE.start_main_~MAX~6) (= (select ULTIMATE.start_main_~str2~6 5) (select ULTIMATE.start_main_~str1~6 0)) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7))) [2019-01-07 18:47:20,798 INFO L273 TraceCheckUtils]: 0: Hoare triple {1408#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {1408#true} is VALID [2019-01-07 18:47:20,798 INFO L273 TraceCheckUtils]: 1: Hoare triple {1408#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1408#true} is VALID [2019-01-07 18:47:20,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {1408#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1408#true} is VALID [2019-01-07 18:47:20,799 INFO L273 TraceCheckUtils]: 3: Hoare triple {1408#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1408#true} is VALID [2019-01-07 18:47:20,799 INFO L273 TraceCheckUtils]: 4: Hoare triple {1408#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1408#true} is VALID [2019-01-07 18:47:20,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {1408#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1408#true} is VALID [2019-01-07 18:47:20,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {1408#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1408#true} is VALID [2019-01-07 18:47:20,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {1408#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {1448#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:20,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {1448#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1452#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} is VALID [2019-01-07 18:47:20,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {1452#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1456#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:47:20,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {1456#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1460#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} is VALID [2019-01-07 18:47:20,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {1460#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1464#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} is VALID [2019-01-07 18:47:20,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {1464#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1468#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:20,809 INFO L273 TraceCheckUtils]: 13: Hoare triple {1468#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1472#(and (= (select ULTIMATE.start_main_~str2~6 5) (select ULTIMATE.start_main_~str1~6 0)) (<= 6 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)))} is VALID [2019-01-07 18:47:20,811 INFO L273 TraceCheckUtils]: 14: Hoare triple {1472#(and (= (select ULTIMATE.start_main_~str2~6 5) (select ULTIMATE.start_main_~str1~6 0)) (<= 6 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1409#false} is VALID [2019-01-07 18:47:20,811 INFO L273 TraceCheckUtils]: 15: Hoare triple {1409#false} assume !false; {1409#false} is VALID [2019-01-07 18:47:20,812 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-07 18:47:20,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:20,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:47:20,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:20,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:20,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-07 18:47:20,931 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:20,931 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (or (not (<= 0 ULTIMATE.start_main_~i~6)) (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) (< 0 ULTIMATE.start_main_~i~6)) [2019-01-07 18:47:20,932 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:47:21,240 INFO L273 TraceCheckUtils]: 15: Hoare triple {1409#false} assume !false; {1409#false} is VALID [2019-01-07 18:47:21,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {1482#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1409#false} is VALID [2019-01-07 18:47:21,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {1486#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1482#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:21,244 INFO L273 TraceCheckUtils]: 12: Hoare triple {1490#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1486#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:21,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {1494#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1490#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} is VALID [2019-01-07 18:47:21,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {1498#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1494#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:21,248 INFO L273 TraceCheckUtils]: 9: Hoare triple {1502#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1498#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:21,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {1506#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1502#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} is VALID [2019-01-07 18:47:21,251 INFO L273 TraceCheckUtils]: 7: Hoare triple {1408#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {1506#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:21,251 INFO L273 TraceCheckUtils]: 6: Hoare triple {1408#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1408#true} is VALID [2019-01-07 18:47:21,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {1408#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1408#true} is VALID [2019-01-07 18:47:21,252 INFO L273 TraceCheckUtils]: 4: Hoare triple {1408#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1408#true} is VALID [2019-01-07 18:47:21,252 INFO L273 TraceCheckUtils]: 3: Hoare triple {1408#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1408#true} is VALID [2019-01-07 18:47:21,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {1408#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1408#true} is VALID [2019-01-07 18:47:21,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {1408#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1408#true} is VALID [2019-01-07 18:47:21,253 INFO L273 TraceCheckUtils]: 0: Hoare triple {1408#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {1408#true} is VALID [2019-01-07 18:47:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-07 18:47:21,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:21,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2019-01-07 18:47:21,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:21,275 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2019-01-07 18:47:21,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:21,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2019-01-07 18:47:21,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:21,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-07 18:47:21,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-07 18:47:21,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-01-07 18:47:21,304 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 23 states. [2019-01-07 18:47:23,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:23,372 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-01-07 18:47:23,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-07 18:47:23,373 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2019-01-07 18:47:23,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-07 18:47:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-07 18:47:23,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-07 18:47:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-07 18:47:23,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 33 transitions. [2019-01-07 18:47:23,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:23,418 INFO L225 Difference]: With dead ends: 29 [2019-01-07 18:47:23,418 INFO L226 Difference]: Without dead ends: 19 [2019-01-07 18:47:23,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2019-01-07 18:47:23,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-07 18:47:23,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-07 18:47:23,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:23,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2019-01-07 18:47:23,565 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-01-07 18:47:23,565 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-01-07 18:47:23,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:23,566 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-01-07 18:47:23,566 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-07 18:47:23,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:23,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:23,567 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2019-01-07 18:47:23,567 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2019-01-07 18:47:23,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:23,568 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-01-07 18:47:23,568 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-07 18:47:23,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:23,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:23,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:23,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:23,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-07 18:47:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-07 18:47:23,569 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-07 18:47:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:23,569 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-07 18:47:23,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-07 18:47:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-07 18:47:23,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-07 18:47:23,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:23,570 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-07 18:47:23,571 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:23,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:23,571 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 10 times [2019-01-07 18:47:23,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:23,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:23,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:47:23,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:23,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:24,005 INFO L273 TraceCheckUtils]: 0: Hoare triple {1681#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {1683#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:24,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {1683#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1684#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:24,010 INFO L273 TraceCheckUtils]: 2: Hoare triple {1684#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1685#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:24,011 INFO L273 TraceCheckUtils]: 3: Hoare triple {1685#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1686#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:24,012 INFO L273 TraceCheckUtils]: 4: Hoare triple {1686#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1687#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:24,012 INFO L273 TraceCheckUtils]: 5: Hoare triple {1687#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1688#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:47:24,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {1688#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1689#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6)))} is VALID [2019-01-07 18:47:24,015 INFO L273 TraceCheckUtils]: 7: Hoare triple {1689#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1690#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 7 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:24,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {1690#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 7 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {1691#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:24,017 INFO L273 TraceCheckUtils]: 9: Hoare triple {1691#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1692#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:24,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {1692#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1693#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:24,019 INFO L273 TraceCheckUtils]: 11: Hoare triple {1693#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1694#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:24,020 INFO L273 TraceCheckUtils]: 12: Hoare triple {1694#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1695#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:24,021 INFO L273 TraceCheckUtils]: 13: Hoare triple {1695#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1696#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:24,022 INFO L273 TraceCheckUtils]: 14: Hoare triple {1696#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1697#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:24,024 INFO L273 TraceCheckUtils]: 15: Hoare triple {1697#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1698#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:24,025 INFO L273 TraceCheckUtils]: 16: Hoare triple {1698#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1682#false} is VALID [2019-01-07 18:47:24,025 INFO L273 TraceCheckUtils]: 17: Hoare triple {1682#false} assume !false; {1682#false} is VALID [2019-01-07 18:47:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:24,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:24,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:24,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:24,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:24,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:24,028 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:47:24,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:47:24,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:47:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:24,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:24,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:47:24,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:24,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:24,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-07 18:47:24,476 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:24,477 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_43]. (and (<= ULTIMATE.start_main_~MAX~6 7) (= ULTIMATE.start_main_~str2~6 (store v_ULTIMATE.start_main_~str2~6_43 6 (select ULTIMATE.start_main_~str1~6 0))) (<= 7 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:47:24,477 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select ULTIMATE.start_main_~str2~6 6) (select ULTIMATE.start_main_~str1~6 0)) (<= ULTIMATE.start_main_~MAX~6 7) (<= 7 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:47:24,524 INFO L273 TraceCheckUtils]: 0: Hoare triple {1681#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {1683#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:24,525 INFO L273 TraceCheckUtils]: 1: Hoare triple {1683#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1684#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:24,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {1684#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1685#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:24,528 INFO L273 TraceCheckUtils]: 3: Hoare triple {1685#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1686#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:24,529 INFO L273 TraceCheckUtils]: 4: Hoare triple {1686#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1687#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:24,530 INFO L273 TraceCheckUtils]: 5: Hoare triple {1687#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1688#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:47:24,532 INFO L273 TraceCheckUtils]: 6: Hoare triple {1688#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1720#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:24,533 INFO L273 TraceCheckUtils]: 7: Hoare triple {1720#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1724#(and (<= ULTIMATE.start_main_~i~6 7) (<= 7 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:24,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {1724#(and (<= ULTIMATE.start_main_~i~6 7) (<= 7 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {1728#(and (<= ULTIMATE.start_main_~MAX~6 7) (= ULTIMATE.start_main_~j~6 0) (<= 7 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:24,535 INFO L273 TraceCheckUtils]: 9: Hoare triple {1728#(and (<= ULTIMATE.start_main_~MAX~6 7) (= ULTIMATE.start_main_~j~6 0) (<= 7 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1732#(and (<= ULTIMATE.start_main_~MAX~6 7) (= ULTIMATE.start_main_~j~6 1) (<= 7 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:24,536 INFO L273 TraceCheckUtils]: 10: Hoare triple {1732#(and (<= ULTIMATE.start_main_~MAX~6 7) (= ULTIMATE.start_main_~j~6 1) (<= 7 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1736#(and (<= ULTIMATE.start_main_~MAX~6 7) (= ULTIMATE.start_main_~j~6 2) (<= 7 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:24,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {1736#(and (<= ULTIMATE.start_main_~MAX~6 7) (= ULTIMATE.start_main_~j~6 2) (<= 7 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1740#(and (<= ULTIMATE.start_main_~MAX~6 7) (= ULTIMATE.start_main_~j~6 3) (<= 7 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:24,538 INFO L273 TraceCheckUtils]: 12: Hoare triple {1740#(and (<= ULTIMATE.start_main_~MAX~6 7) (= ULTIMATE.start_main_~j~6 3) (<= 7 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1744#(and (<= ULTIMATE.start_main_~MAX~6 7) (= ULTIMATE.start_main_~j~6 4) (<= 7 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:24,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {1744#(and (<= ULTIMATE.start_main_~MAX~6 7) (= ULTIMATE.start_main_~j~6 4) (<= 7 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1748#(and (<= ULTIMATE.start_main_~MAX~6 7) (= ULTIMATE.start_main_~j~6 5) (<= 7 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:24,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {1748#(and (<= ULTIMATE.start_main_~MAX~6 7) (= ULTIMATE.start_main_~j~6 5) (<= 7 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1752#(and (<= ULTIMATE.start_main_~MAX~6 7) (= ULTIMATE.start_main_~j~6 6) (<= 7 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:24,542 INFO L273 TraceCheckUtils]: 15: Hoare triple {1752#(and (<= ULTIMATE.start_main_~MAX~6 7) (= ULTIMATE.start_main_~j~6 6) (<= 7 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1756#(and (= (select ULTIMATE.start_main_~str2~6 6) (select ULTIMATE.start_main_~str1~6 0)) (<= ULTIMATE.start_main_~MAX~6 7) (<= 7 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:24,543 INFO L273 TraceCheckUtils]: 16: Hoare triple {1756#(and (= (select ULTIMATE.start_main_~str2~6 6) (select ULTIMATE.start_main_~str1~6 0)) (<= ULTIMATE.start_main_~MAX~6 7) (<= 7 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1682#false} is VALID [2019-01-07 18:47:24,543 INFO L273 TraceCheckUtils]: 17: Hoare triple {1682#false} assume !false; {1682#false} is VALID [2019-01-07 18:47:24,545 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:24,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:24,936 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-01-07 18:47:24,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:47:25,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:25,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:25,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-07 18:47:25,086 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:25,086 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) [2019-01-07 18:47:25,087 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6) [2019-01-07 18:47:27,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {1682#false} assume !false; {1682#false} is VALID [2019-01-07 18:47:27,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {1698#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1682#false} is VALID [2019-01-07 18:47:27,137 INFO L273 TraceCheckUtils]: 15: Hoare triple {1697#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1698#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:27,150 INFO L273 TraceCheckUtils]: 14: Hoare triple {1696#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1697#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:27,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {1695#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1696#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:27,178 INFO L273 TraceCheckUtils]: 12: Hoare triple {1694#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1695#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:27,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {1693#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1694#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:27,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {1692#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1693#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:27,214 INFO L273 TraceCheckUtils]: 9: Hoare triple {1691#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1692#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:27,227 INFO L273 TraceCheckUtils]: 8: Hoare triple {1690#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 7 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {1691#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:27,239 INFO L273 TraceCheckUtils]: 7: Hoare triple {1720#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1690#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 7 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:27,252 INFO L273 TraceCheckUtils]: 6: Hoare triple {1688#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1720#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:27,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {1687#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1688#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:47:27,274 INFO L273 TraceCheckUtils]: 4: Hoare triple {1686#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1687#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:27,287 INFO L273 TraceCheckUtils]: 3: Hoare triple {1685#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1686#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:27,300 INFO L273 TraceCheckUtils]: 2: Hoare triple {1684#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1685#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:27,316 INFO L273 TraceCheckUtils]: 1: Hoare triple {1683#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1684#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:27,325 INFO L273 TraceCheckUtils]: 0: Hoare triple {1681#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {1683#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:27,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:27,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2019-01-07 18:47:27,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:27,370 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 18 [2019-01-07 18:47:27,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:27,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2019-01-07 18:47:27,770 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:27,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-07 18:47:27,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-07 18:47:27,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-01-07 18:47:27,771 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 28 states. [2019-01-07 18:47:29,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:29,906 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-07 18:47:29,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-07 18:47:29,907 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 18 [2019-01-07 18:47:29,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:29,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-07 18:47:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-01-07 18:47:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-07 18:47:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-01-07 18:47:29,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2019-01-07 18:47:29,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:29,945 INFO L225 Difference]: With dead ends: 30 [2019-01-07 18:47:29,945 INFO L226 Difference]: Without dead ends: 20 [2019-01-07 18:47:29,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2019-01-07 18:47:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-07 18:47:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-07 18:47:30,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:30,107 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2019-01-07 18:47:30,107 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2019-01-07 18:47:30,107 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2019-01-07 18:47:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:30,107 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-01-07 18:47:30,108 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-07 18:47:30,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:30,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:30,108 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2019-01-07 18:47:30,108 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2019-01-07 18:47:30,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:30,110 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-01-07 18:47:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-07 18:47:30,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:30,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:30,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:30,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-07 18:47:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-07 18:47:30,112 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2019-01-07 18:47:30,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:30,112 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-07 18:47:30,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-07 18:47:30,112 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-07 18:47:30,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-07 18:47:30,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:30,113 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2019-01-07 18:47:30,113 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:30,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:30,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1547184052, now seen corresponding path program 11 times [2019-01-07 18:47:30,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:30,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:30,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:47:30,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:30,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:30,354 INFO L273 TraceCheckUtils]: 0: Hoare triple {1968#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {1970#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,355 INFO L273 TraceCheckUtils]: 1: Hoare triple {1970#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1971#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {1971#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1972#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,356 INFO L273 TraceCheckUtils]: 3: Hoare triple {1972#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1973#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,357 INFO L273 TraceCheckUtils]: 4: Hoare triple {1973#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1974#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,358 INFO L273 TraceCheckUtils]: 5: Hoare triple {1974#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1975#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {1975#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1976#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {1976#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1977#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,362 INFO L273 TraceCheckUtils]: 8: Hoare triple {1977#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1978#(<= 8 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:30,363 INFO L273 TraceCheckUtils]: 9: Hoare triple {1978#(<= 8 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {1977#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,364 INFO L273 TraceCheckUtils]: 10: Hoare triple {1977#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1976#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,365 INFO L273 TraceCheckUtils]: 11: Hoare triple {1976#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1975#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,366 INFO L273 TraceCheckUtils]: 12: Hoare triple {1975#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1974#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {1974#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1973#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {1973#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1972#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {1972#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1971#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,370 INFO L273 TraceCheckUtils]: 16: Hoare triple {1971#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1970#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {1970#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1969#false} is VALID [2019-01-07 18:47:30,371 INFO L273 TraceCheckUtils]: 18: Hoare triple {1969#false} assume !false; {1969#false} is VALID [2019-01-07 18:47:30,372 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:30,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:30,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:30,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:30,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:30,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:30,374 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:47:30,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 18:47:30,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 18:47:30,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-07 18:47:30,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:47:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:30,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:30,525 INFO L273 TraceCheckUtils]: 0: Hoare triple {1968#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {1970#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {1970#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1971#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {1971#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1972#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,528 INFO L273 TraceCheckUtils]: 3: Hoare triple {1972#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1973#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,534 INFO L273 TraceCheckUtils]: 4: Hoare triple {1973#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1974#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,536 INFO L273 TraceCheckUtils]: 5: Hoare triple {1974#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1975#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,539 INFO L273 TraceCheckUtils]: 6: Hoare triple {1975#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1976#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,539 INFO L273 TraceCheckUtils]: 7: Hoare triple {1976#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1977#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,541 INFO L273 TraceCheckUtils]: 8: Hoare triple {1977#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1978#(<= 8 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:30,542 INFO L273 TraceCheckUtils]: 9: Hoare triple {1978#(<= 8 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {1977#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {1977#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1976#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,544 INFO L273 TraceCheckUtils]: 11: Hoare triple {1976#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1975#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,545 INFO L273 TraceCheckUtils]: 12: Hoare triple {1975#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1974#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,546 INFO L273 TraceCheckUtils]: 13: Hoare triple {1974#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1973#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,547 INFO L273 TraceCheckUtils]: 14: Hoare triple {1973#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1972#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {1972#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1971#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {1971#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1970#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,550 INFO L273 TraceCheckUtils]: 17: Hoare triple {1970#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1969#false} is VALID [2019-01-07 18:47:30,550 INFO L273 TraceCheckUtils]: 18: Hoare triple {1969#false} assume !false; {1969#false} is VALID [2019-01-07 18:47:30,551 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:30,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:30,746 INFO L273 TraceCheckUtils]: 18: Hoare triple {1969#false} assume !false; {1969#false} is VALID [2019-01-07 18:47:30,746 INFO L273 TraceCheckUtils]: 17: Hoare triple {1970#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {1969#false} is VALID [2019-01-07 18:47:30,747 INFO L273 TraceCheckUtils]: 16: Hoare triple {1971#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1970#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,748 INFO L273 TraceCheckUtils]: 15: Hoare triple {1972#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1971#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,749 INFO L273 TraceCheckUtils]: 14: Hoare triple {1973#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1972#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {1974#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1973#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,750 INFO L273 TraceCheckUtils]: 12: Hoare triple {1975#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1974#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {1976#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1975#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {1977#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {1976#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,753 INFO L273 TraceCheckUtils]: 9: Hoare triple {1978#(<= 8 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {1977#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,754 INFO L273 TraceCheckUtils]: 8: Hoare triple {1977#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1978#(<= 8 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:30,755 INFO L273 TraceCheckUtils]: 7: Hoare triple {1976#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1977#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,756 INFO L273 TraceCheckUtils]: 6: Hoare triple {1975#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1976#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,757 INFO L273 TraceCheckUtils]: 5: Hoare triple {1974#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1975#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,758 INFO L273 TraceCheckUtils]: 4: Hoare triple {1973#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1974#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,759 INFO L273 TraceCheckUtils]: 3: Hoare triple {1972#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1973#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,760 INFO L273 TraceCheckUtils]: 2: Hoare triple {1971#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1972#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,761 INFO L273 TraceCheckUtils]: 1: Hoare triple {1970#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {1971#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,762 INFO L273 TraceCheckUtils]: 0: Hoare triple {1968#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {1970#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:30,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:30,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2019-01-07 18:47:30,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:30,785 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-01-07 18:47:30,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:30,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2019-01-07 18:47:30,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:30,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 18:47:30,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 18:47:30,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-07 18:47:30,811 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-01-07 18:47:31,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:31,251 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-01-07 18:47:31,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-07 18:47:31,251 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-01-07 18:47:31,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 18:47:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-01-07 18:47:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 18:47:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-01-07 18:47:31,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 24 transitions. [2019-01-07 18:47:31,282 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:31,283 INFO L225 Difference]: With dead ends: 23 [2019-01-07 18:47:31,283 INFO L226 Difference]: Without dead ends: 21 [2019-01-07 18:47:31,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-01-07 18:47:31,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-07 18:47:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-07 18:47:31,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:31,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2019-01-07 18:47:31,495 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-01-07 18:47:31,495 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-01-07 18:47:31,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:31,496 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-07 18:47:31,496 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-07 18:47:31,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:31,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:31,497 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2019-01-07 18:47:31,497 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2019-01-07 18:47:31,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:31,498 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-07 18:47:31,498 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-07 18:47:31,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:31,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:31,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:31,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-07 18:47:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-07 18:47:31,499 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-01-07 18:47:31,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:31,499 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-07 18:47:31,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 18:47:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-07 18:47:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-07 18:47:31,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:31,500 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-07 18:47:31,500 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:31,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:31,500 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 12 times [2019-01-07 18:47:31,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:31,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:31,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:47:31,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:31,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:31,998 INFO L273 TraceCheckUtils]: 0: Hoare triple {2230#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {2232#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:32,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {2232#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2233#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:32,001 INFO L273 TraceCheckUtils]: 2: Hoare triple {2233#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2234#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:32,002 INFO L273 TraceCheckUtils]: 3: Hoare triple {2234#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2235#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:32,003 INFO L273 TraceCheckUtils]: 4: Hoare triple {2235#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2236#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:32,004 INFO L273 TraceCheckUtils]: 5: Hoare triple {2236#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2237#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:47:32,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {2237#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2238#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:32,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {2238#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2239#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7)))} is VALID [2019-01-07 18:47:32,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {2239#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2240#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 8 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:32,009 INFO L273 TraceCheckUtils]: 9: Hoare triple {2240#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 8 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {2241#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:32,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {2241#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2242#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:32,011 INFO L273 TraceCheckUtils]: 11: Hoare triple {2242#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2243#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:32,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {2243#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2244#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:32,013 INFO L273 TraceCheckUtils]: 13: Hoare triple {2244#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2245#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:32,014 INFO L273 TraceCheckUtils]: 14: Hoare triple {2245#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2246#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:32,015 INFO L273 TraceCheckUtils]: 15: Hoare triple {2246#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2247#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:32,017 INFO L273 TraceCheckUtils]: 16: Hoare triple {2247#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2248#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:32,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {2248#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2249#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:32,019 INFO L273 TraceCheckUtils]: 18: Hoare triple {2249#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {2231#false} is VALID [2019-01-07 18:47:32,019 INFO L273 TraceCheckUtils]: 19: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2019-01-07 18:47:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:32,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:32,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:32,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:32,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:32,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:32,022 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:47:32,031 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 18:47:32,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 18:47:32,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 18:47:32,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:47:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:32,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:32,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:47:32,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:32,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:32,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-07 18:47:32,405 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:32,406 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_58]. (and (= ULTIMATE.start_main_~str2~6 (store v_ULTIMATE.start_main_~str2~6_58 7 (select ULTIMATE.start_main_~str1~6 0))) (<= 8 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9))) [2019-01-07 18:47:32,406 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 7)) (<= 8 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9))) [2019-01-07 18:47:32,534 INFO L273 TraceCheckUtils]: 0: Hoare triple {2230#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {2230#true} is VALID [2019-01-07 18:47:32,534 INFO L273 TraceCheckUtils]: 1: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:32,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:32,534 INFO L273 TraceCheckUtils]: 3: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:32,534 INFO L273 TraceCheckUtils]: 4: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:32,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:32,535 INFO L273 TraceCheckUtils]: 6: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:32,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:32,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:32,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {2230#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {2280#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:32,537 INFO L273 TraceCheckUtils]: 10: Hoare triple {2280#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2284#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} is VALID [2019-01-07 18:47:32,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {2284#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2288#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:47:32,539 INFO L273 TraceCheckUtils]: 12: Hoare triple {2288#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2292#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} is VALID [2019-01-07 18:47:32,540 INFO L273 TraceCheckUtils]: 13: Hoare triple {2292#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2296#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} is VALID [2019-01-07 18:47:32,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {2296#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2300#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:32,543 INFO L273 TraceCheckUtils]: 15: Hoare triple {2300#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2304#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)) (= ULTIMATE.start_main_~j~6 6))} is VALID [2019-01-07 18:47:32,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {2304#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)) (= ULTIMATE.start_main_~j~6 6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2308#(and (= ULTIMATE.start_main_~j~6 7) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 8)))} is VALID [2019-01-07 18:47:32,545 INFO L273 TraceCheckUtils]: 17: Hoare triple {2308#(and (= ULTIMATE.start_main_~j~6 7) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 8)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2312#(and (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 7)) (<= 8 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9)))} is VALID [2019-01-07 18:47:32,547 INFO L273 TraceCheckUtils]: 18: Hoare triple {2312#(and (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 7)) (<= 8 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9)))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {2231#false} is VALID [2019-01-07 18:47:32,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2019-01-07 18:47:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-07 18:47:32,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:32,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:47:32,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:32,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:32,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-07 18:47:32,693 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:32,693 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (or (not (<= 0 ULTIMATE.start_main_~i~6)) (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) (< 0 ULTIMATE.start_main_~i~6)) [2019-01-07 18:47:32,694 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:47:33,383 INFO L273 TraceCheckUtils]: 19: Hoare triple {2231#false} assume !false; {2231#false} is VALID [2019-01-07 18:47:33,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {2322#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {2231#false} is VALID [2019-01-07 18:47:33,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {2326#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2322#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:33,387 INFO L273 TraceCheckUtils]: 16: Hoare triple {2330#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2326#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:33,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {2334#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2330#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} is VALID [2019-01-07 18:47:33,390 INFO L273 TraceCheckUtils]: 14: Hoare triple {2338#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2334#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:33,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {2342#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2338#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:33,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {2346#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2342#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} is VALID [2019-01-07 18:47:33,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {2350#(or (< ULTIMATE.start_main_~i~6 6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 7)) (< 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2346#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:33,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {2354#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 8)) (< ULTIMATE.start_main_~i~6 7) (< 7 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2350#(or (< ULTIMATE.start_main_~i~6 6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 7)) (< 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:33,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {2230#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {2354#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 8)) (< ULTIMATE.start_main_~i~6 7) (< 7 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:33,396 INFO L273 TraceCheckUtils]: 8: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:33,397 INFO L273 TraceCheckUtils]: 7: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:33,397 INFO L273 TraceCheckUtils]: 6: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:33,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:33,397 INFO L273 TraceCheckUtils]: 4: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:33,398 INFO L273 TraceCheckUtils]: 3: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:33,398 INFO L273 TraceCheckUtils]: 2: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:33,398 INFO L273 TraceCheckUtils]: 1: Hoare triple {2230#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2230#true} is VALID [2019-01-07 18:47:33,398 INFO L273 TraceCheckUtils]: 0: Hoare triple {2230#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {2230#true} is VALID [2019-01-07 18:47:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-07 18:47:33,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:33,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 38 [2019-01-07 18:47:33,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:33,420 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-01-07 18:47:33,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:33,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2019-01-07 18:47:33,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:33,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-07 18:47:33,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-07 18:47:33,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2019-01-07 18:47:33,455 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 29 states. [2019-01-07 18:47:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:35,993 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-01-07 18:47:35,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-07 18:47:35,993 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-01-07 18:47:35,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-07 18:47:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-01-07 18:47:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-07 18:47:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-01-07 18:47:35,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 39 transitions. [2019-01-07 18:47:36,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:36,051 INFO L225 Difference]: With dead ends: 35 [2019-01-07 18:47:36,051 INFO L226 Difference]: Without dead ends: 23 [2019-01-07 18:47:36,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=403, Invalid=2147, Unknown=0, NotChecked=0, Total=2550 [2019-01-07 18:47:36,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-07 18:47:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-07 18:47:36,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:36,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2019-01-07 18:47:36,275 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2019-01-07 18:47:36,275 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2019-01-07 18:47:36,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:36,276 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-01-07 18:47:36,276 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-07 18:47:36,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:36,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:36,276 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2019-01-07 18:47:36,277 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2019-01-07 18:47:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:36,277 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-01-07 18:47:36,277 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-07 18:47:36,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:36,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:36,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:36,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-07 18:47:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-07 18:47:36,278 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-07 18:47:36,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:36,278 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-07 18:47:36,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-07 18:47:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-07 18:47:36,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-07 18:47:36,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:36,279 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-07 18:47:36,279 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:36,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:36,279 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 13 times [2019-01-07 18:47:36,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:36,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:47:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:36,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:37,168 INFO L273 TraceCheckUtils]: 0: Hoare triple {2567#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {2569#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:37,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {2569#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2570#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:37,170 INFO L273 TraceCheckUtils]: 2: Hoare triple {2570#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2571#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:37,171 INFO L273 TraceCheckUtils]: 3: Hoare triple {2571#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2572#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:37,172 INFO L273 TraceCheckUtils]: 4: Hoare triple {2572#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2573#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:37,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {2573#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2574#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:47:37,175 INFO L273 TraceCheckUtils]: 6: Hoare triple {2574#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2575#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:37,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {2575#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2576#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:47:37,177 INFO L273 TraceCheckUtils]: 8: Hoare triple {2576#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2577#(or (and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6)) (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))))} is VALID [2019-01-07 18:47:37,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {2577#(or (and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6)) (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2578#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 9 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:37,179 INFO L273 TraceCheckUtils]: 10: Hoare triple {2578#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 9 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {2579#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:37,180 INFO L273 TraceCheckUtils]: 11: Hoare triple {2579#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2580#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:37,181 INFO L273 TraceCheckUtils]: 12: Hoare triple {2580#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2581#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:37,183 INFO L273 TraceCheckUtils]: 13: Hoare triple {2581#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2582#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:37,184 INFO L273 TraceCheckUtils]: 14: Hoare triple {2582#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2583#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:37,185 INFO L273 TraceCheckUtils]: 15: Hoare triple {2583#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2584#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:37,186 INFO L273 TraceCheckUtils]: 16: Hoare triple {2584#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2585#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:37,187 INFO L273 TraceCheckUtils]: 17: Hoare triple {2585#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2586#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:37,188 INFO L273 TraceCheckUtils]: 18: Hoare triple {2586#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2587#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:37,189 INFO L273 TraceCheckUtils]: 19: Hoare triple {2587#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2588#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:37,191 INFO L273 TraceCheckUtils]: 20: Hoare triple {2588#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {2568#false} is VALID [2019-01-07 18:47:37,191 INFO L273 TraceCheckUtils]: 21: Hoare triple {2568#false} assume !false; {2568#false} is VALID [2019-01-07 18:47:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:37,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:37,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:37,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:37,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:37,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:37,194 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:47:37,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:47:37,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:47:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:37,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:37,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:47:37,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:37,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:37,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-07 18:47:37,718 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:37,719 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_67]. (and (= ULTIMATE.start_main_~str2~6 (store v_ULTIMATE.start_main_~str2~6_67 8 (select ULTIMATE.start_main_~str1~6 0))) (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:47:37,719 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 8))) [2019-01-07 18:47:37,777 INFO L273 TraceCheckUtils]: 0: Hoare triple {2567#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {2569#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:37,778 INFO L273 TraceCheckUtils]: 1: Hoare triple {2569#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2570#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:37,779 INFO L273 TraceCheckUtils]: 2: Hoare triple {2570#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2571#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:37,780 INFO L273 TraceCheckUtils]: 3: Hoare triple {2571#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2572#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:37,781 INFO L273 TraceCheckUtils]: 4: Hoare triple {2572#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2573#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:37,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {2573#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2574#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:47:37,783 INFO L273 TraceCheckUtils]: 6: Hoare triple {2574#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2575#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:37,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {2575#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2576#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:47:37,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {2576#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2616#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:37,786 INFO L273 TraceCheckUtils]: 9: Hoare triple {2616#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2620#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:37,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {2620#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {2624#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 0))} is VALID [2019-01-07 18:47:37,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {2624#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 0))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2628#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 1))} is VALID [2019-01-07 18:47:37,789 INFO L273 TraceCheckUtils]: 12: Hoare triple {2628#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 1))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2632#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:47:37,806 INFO L273 TraceCheckUtils]: 13: Hoare triple {2632#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2636#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 3))} is VALID [2019-01-07 18:47:37,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {2636#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 3))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2640#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 4))} is VALID [2019-01-07 18:47:37,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {2640#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 4))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2644#(and (<= ULTIMATE.start_main_~MAX~6 9) (= ULTIMATE.start_main_~j~6 5) (<= 9 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:37,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {2644#(and (<= ULTIMATE.start_main_~MAX~6 9) (= ULTIMATE.start_main_~j~6 5) (<= 9 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2648#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 6))} is VALID [2019-01-07 18:47:37,809 INFO L273 TraceCheckUtils]: 17: Hoare triple {2648#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2652#(and (= ULTIMATE.start_main_~j~6 7) (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:37,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {2652#(and (= ULTIMATE.start_main_~j~6 7) (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2656#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 8))} is VALID [2019-01-07 18:47:37,811 INFO L273 TraceCheckUtils]: 19: Hoare triple {2656#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2660#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 8)))} is VALID [2019-01-07 18:47:37,811 INFO L273 TraceCheckUtils]: 20: Hoare triple {2660#(and (<= ULTIMATE.start_main_~MAX~6 9) (<= 9 ULTIMATE.start_main_~MAX~6) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 8)))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {2568#false} is VALID [2019-01-07 18:47:37,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {2568#false} assume !false; {2568#false} is VALID [2019-01-07 18:47:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:37,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:37,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:47:37,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:37,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:37,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-07 18:47:37,914 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:37,915 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) [2019-01-07 18:47:37,915 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6) [2019-01-07 18:47:38,262 INFO L273 TraceCheckUtils]: 21: Hoare triple {2568#false} assume !false; {2568#false} is VALID [2019-01-07 18:47:38,263 INFO L273 TraceCheckUtils]: 20: Hoare triple {2588#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {2568#false} is VALID [2019-01-07 18:47:38,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {2587#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2588#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:38,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {2586#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2587#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:38,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {2585#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2586#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:38,267 INFO L273 TraceCheckUtils]: 16: Hoare triple {2584#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2585#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:38,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {2583#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2584#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:38,270 INFO L273 TraceCheckUtils]: 14: Hoare triple {2582#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2583#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:38,271 INFO L273 TraceCheckUtils]: 13: Hoare triple {2581#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2582#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:38,272 INFO L273 TraceCheckUtils]: 12: Hoare triple {2580#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2581#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:38,274 INFO L273 TraceCheckUtils]: 11: Hoare triple {2579#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2580#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:38,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {2578#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 9 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {2579#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:38,280 INFO L273 TraceCheckUtils]: 9: Hoare triple {2616#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2578#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 9 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:38,281 INFO L273 TraceCheckUtils]: 8: Hoare triple {2576#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2616#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:38,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {2575#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2576#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:47:38,282 INFO L273 TraceCheckUtils]: 6: Hoare triple {2574#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2575#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:38,283 INFO L273 TraceCheckUtils]: 5: Hoare triple {2573#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2574#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:47:38,284 INFO L273 TraceCheckUtils]: 4: Hoare triple {2572#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2573#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:38,285 INFO L273 TraceCheckUtils]: 3: Hoare triple {2571#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2572#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:38,286 INFO L273 TraceCheckUtils]: 2: Hoare triple {2570#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2571#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:38,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {2569#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2570#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:38,288 INFO L273 TraceCheckUtils]: 0: Hoare triple {2567#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {2569#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:38,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:38,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2019-01-07 18:47:38,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:38,310 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2019-01-07 18:47:38,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:38,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2019-01-07 18:47:38,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:38,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-07 18:47:38,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-07 18:47:38,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2019-01-07 18:47:38,349 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 34 states. [2019-01-07 18:47:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:40,930 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-01-07 18:47:40,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-07 18:47:40,930 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2019-01-07 18:47:40,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:40,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-07 18:47:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-01-07 18:47:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-07 18:47:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-01-07 18:47:40,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 30 transitions. [2019-01-07 18:47:40,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:40,981 INFO L225 Difference]: With dead ends: 36 [2019-01-07 18:47:40,981 INFO L226 Difference]: Without dead ends: 24 [2019-01-07 18:47:40,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2019-01-07 18:47:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-07 18:47:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-07 18:47:41,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:41,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2019-01-07 18:47:41,222 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2019-01-07 18:47:41,222 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2019-01-07 18:47:41,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:41,223 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-07 18:47:41,223 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-07 18:47:41,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:41,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:41,224 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2019-01-07 18:47:41,224 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2019-01-07 18:47:41,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:41,225 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-07 18:47:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-07 18:47:41,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:41,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:41,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:41,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-07 18:47:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-07 18:47:41,227 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-01-07 18:47:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:41,227 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-07 18:47:41,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-07 18:47:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-07 18:47:41,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-07 18:47:41,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:41,228 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2019-01-07 18:47:41,228 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:41,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:41,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1283882284, now seen corresponding path program 14 times [2019-01-07 18:47:41,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:41,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:41,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:47:41,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:41,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:41,832 INFO L273 TraceCheckUtils]: 0: Hoare triple {2916#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {2918#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {2918#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2919#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {2919#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2920#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,834 INFO L273 TraceCheckUtils]: 3: Hoare triple {2920#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2921#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,835 INFO L273 TraceCheckUtils]: 4: Hoare triple {2921#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2922#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,836 INFO L273 TraceCheckUtils]: 5: Hoare triple {2922#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2923#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,836 INFO L273 TraceCheckUtils]: 6: Hoare triple {2923#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2924#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {2924#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2925#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,838 INFO L273 TraceCheckUtils]: 8: Hoare triple {2925#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2926#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,839 INFO L273 TraceCheckUtils]: 9: Hoare triple {2926#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2927#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {2927#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2928#(<= 10 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:41,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {2928#(<= 10 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {2927#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,843 INFO L273 TraceCheckUtils]: 12: Hoare triple {2927#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2926#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {2926#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2925#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {2925#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2924#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,846 INFO L273 TraceCheckUtils]: 15: Hoare triple {2924#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2923#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,847 INFO L273 TraceCheckUtils]: 16: Hoare triple {2923#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2922#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,848 INFO L273 TraceCheckUtils]: 17: Hoare triple {2922#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2921#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,849 INFO L273 TraceCheckUtils]: 18: Hoare triple {2921#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2920#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,850 INFO L273 TraceCheckUtils]: 19: Hoare triple {2920#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2919#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,851 INFO L273 TraceCheckUtils]: 20: Hoare triple {2919#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2918#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:41,851 INFO L273 TraceCheckUtils]: 21: Hoare triple {2918#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {2917#false} is VALID [2019-01-07 18:47:41,852 INFO L273 TraceCheckUtils]: 22: Hoare triple {2917#false} assume !false; {2917#false} is VALID [2019-01-07 18:47:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:41,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:41,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:41,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:41,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:41,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:41,854 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:47:41,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 18:47:41,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 18:47:41,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-07 18:47:41,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:47:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:41,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:42,030 INFO L273 TraceCheckUtils]: 0: Hoare triple {2916#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {2918#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,032 INFO L273 TraceCheckUtils]: 1: Hoare triple {2918#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2919#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {2919#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2920#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,034 INFO L273 TraceCheckUtils]: 3: Hoare triple {2920#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2921#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,035 INFO L273 TraceCheckUtils]: 4: Hoare triple {2921#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2922#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,036 INFO L273 TraceCheckUtils]: 5: Hoare triple {2922#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2923#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {2923#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2924#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {2924#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2925#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {2925#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2926#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,040 INFO L273 TraceCheckUtils]: 9: Hoare triple {2926#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2927#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,041 INFO L273 TraceCheckUtils]: 10: Hoare triple {2927#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2928#(<= 10 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:42,042 INFO L273 TraceCheckUtils]: 11: Hoare triple {2928#(<= 10 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {2927#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,043 INFO L273 TraceCheckUtils]: 12: Hoare triple {2927#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2926#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,044 INFO L273 TraceCheckUtils]: 13: Hoare triple {2926#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2925#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,045 INFO L273 TraceCheckUtils]: 14: Hoare triple {2925#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2924#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,046 INFO L273 TraceCheckUtils]: 15: Hoare triple {2924#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2923#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {2923#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2922#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {2922#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2921#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,049 INFO L273 TraceCheckUtils]: 18: Hoare triple {2921#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2920#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,050 INFO L273 TraceCheckUtils]: 19: Hoare triple {2920#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2919#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,051 INFO L273 TraceCheckUtils]: 20: Hoare triple {2919#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2918#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,052 INFO L273 TraceCheckUtils]: 21: Hoare triple {2918#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {2917#false} is VALID [2019-01-07 18:47:42,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {2917#false} assume !false; {2917#false} is VALID [2019-01-07 18:47:42,053 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:42,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:42,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {2917#false} assume !false; {2917#false} is VALID [2019-01-07 18:47:42,306 INFO L273 TraceCheckUtils]: 21: Hoare triple {2918#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {2917#false} is VALID [2019-01-07 18:47:42,307 INFO L273 TraceCheckUtils]: 20: Hoare triple {2919#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2918#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,308 INFO L273 TraceCheckUtils]: 19: Hoare triple {2920#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2919#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,309 INFO L273 TraceCheckUtils]: 18: Hoare triple {2921#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2920#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {2922#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2921#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {2923#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2922#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,312 INFO L273 TraceCheckUtils]: 15: Hoare triple {2924#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2923#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,313 INFO L273 TraceCheckUtils]: 14: Hoare triple {2925#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2924#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,314 INFO L273 TraceCheckUtils]: 13: Hoare triple {2926#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2925#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,315 INFO L273 TraceCheckUtils]: 12: Hoare triple {2927#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {2926#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,316 INFO L273 TraceCheckUtils]: 11: Hoare triple {2928#(<= 10 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {2927#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,317 INFO L273 TraceCheckUtils]: 10: Hoare triple {2927#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2928#(<= 10 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:42,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {2926#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2927#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {2925#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2926#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {2924#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2925#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {2923#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2924#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {2922#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2923#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,323 INFO L273 TraceCheckUtils]: 4: Hoare triple {2921#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2922#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,324 INFO L273 TraceCheckUtils]: 3: Hoare triple {2920#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2921#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {2919#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2920#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,326 INFO L273 TraceCheckUtils]: 1: Hoare triple {2918#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {2919#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,327 INFO L273 TraceCheckUtils]: 0: Hoare triple {2916#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {2918#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:42,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:42,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2019-01-07 18:47:42,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:42,349 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-01-07 18:47:42,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:42,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2019-01-07 18:47:42,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:42,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-07 18:47:42,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-07 18:47:42,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-07 18:47:42,380 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 13 states. [2019-01-07 18:47:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:42,936 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-07 18:47:42,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-07 18:47:42,936 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-01-07 18:47:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-07 18:47:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-01-07 18:47:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-07 18:47:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2019-01-07 18:47:42,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2019-01-07 18:47:42,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:42,985 INFO L225 Difference]: With dead ends: 27 [2019-01-07 18:47:42,986 INFO L226 Difference]: Without dead ends: 25 [2019-01-07 18:47:42,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 20 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-01-07 18:47:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-07 18:47:43,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-07 18:47:43,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:43,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2019-01-07 18:47:43,505 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2019-01-07 18:47:43,506 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2019-01-07 18:47:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:43,506 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-01-07 18:47:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-07 18:47:43,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:43,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:43,507 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2019-01-07 18:47:43,508 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2019-01-07 18:47:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:43,509 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-01-07 18:47:43,509 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-07 18:47:43,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:43,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:43,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:43,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-07 18:47:43,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-07 18:47:43,510 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2019-01-07 18:47:43,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:43,510 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-07 18:47:43,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-07 18:47:43,511 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-07 18:47:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-07 18:47:43,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:43,511 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-07 18:47:43,511 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:43,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:43,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 15 times [2019-01-07 18:47:43,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:43,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:43,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:47:43,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:43,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:44,565 INFO L273 TraceCheckUtils]: 0: Hoare triple {3232#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {3234#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:44,566 INFO L273 TraceCheckUtils]: 1: Hoare triple {3234#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3235#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:44,567 INFO L273 TraceCheckUtils]: 2: Hoare triple {3235#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3236#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:44,568 INFO L273 TraceCheckUtils]: 3: Hoare triple {3236#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3237#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:44,569 INFO L273 TraceCheckUtils]: 4: Hoare triple {3237#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3238#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:44,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {3238#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3239#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:47:44,572 INFO L273 TraceCheckUtils]: 6: Hoare triple {3239#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3240#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:44,573 INFO L273 TraceCheckUtils]: 7: Hoare triple {3240#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3241#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:47:44,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {3241#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3242#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:44,575 INFO L273 TraceCheckUtils]: 9: Hoare triple {3242#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3243#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6)))} is VALID [2019-01-07 18:47:44,576 INFO L273 TraceCheckUtils]: 10: Hoare triple {3243#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3244#(or (= 10 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:44,577 INFO L273 TraceCheckUtils]: 11: Hoare triple {3244#(or (= 10 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {3245#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:44,578 INFO L273 TraceCheckUtils]: 12: Hoare triple {3245#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3246#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:44,579 INFO L273 TraceCheckUtils]: 13: Hoare triple {3246#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3247#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:44,580 INFO L273 TraceCheckUtils]: 14: Hoare triple {3247#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3248#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:44,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {3248#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3249#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:44,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {3249#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3250#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:44,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {3250#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3251#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:44,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {3251#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3252#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:44,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {3252#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3253#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:44,587 INFO L273 TraceCheckUtils]: 20: Hoare triple {3253#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3254#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:44,588 INFO L273 TraceCheckUtils]: 21: Hoare triple {3254#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3255#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:44,589 INFO L273 TraceCheckUtils]: 22: Hoare triple {3255#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {3233#false} is VALID [2019-01-07 18:47:44,590 INFO L273 TraceCheckUtils]: 23: Hoare triple {3233#false} assume !false; {3233#false} is VALID [2019-01-07 18:47:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:44,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:44,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:44,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:44,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:44,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:44,592 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:47:44,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 18:47:44,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 18:47:44,619 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 18:47:44,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:47:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:44,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:45,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:47:45,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:45,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:45,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-07 18:47:45,075 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:45,076 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_86]. (and (<= 10 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 11)) (= ULTIMATE.start_main_~str2~6 (store v_ULTIMATE.start_main_~str2~6_86 9 (select ULTIMATE.start_main_~str1~6 0)))) [2019-01-07 18:47:45,076 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 10 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 11)) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 9))) [2019-01-07 18:47:45,133 INFO L273 TraceCheckUtils]: 0: Hoare triple {3232#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {3232#true} is VALID [2019-01-07 18:47:45,134 INFO L273 TraceCheckUtils]: 1: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,134 INFO L273 TraceCheckUtils]: 2: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,134 INFO L273 TraceCheckUtils]: 3: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,135 INFO L273 TraceCheckUtils]: 4: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,135 INFO L273 TraceCheckUtils]: 6: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,135 INFO L273 TraceCheckUtils]: 7: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,135 INFO L273 TraceCheckUtils]: 8: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,136 INFO L273 TraceCheckUtils]: 10: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,137 INFO L273 TraceCheckUtils]: 11: Hoare triple {3232#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {3292#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:45,138 INFO L273 TraceCheckUtils]: 12: Hoare triple {3292#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3296#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} is VALID [2019-01-07 18:47:45,138 INFO L273 TraceCheckUtils]: 13: Hoare triple {3296#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3300#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:47:45,139 INFO L273 TraceCheckUtils]: 14: Hoare triple {3300#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3304#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} is VALID [2019-01-07 18:47:45,140 INFO L273 TraceCheckUtils]: 15: Hoare triple {3304#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3308#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} is VALID [2019-01-07 18:47:45,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {3308#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3312#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:45,143 INFO L273 TraceCheckUtils]: 17: Hoare triple {3312#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3316#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)) (= ULTIMATE.start_main_~j~6 6))} is VALID [2019-01-07 18:47:45,144 INFO L273 TraceCheckUtils]: 18: Hoare triple {3316#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)) (= ULTIMATE.start_main_~j~6 6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3320#(and (= ULTIMATE.start_main_~j~6 7) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 8)))} is VALID [2019-01-07 18:47:45,145 INFO L273 TraceCheckUtils]: 19: Hoare triple {3320#(and (= ULTIMATE.start_main_~j~6 7) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 8)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3324#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9)) (= ULTIMATE.start_main_~j~6 8))} is VALID [2019-01-07 18:47:45,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {3324#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9)) (= ULTIMATE.start_main_~j~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3328#(and (= ULTIMATE.start_main_~j~6 9) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 10)))} is VALID [2019-01-07 18:47:45,147 INFO L273 TraceCheckUtils]: 21: Hoare triple {3328#(and (= ULTIMATE.start_main_~j~6 9) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 10)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3332#(and (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 9)) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 11)) (<= 10 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:45,149 INFO L273 TraceCheckUtils]: 22: Hoare triple {3332#(and (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 9)) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 11)) (<= 10 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {3233#false} is VALID [2019-01-07 18:47:45,149 INFO L273 TraceCheckUtils]: 23: Hoare triple {3233#false} assume !false; {3233#false} is VALID [2019-01-07 18:47:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-07 18:47:45,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:45,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:47:45,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:45,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:45,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-07 18:47:45,293 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:45,293 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (or (not (<= 0 ULTIMATE.start_main_~i~6)) (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) (< 0 ULTIMATE.start_main_~i~6)) [2019-01-07 18:47:45,293 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:47:45,856 INFO L273 TraceCheckUtils]: 23: Hoare triple {3233#false} assume !false; {3233#false} is VALID [2019-01-07 18:47:45,858 INFO L273 TraceCheckUtils]: 22: Hoare triple {3342#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {3233#false} is VALID [2019-01-07 18:47:45,859 INFO L273 TraceCheckUtils]: 21: Hoare triple {3346#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3342#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:45,860 INFO L273 TraceCheckUtils]: 20: Hoare triple {3350#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3346#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:45,862 INFO L273 TraceCheckUtils]: 19: Hoare triple {3354#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3350#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} is VALID [2019-01-07 18:47:45,863 INFO L273 TraceCheckUtils]: 18: Hoare triple {3358#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3354#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:45,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {3362#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3358#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:45,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {3366#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3362#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} is VALID [2019-01-07 18:47:45,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {3370#(or (< ULTIMATE.start_main_~i~6 6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 7)) (< 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3366#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:45,889 INFO L273 TraceCheckUtils]: 14: Hoare triple {3374#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 8)) (< ULTIMATE.start_main_~i~6 7) (< 7 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3370#(or (< ULTIMATE.start_main_~i~6 6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 7)) (< 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:45,889 INFO L273 TraceCheckUtils]: 13: Hoare triple {3378#(or (< 8 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 9)) (< ULTIMATE.start_main_~i~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3374#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 8)) (< ULTIMATE.start_main_~i~6 7) (< 7 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:45,890 INFO L273 TraceCheckUtils]: 12: Hoare triple {3382#(or (< ULTIMATE.start_main_~i~6 9) (= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6) (< 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3378#(or (< 8 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 9)) (< ULTIMATE.start_main_~i~6 8))} is VALID [2019-01-07 18:47:45,891 INFO L273 TraceCheckUtils]: 11: Hoare triple {3232#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {3382#(or (< ULTIMATE.start_main_~i~6 9) (= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6) (< 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:45,891 INFO L273 TraceCheckUtils]: 10: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,891 INFO L273 TraceCheckUtils]: 9: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,892 INFO L273 TraceCheckUtils]: 4: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,892 INFO L273 TraceCheckUtils]: 3: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,892 INFO L273 TraceCheckUtils]: 2: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,893 INFO L273 TraceCheckUtils]: 1: Hoare triple {3232#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3232#true} is VALID [2019-01-07 18:47:45,893 INFO L273 TraceCheckUtils]: 0: Hoare triple {3232#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {3232#true} is VALID [2019-01-07 18:47:45,894 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-07 18:47:45,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:45,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 46 [2019-01-07 18:47:45,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:45,914 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2019-01-07 18:47:45,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:45,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2019-01-07 18:47:45,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:45,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-07 18:47:45,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-07 18:47:45,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2019-01-07 18:47:45,959 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2019-01-07 18:47:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:50,482 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-01-07 18:47:50,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-07 18:47:50,482 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2019-01-07 18:47:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-07 18:47:50,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-01-07 18:47:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-07 18:47:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-01-07 18:47:50,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 45 transitions. [2019-01-07 18:47:50,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:50,543 INFO L225 Difference]: With dead ends: 41 [2019-01-07 18:47:50,543 INFO L226 Difference]: Without dead ends: 27 [2019-01-07 18:47:50,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=553, Invalid=3107, Unknown=0, NotChecked=0, Total=3660 [2019-01-07 18:47:50,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-07 18:47:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-07 18:47:50,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:50,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2019-01-07 18:47:50,866 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2019-01-07 18:47:50,866 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2019-01-07 18:47:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:50,867 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-07 18:47:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-07 18:47:50,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:50,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:50,868 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2019-01-07 18:47:50,868 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2019-01-07 18:47:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:50,869 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-07 18:47:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-07 18:47:50,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:50,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:50,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:50,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-07 18:47:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-07 18:47:50,870 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-07 18:47:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:50,871 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-07 18:47:50,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-07 18:47:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-07 18:47:50,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-07 18:47:50,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:50,872 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-07 18:47:50,872 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:50,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:50,872 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 16 times [2019-01-07 18:47:50,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:50,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:50,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:47:50,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:50,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:51,483 INFO L273 TraceCheckUtils]: 0: Hoare triple {3633#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {3635#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:51,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {3635#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3636#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:51,485 INFO L273 TraceCheckUtils]: 2: Hoare triple {3636#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3637#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:51,486 INFO L273 TraceCheckUtils]: 3: Hoare triple {3637#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3638#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:51,487 INFO L273 TraceCheckUtils]: 4: Hoare triple {3638#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3639#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:51,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {3639#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3640#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:47:51,490 INFO L273 TraceCheckUtils]: 6: Hoare triple {3640#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3641#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:51,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {3641#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3642#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:47:51,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {3642#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3643#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:51,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {3643#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3644#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:51,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {3644#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3645#(or (and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6)) (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))))} is VALID [2019-01-07 18:47:51,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {3645#(or (and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6)) (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3646#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 11 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:51,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {3646#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 11 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {3647#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:51,498 INFO L273 TraceCheckUtils]: 13: Hoare triple {3647#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3648#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:51,499 INFO L273 TraceCheckUtils]: 14: Hoare triple {3648#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3649#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:51,500 INFO L273 TraceCheckUtils]: 15: Hoare triple {3649#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3650#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:51,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {3650#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3651#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:51,502 INFO L273 TraceCheckUtils]: 17: Hoare triple {3651#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3652#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:51,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {3652#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3653#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:51,504 INFO L273 TraceCheckUtils]: 19: Hoare triple {3653#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3654#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:51,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {3654#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3655#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:51,507 INFO L273 TraceCheckUtils]: 21: Hoare triple {3655#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3656#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:51,508 INFO L273 TraceCheckUtils]: 22: Hoare triple {3656#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3657#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:51,509 INFO L273 TraceCheckUtils]: 23: Hoare triple {3657#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3658#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:51,510 INFO L273 TraceCheckUtils]: 24: Hoare triple {3658#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {3634#false} is VALID [2019-01-07 18:47:51,510 INFO L273 TraceCheckUtils]: 25: Hoare triple {3634#false} assume !false; {3634#false} is VALID [2019-01-07 18:47:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:51,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:51,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:51,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:51,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:51,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:51,513 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:47:51,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:47:51,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:47:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:51,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:52,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:47:52,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:52,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:52,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-07 18:47:52,211 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:52,211 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_97]. (and (= (store v_ULTIMATE.start_main_~str2~6_97 10 (select ULTIMATE.start_main_~str1~6 0)) ULTIMATE.start_main_~str2~6) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:47:52,212 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select ULTIMATE.start_main_~str2~6 10) (select ULTIMATE.start_main_~str1~6 0)) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:47:52,266 INFO L273 TraceCheckUtils]: 0: Hoare triple {3633#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {3635#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,267 INFO L273 TraceCheckUtils]: 1: Hoare triple {3635#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3636#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,268 INFO L273 TraceCheckUtils]: 2: Hoare triple {3636#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3637#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,270 INFO L273 TraceCheckUtils]: 3: Hoare triple {3637#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3638#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:52,271 INFO L273 TraceCheckUtils]: 4: Hoare triple {3638#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3639#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {3639#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3640#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:47:52,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {3640#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3641#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {3641#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3642#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:47:52,275 INFO L273 TraceCheckUtils]: 8: Hoare triple {3642#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3643#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {3643#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3644#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {3644#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3692#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {3692#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3696#(and (<= ULTIMATE.start_main_~i~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:52,279 INFO L273 TraceCheckUtils]: 12: Hoare triple {3696#(and (<= ULTIMATE.start_main_~i~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {3700#(and (= ULTIMATE.start_main_~j~6 0) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:52,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {3700#(and (= ULTIMATE.start_main_~j~6 0) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3704#(and (= ULTIMATE.start_main_~j~6 1) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:52,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {3704#(and (= ULTIMATE.start_main_~j~6 1) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3708#(and (<= ULTIMATE.start_main_~MAX~6 11) (= ULTIMATE.start_main_~j~6 2) (<= 11 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:52,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {3708#(and (<= ULTIMATE.start_main_~MAX~6 11) (= ULTIMATE.start_main_~j~6 2) (<= 11 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3712#(and (= ULTIMATE.start_main_~j~6 3) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:52,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {3712#(and (= ULTIMATE.start_main_~j~6 3) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3716#(and (= ULTIMATE.start_main_~j~6 4) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:52,284 INFO L273 TraceCheckUtils]: 17: Hoare triple {3716#(and (= ULTIMATE.start_main_~j~6 4) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3720#(and (= ULTIMATE.start_main_~j~6 5) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:52,285 INFO L273 TraceCheckUtils]: 18: Hoare triple {3720#(and (= ULTIMATE.start_main_~j~6 5) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3724#(and (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 6))} is VALID [2019-01-07 18:47:52,286 INFO L273 TraceCheckUtils]: 19: Hoare triple {3724#(and (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3728#(and (= ULTIMATE.start_main_~j~6 7) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:52,287 INFO L273 TraceCheckUtils]: 20: Hoare triple {3728#(and (= ULTIMATE.start_main_~j~6 7) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3732#(and (= ULTIMATE.start_main_~j~6 8) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:52,288 INFO L273 TraceCheckUtils]: 21: Hoare triple {3732#(and (= ULTIMATE.start_main_~j~6 8) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3736#(and (= ULTIMATE.start_main_~j~6 9) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:52,288 INFO L273 TraceCheckUtils]: 22: Hoare triple {3736#(and (= ULTIMATE.start_main_~j~6 9) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3740#(and (= ULTIMATE.start_main_~j~6 10) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:52,290 INFO L273 TraceCheckUtils]: 23: Hoare triple {3740#(and (= ULTIMATE.start_main_~j~6 10) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3744#(and (= (select ULTIMATE.start_main_~str2~6 10) (select ULTIMATE.start_main_~str1~6 0)) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:52,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {3744#(and (= (select ULTIMATE.start_main_~str2~6 10) (select ULTIMATE.start_main_~str1~6 0)) (<= ULTIMATE.start_main_~MAX~6 11) (<= 11 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {3634#false} is VALID [2019-01-07 18:47:52,291 INFO L273 TraceCheckUtils]: 25: Hoare triple {3634#false} assume !false; {3634#false} is VALID [2019-01-07 18:47:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:52,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:47:52,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:47:52,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:47:52,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:47:52,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-07 18:47:52,342 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:47:52,342 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) [2019-01-07 18:47:52,342 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6) [2019-01-07 18:47:52,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {3634#false} assume !false; {3634#false} is VALID [2019-01-07 18:47:52,527 INFO L273 TraceCheckUtils]: 24: Hoare triple {3658#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {3634#false} is VALID [2019-01-07 18:47:52,529 INFO L273 TraceCheckUtils]: 23: Hoare triple {3657#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3658#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:47:52,530 INFO L273 TraceCheckUtils]: 22: Hoare triple {3656#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3657#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:52,531 INFO L273 TraceCheckUtils]: 21: Hoare triple {3655#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3656#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:52,532 INFO L273 TraceCheckUtils]: 20: Hoare triple {3654#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3655#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:52,533 INFO L273 TraceCheckUtils]: 19: Hoare triple {3653#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3654#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:52,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {3652#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3653#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:52,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {3651#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3652#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:52,536 INFO L273 TraceCheckUtils]: 16: Hoare triple {3650#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3651#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:52,537 INFO L273 TraceCheckUtils]: 15: Hoare triple {3649#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3650#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:52,538 INFO L273 TraceCheckUtils]: 14: Hoare triple {3648#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3649#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:52,539 INFO L273 TraceCheckUtils]: 13: Hoare triple {3647#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {3648#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:52,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {3646#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 11 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {3647#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:52,542 INFO L273 TraceCheckUtils]: 11: Hoare triple {3692#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3646#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 11 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:47:52,543 INFO L273 TraceCheckUtils]: 10: Hoare triple {3644#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3692#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,544 INFO L273 TraceCheckUtils]: 9: Hoare triple {3643#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3644#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {3642#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3643#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,546 INFO L273 TraceCheckUtils]: 7: Hoare triple {3641#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3642#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:47:52,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {3640#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3641#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,548 INFO L273 TraceCheckUtils]: 5: Hoare triple {3639#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3640#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:47:52,549 INFO L273 TraceCheckUtils]: 4: Hoare triple {3638#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3639#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,551 INFO L273 TraceCheckUtils]: 3: Hoare triple {3637#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3638#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:47:52,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {3636#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3637#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {3635#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {3636#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,554 INFO L273 TraceCheckUtils]: 0: Hoare triple {3633#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {3635#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:47:52,555 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:52,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:47:52,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2019-01-07 18:47:52,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:47:52,578 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2019-01-07 18:47:52,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:47:52,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2019-01-07 18:47:52,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:52,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-07 18:47:52,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-07 18:47:52,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2019-01-07 18:47:52,624 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 40 states. [2019-01-07 18:47:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:56,156 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-07 18:47:56,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-07 18:47:56,156 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2019-01-07 18:47:56,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:47:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-07 18:47:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-01-07 18:47:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-07 18:47:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-01-07 18:47:56,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 34 transitions. [2019-01-07 18:47:56,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:47:56,200 INFO L225 Difference]: With dead ends: 42 [2019-01-07 18:47:56,200 INFO L226 Difference]: Without dead ends: 28 [2019-01-07 18:47:56,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=244, Invalid=2618, Unknown=0, NotChecked=0, Total=2862 [2019-01-07 18:47:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-07 18:47:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-07 18:47:56,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:47:56,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2019-01-07 18:47:56,515 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2019-01-07 18:47:56,515 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2019-01-07 18:47:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:56,516 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-01-07 18:47:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-01-07 18:47:56,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:56,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:56,517 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2019-01-07 18:47:56,517 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2019-01-07 18:47:56,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:47:56,517 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-01-07 18:47:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-01-07 18:47:56,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:47:56,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:47:56,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:47:56,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:47:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-07 18:47:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-01-07 18:47:56,518 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-01-07 18:47:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:47:56,519 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-01-07 18:47:56,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-07 18:47:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-01-07 18:47:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-07 18:47:56,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:47:56,519 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2019-01-07 18:47:56,520 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:47:56,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:47:56,520 INFO L82 PathProgramCache]: Analyzing trace with hash -568862196, now seen corresponding path program 17 times [2019-01-07 18:47:56,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:47:56,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:56,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:47:56,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:47:56,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:47:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:56,977 INFO L273 TraceCheckUtils]: 0: Hoare triple {4044#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {4046#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:56,979 INFO L273 TraceCheckUtils]: 1: Hoare triple {4046#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4047#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:56,980 INFO L273 TraceCheckUtils]: 2: Hoare triple {4047#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4048#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:56,981 INFO L273 TraceCheckUtils]: 3: Hoare triple {4048#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4049#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:56,982 INFO L273 TraceCheckUtils]: 4: Hoare triple {4049#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4050#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:56,982 INFO L273 TraceCheckUtils]: 5: Hoare triple {4050#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4051#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:56,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {4051#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4052#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:56,985 INFO L273 TraceCheckUtils]: 7: Hoare triple {4052#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4053#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:56,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {4053#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4054#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:56,987 INFO L273 TraceCheckUtils]: 9: Hoare triple {4054#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4055#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:56,988 INFO L273 TraceCheckUtils]: 10: Hoare triple {4055#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4056#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:56,989 INFO L273 TraceCheckUtils]: 11: Hoare triple {4056#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4057#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:56,990 INFO L273 TraceCheckUtils]: 12: Hoare triple {4057#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4058#(<= 12 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:56,991 INFO L273 TraceCheckUtils]: 13: Hoare triple {4058#(<= 12 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {4057#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:56,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {4057#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4056#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:56,992 INFO L273 TraceCheckUtils]: 15: Hoare triple {4056#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4055#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:57,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {4055#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4054#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:57,028 INFO L273 TraceCheckUtils]: 17: Hoare triple {4054#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4053#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:57,046 INFO L273 TraceCheckUtils]: 18: Hoare triple {4053#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4052#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:57,061 INFO L273 TraceCheckUtils]: 19: Hoare triple {4052#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4051#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:57,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {4051#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4050#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:57,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {4050#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4049#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:57,070 INFO L273 TraceCheckUtils]: 22: Hoare triple {4049#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4048#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:57,070 INFO L273 TraceCheckUtils]: 23: Hoare triple {4048#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4047#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:57,071 INFO L273 TraceCheckUtils]: 24: Hoare triple {4047#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4046#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:57,071 INFO L273 TraceCheckUtils]: 25: Hoare triple {4046#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {4045#false} is VALID [2019-01-07 18:47:57,071 INFO L273 TraceCheckUtils]: 26: Hoare triple {4045#false} assume !false; {4045#false} is VALID [2019-01-07 18:47:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:57,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:57,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:47:57,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:47:57,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:47:57,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:47:57,073 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:47:57,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 18:47:57,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 18:47:57,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-07 18:47:57,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:47:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:47:57,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:47:58,828 INFO L273 TraceCheckUtils]: 0: Hoare triple {4044#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {4046#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:58,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {4046#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4047#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:58,850 INFO L273 TraceCheckUtils]: 2: Hoare triple {4047#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4048#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:58,862 INFO L273 TraceCheckUtils]: 3: Hoare triple {4048#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4049#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:58,875 INFO L273 TraceCheckUtils]: 4: Hoare triple {4049#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4050#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:58,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {4050#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4051#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:58,898 INFO L273 TraceCheckUtils]: 6: Hoare triple {4051#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4052#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:58,911 INFO L273 TraceCheckUtils]: 7: Hoare triple {4052#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4053#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:58,923 INFO L273 TraceCheckUtils]: 8: Hoare triple {4053#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4054#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:58,937 INFO L273 TraceCheckUtils]: 9: Hoare triple {4054#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4055#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:58,946 INFO L273 TraceCheckUtils]: 10: Hoare triple {4055#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4056#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:58,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {4056#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4057#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:58,977 INFO L273 TraceCheckUtils]: 12: Hoare triple {4057#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4058#(<= 12 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:47:58,986 INFO L273 TraceCheckUtils]: 13: Hoare triple {4058#(<= 12 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {4057#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:58,999 INFO L273 TraceCheckUtils]: 14: Hoare triple {4057#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4056#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:59,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {4056#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4055#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:59,026 INFO L273 TraceCheckUtils]: 16: Hoare triple {4055#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4054#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:59,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {4054#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4053#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:59,051 INFO L273 TraceCheckUtils]: 18: Hoare triple {4053#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4052#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:59,064 INFO L273 TraceCheckUtils]: 19: Hoare triple {4052#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4051#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:59,076 INFO L273 TraceCheckUtils]: 20: Hoare triple {4051#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4050#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:59,091 INFO L273 TraceCheckUtils]: 21: Hoare triple {4050#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4049#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:59,100 INFO L273 TraceCheckUtils]: 22: Hoare triple {4049#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4048#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:59,113 INFO L273 TraceCheckUtils]: 23: Hoare triple {4048#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4047#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:59,125 INFO L273 TraceCheckUtils]: 24: Hoare triple {4047#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4046#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:47:59,141 INFO L273 TraceCheckUtils]: 25: Hoare triple {4046#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {4045#false} is VALID [2019-01-07 18:47:59,141 INFO L273 TraceCheckUtils]: 26: Hoare triple {4045#false} assume !false; {4045#false} is VALID [2019-01-07 18:47:59,142 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:47:59,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:48:00,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {4045#false} assume !false; {4045#false} is VALID [2019-01-07 18:48:00,087 INFO L273 TraceCheckUtils]: 25: Hoare triple {4046#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {4045#false} is VALID [2019-01-07 18:48:00,088 INFO L273 TraceCheckUtils]: 24: Hoare triple {4047#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4046#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,089 INFO L273 TraceCheckUtils]: 23: Hoare triple {4048#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4047#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,089 INFO L273 TraceCheckUtils]: 22: Hoare triple {4049#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4048#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,090 INFO L273 TraceCheckUtils]: 21: Hoare triple {4050#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4049#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,091 INFO L273 TraceCheckUtils]: 20: Hoare triple {4051#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4050#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,092 INFO L273 TraceCheckUtils]: 19: Hoare triple {4052#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4051#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,093 INFO L273 TraceCheckUtils]: 18: Hoare triple {4053#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4052#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {4054#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4053#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {4055#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4054#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,096 INFO L273 TraceCheckUtils]: 15: Hoare triple {4056#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4055#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,097 INFO L273 TraceCheckUtils]: 14: Hoare triple {4057#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4056#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,098 INFO L273 TraceCheckUtils]: 13: Hoare triple {4058#(<= 12 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {4057#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,099 INFO L273 TraceCheckUtils]: 12: Hoare triple {4057#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4058#(<= 12 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:00,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {4056#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4057#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,101 INFO L273 TraceCheckUtils]: 10: Hoare triple {4055#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4056#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,102 INFO L273 TraceCheckUtils]: 9: Hoare triple {4054#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4055#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,103 INFO L273 TraceCheckUtils]: 8: Hoare triple {4053#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4054#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,104 INFO L273 TraceCheckUtils]: 7: Hoare triple {4052#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4053#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,105 INFO L273 TraceCheckUtils]: 6: Hoare triple {4051#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4052#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,106 INFO L273 TraceCheckUtils]: 5: Hoare triple {4050#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4051#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,107 INFO L273 TraceCheckUtils]: 4: Hoare triple {4049#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4050#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,108 INFO L273 TraceCheckUtils]: 3: Hoare triple {4048#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4049#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,109 INFO L273 TraceCheckUtils]: 2: Hoare triple {4047#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4048#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {4046#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4047#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,111 INFO L273 TraceCheckUtils]: 0: Hoare triple {4044#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {4046#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:00,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:48:00,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2019-01-07 18:48:00,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:48:00,132 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-01-07 18:48:00,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:48:00,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2019-01-07 18:48:00,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:00,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-07 18:48:00,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-07 18:48:00,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-01-07 18:48:00,166 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 15 states. [2019-01-07 18:48:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:00,936 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-01-07 18:48:00,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-07 18:48:00,936 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-01-07 18:48:00,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:48:00,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-07 18:48:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-01-07 18:48:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-07 18:48:00,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-01-07 18:48:00,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 32 transitions. [2019-01-07 18:48:00,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:00,983 INFO L225 Difference]: With dead ends: 31 [2019-01-07 18:48:00,983 INFO L226 Difference]: Without dead ends: 29 [2019-01-07 18:48:00,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 24 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-01-07 18:48:00,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-07 18:48:01,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-07 18:48:01,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:48:01,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2019-01-07 18:48:01,311 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2019-01-07 18:48:01,311 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2019-01-07 18:48:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:01,312 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-01-07 18:48:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-07 18:48:01,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:01,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:01,313 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2019-01-07 18:48:01,313 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2019-01-07 18:48:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:01,314 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-01-07 18:48:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-07 18:48:01,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:01,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:01,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:48:01,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:48:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-07 18:48:01,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-07 18:48:01,315 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2019-01-07 18:48:01,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:48:01,316 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-07 18:48:01,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-07 18:48:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-07 18:48:01,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-07 18:48:01,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:48:01,316 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-07 18:48:01,316 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:48:01,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:48:01,317 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 18 times [2019-01-07 18:48:01,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:48:01,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:01,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:48:01,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:01,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:48:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:02,557 INFO L273 TraceCheckUtils]: 0: Hoare triple {4414#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {4416#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:02,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {4416#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4417#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:02,560 INFO L273 TraceCheckUtils]: 2: Hoare triple {4417#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4418#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:02,561 INFO L273 TraceCheckUtils]: 3: Hoare triple {4418#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4419#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:48:02,562 INFO L273 TraceCheckUtils]: 4: Hoare triple {4419#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4420#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:02,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {4420#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4421#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:48:02,564 INFO L273 TraceCheckUtils]: 6: Hoare triple {4421#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4422#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:02,565 INFO L273 TraceCheckUtils]: 7: Hoare triple {4422#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4423#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:48:02,566 INFO L273 TraceCheckUtils]: 8: Hoare triple {4423#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4424#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:02,567 INFO L273 TraceCheckUtils]: 9: Hoare triple {4424#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4425#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:02,568 INFO L273 TraceCheckUtils]: 10: Hoare triple {4425#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4426#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:02,570 INFO L273 TraceCheckUtils]: 11: Hoare triple {4426#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4427#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11)))} is VALID [2019-01-07 18:48:02,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {4427#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4428#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 12 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:02,572 INFO L273 TraceCheckUtils]: 13: Hoare triple {4428#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 12 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {4429#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:02,573 INFO L273 TraceCheckUtils]: 14: Hoare triple {4429#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4430#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:02,574 INFO L273 TraceCheckUtils]: 15: Hoare triple {4430#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4431#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:02,575 INFO L273 TraceCheckUtils]: 16: Hoare triple {4431#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4432#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:02,576 INFO L273 TraceCheckUtils]: 17: Hoare triple {4432#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4433#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:02,578 INFO L273 TraceCheckUtils]: 18: Hoare triple {4433#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4434#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:02,579 INFO L273 TraceCheckUtils]: 19: Hoare triple {4434#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4435#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:02,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {4435#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4436#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:02,581 INFO L273 TraceCheckUtils]: 21: Hoare triple {4436#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4437#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:02,582 INFO L273 TraceCheckUtils]: 22: Hoare triple {4437#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4438#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:02,583 INFO L273 TraceCheckUtils]: 23: Hoare triple {4438#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4439#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:02,584 INFO L273 TraceCheckUtils]: 24: Hoare triple {4439#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4440#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:02,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {4440#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4441#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:48:02,586 INFO L273 TraceCheckUtils]: 26: Hoare triple {4441#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {4415#false} is VALID [2019-01-07 18:48:02,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {4415#false} assume !false; {4415#false} is VALID [2019-01-07 18:48:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:02,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:02,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:48:02,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:48:02,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:48:02,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:02,590 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:48:02,599 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 18:48:02,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 18:48:02,617 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 18:48:02,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:48:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:02,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:48:03,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:48:03,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:48:03,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:48:03,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-07 18:48:03,413 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:48:03,414 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_120]. (and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 13)) (<= 12 ULTIMATE.start_main_~MAX~6) (= (store v_ULTIMATE.start_main_~str2~6_120 11 (select ULTIMATE.start_main_~str1~6 0)) ULTIMATE.start_main_~str2~6)) [2019-01-07 18:48:03,414 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 13)) (= (select ULTIMATE.start_main_~str2~6 11) (select ULTIMATE.start_main_~str1~6 0)) (<= 12 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:48:03,521 INFO L273 TraceCheckUtils]: 0: Hoare triple {4414#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {4414#true} is VALID [2019-01-07 18:48:03,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:03,522 INFO L273 TraceCheckUtils]: 2: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:03,522 INFO L273 TraceCheckUtils]: 3: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:03,522 INFO L273 TraceCheckUtils]: 4: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:03,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:03,522 INFO L273 TraceCheckUtils]: 6: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:03,523 INFO L273 TraceCheckUtils]: 7: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:03,523 INFO L273 TraceCheckUtils]: 8: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:03,523 INFO L273 TraceCheckUtils]: 9: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:03,523 INFO L273 TraceCheckUtils]: 10: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:03,523 INFO L273 TraceCheckUtils]: 11: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:03,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:03,524 INFO L273 TraceCheckUtils]: 13: Hoare triple {4414#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {4484#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:03,524 INFO L273 TraceCheckUtils]: 14: Hoare triple {4484#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4488#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} is VALID [2019-01-07 18:48:03,526 INFO L273 TraceCheckUtils]: 15: Hoare triple {4488#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4492#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:48:03,526 INFO L273 TraceCheckUtils]: 16: Hoare triple {4492#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4496#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} is VALID [2019-01-07 18:48:03,528 INFO L273 TraceCheckUtils]: 17: Hoare triple {4496#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4500#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} is VALID [2019-01-07 18:48:03,529 INFO L273 TraceCheckUtils]: 18: Hoare triple {4500#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4504#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:03,531 INFO L273 TraceCheckUtils]: 19: Hoare triple {4504#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4508#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)) (= ULTIMATE.start_main_~j~6 6))} is VALID [2019-01-07 18:48:03,533 INFO L273 TraceCheckUtils]: 20: Hoare triple {4508#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)) (= ULTIMATE.start_main_~j~6 6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4512#(and (= ULTIMATE.start_main_~j~6 7) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 8)))} is VALID [2019-01-07 18:48:03,535 INFO L273 TraceCheckUtils]: 21: Hoare triple {4512#(and (= ULTIMATE.start_main_~j~6 7) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 8)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4516#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9)) (= ULTIMATE.start_main_~j~6 8))} is VALID [2019-01-07 18:48:03,536 INFO L273 TraceCheckUtils]: 22: Hoare triple {4516#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9)) (= ULTIMATE.start_main_~j~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4520#(and (= ULTIMATE.start_main_~j~6 9) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 10)))} is VALID [2019-01-07 18:48:03,537 INFO L273 TraceCheckUtils]: 23: Hoare triple {4520#(and (= ULTIMATE.start_main_~j~6 9) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 10)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4524#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 11)) (= ULTIMATE.start_main_~j~6 10))} is VALID [2019-01-07 18:48:03,540 INFO L273 TraceCheckUtils]: 24: Hoare triple {4524#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 11)) (= ULTIMATE.start_main_~j~6 10))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4528#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 12)) (= ULTIMATE.start_main_~j~6 11))} is VALID [2019-01-07 18:48:03,541 INFO L273 TraceCheckUtils]: 25: Hoare triple {4528#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 12)) (= ULTIMATE.start_main_~j~6 11))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4532#(and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 13)) (= (select ULTIMATE.start_main_~str2~6 11) (select ULTIMATE.start_main_~str1~6 0)) (<= 12 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:03,542 INFO L273 TraceCheckUtils]: 26: Hoare triple {4532#(and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 13)) (= (select ULTIMATE.start_main_~str2~6 11) (select ULTIMATE.start_main_~str1~6 0)) (<= 12 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {4415#false} is VALID [2019-01-07 18:48:03,542 INFO L273 TraceCheckUtils]: 27: Hoare triple {4415#false} assume !false; {4415#false} is VALID [2019-01-07 18:48:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-07 18:48:03,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:48:03,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:48:03,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:48:03,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:48:03,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-07 18:48:03,815 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:48:03,816 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (or (not (<= 0 ULTIMATE.start_main_~i~6)) (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) (< 0 ULTIMATE.start_main_~i~6)) [2019-01-07 18:48:03,816 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:48:04,598 INFO L273 TraceCheckUtils]: 27: Hoare triple {4415#false} assume !false; {4415#false} is VALID [2019-01-07 18:48:04,599 INFO L273 TraceCheckUtils]: 26: Hoare triple {4542#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {4415#false} is VALID [2019-01-07 18:48:04,601 INFO L273 TraceCheckUtils]: 25: Hoare triple {4546#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4542#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:04,602 INFO L273 TraceCheckUtils]: 24: Hoare triple {4550#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4546#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:04,603 INFO L273 TraceCheckUtils]: 23: Hoare triple {4554#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4550#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} is VALID [2019-01-07 18:48:04,604 INFO L273 TraceCheckUtils]: 22: Hoare triple {4558#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4554#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:04,606 INFO L273 TraceCheckUtils]: 21: Hoare triple {4562#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4558#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:04,607 INFO L273 TraceCheckUtils]: 20: Hoare triple {4566#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4562#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} is VALID [2019-01-07 18:48:04,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {4570#(or (< ULTIMATE.start_main_~i~6 6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 7)) (< 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4566#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:04,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {4574#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 8)) (< ULTIMATE.start_main_~i~6 7) (< 7 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4570#(or (< ULTIMATE.start_main_~i~6 6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 7)) (< 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:04,615 INFO L273 TraceCheckUtils]: 17: Hoare triple {4578#(or (< 8 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 9)) (< ULTIMATE.start_main_~i~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4574#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 8)) (< ULTIMATE.start_main_~i~6 7) (< 7 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:04,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {4582#(or (< ULTIMATE.start_main_~i~6 9) (= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6) (< 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4578#(or (< 8 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 9)) (< ULTIMATE.start_main_~i~6 8))} is VALID [2019-01-07 18:48:04,617 INFO L273 TraceCheckUtils]: 15: Hoare triple {4586#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 11)) (< 10 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 10))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4582#(or (< ULTIMATE.start_main_~i~6 9) (= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6) (< 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:04,617 INFO L273 TraceCheckUtils]: 14: Hoare triple {4590#(or (< ULTIMATE.start_main_~i~6 11) (= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6) (< 11 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4586#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 11)) (< 10 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 10))} is VALID [2019-01-07 18:48:04,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {4414#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {4590#(or (< ULTIMATE.start_main_~i~6 11) (= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6) (< 11 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:04,618 INFO L273 TraceCheckUtils]: 12: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:04,618 INFO L273 TraceCheckUtils]: 11: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:04,619 INFO L273 TraceCheckUtils]: 10: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:04,619 INFO L273 TraceCheckUtils]: 9: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:04,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:04,619 INFO L273 TraceCheckUtils]: 7: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:04,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:04,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:04,620 INFO L273 TraceCheckUtils]: 4: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:04,620 INFO L273 TraceCheckUtils]: 3: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:04,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:04,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {4414#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4414#true} is VALID [2019-01-07 18:48:04,620 INFO L273 TraceCheckUtils]: 0: Hoare triple {4414#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {4414#true} is VALID [2019-01-07 18:48:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-07 18:48:04,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:48:04,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 15] total 54 [2019-01-07 18:48:04,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:48:04,642 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 28 [2019-01-07 18:48:04,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:48:04,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2019-01-07 18:48:04,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:04,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-07 18:48:04,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-07 18:48:04,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2444, Unknown=0, NotChecked=0, Total=2862 [2019-01-07 18:48:04,711 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2019-01-07 18:48:07,286 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-07 18:48:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:10,274 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-01-07 18:48:10,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-07 18:48:10,274 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 28 [2019-01-07 18:48:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:48:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-07 18:48:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-01-07 18:48:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-07 18:48:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2019-01-07 18:48:10,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 51 transitions. [2019-01-07 18:48:10,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:10,345 INFO L225 Difference]: With dead ends: 47 [2019-01-07 18:48:10,345 INFO L226 Difference]: Without dead ends: 31 [2019-01-07 18:48:10,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=727, Invalid=4243, Unknown=0, NotChecked=0, Total=4970 [2019-01-07 18:48:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-07 18:48:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-07 18:48:10,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:48:10,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2019-01-07 18:48:10,740 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2019-01-07 18:48:10,740 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2019-01-07 18:48:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:10,741 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-01-07 18:48:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-07 18:48:10,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:10,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:10,742 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2019-01-07 18:48:10,742 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2019-01-07 18:48:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:10,743 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-01-07 18:48:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-07 18:48:10,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:10,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:10,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:48:10,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:48:10,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-07 18:48:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-07 18:48:10,745 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-07 18:48:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:48:10,746 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-07 18:48:10,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-07 18:48:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-07 18:48:10,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-07 18:48:10,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:48:10,747 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-07 18:48:10,747 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:48:10,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:48:10,747 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 19 times [2019-01-07 18:48:10,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:48:10,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:10,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:48:10,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:10,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:48:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:12,054 INFO L273 TraceCheckUtils]: 0: Hoare triple {4879#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {4881#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:12,055 INFO L273 TraceCheckUtils]: 1: Hoare triple {4881#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4882#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:12,056 INFO L273 TraceCheckUtils]: 2: Hoare triple {4882#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4883#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:12,058 INFO L273 TraceCheckUtils]: 3: Hoare triple {4883#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4884#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:48:12,059 INFO L273 TraceCheckUtils]: 4: Hoare triple {4884#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4885#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:12,060 INFO L273 TraceCheckUtils]: 5: Hoare triple {4885#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4886#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:48:12,061 INFO L273 TraceCheckUtils]: 6: Hoare triple {4886#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4887#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:12,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {4887#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4888#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:48:12,063 INFO L273 TraceCheckUtils]: 8: Hoare triple {4888#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4889#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:12,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {4889#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4890#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:12,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {4890#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4891#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:12,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {4891#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4892#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:48:12,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {4892#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4893#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6)))} is VALID [2019-01-07 18:48:12,069 INFO L273 TraceCheckUtils]: 13: Hoare triple {4893#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4894#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 13 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:12,070 INFO L273 TraceCheckUtils]: 14: Hoare triple {4894#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 13 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {4895#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:12,071 INFO L273 TraceCheckUtils]: 15: Hoare triple {4895#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4896#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:12,088 INFO L273 TraceCheckUtils]: 16: Hoare triple {4896#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4897#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:12,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {4897#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4898#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:12,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {4898#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4899#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:12,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {4899#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4900#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:12,091 INFO L273 TraceCheckUtils]: 20: Hoare triple {4900#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4901#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:12,092 INFO L273 TraceCheckUtils]: 21: Hoare triple {4901#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4902#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:12,093 INFO L273 TraceCheckUtils]: 22: Hoare triple {4902#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4903#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:12,094 INFO L273 TraceCheckUtils]: 23: Hoare triple {4903#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4904#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:12,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {4904#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4905#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:12,096 INFO L273 TraceCheckUtils]: 25: Hoare triple {4905#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4906#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:12,097 INFO L273 TraceCheckUtils]: 26: Hoare triple {4906#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4907#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:12,099 INFO L273 TraceCheckUtils]: 27: Hoare triple {4907#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4908#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:48:12,100 INFO L273 TraceCheckUtils]: 28: Hoare triple {4908#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {4880#false} is VALID [2019-01-07 18:48:12,100 INFO L273 TraceCheckUtils]: 29: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2019-01-07 18:48:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:12,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:12,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:48:12,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:48:12,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:48:12,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:12,104 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:48:12,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:48:12,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:48:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:12,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:48:12,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:48:12,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:48:12,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:48:12,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-07 18:48:12,995 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:48:12,995 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_133]. (and (<= 13 ULTIMATE.start_main_~MAX~6) (= (store v_ULTIMATE.start_main_~str2~6_133 12 (select ULTIMATE.start_main_~str1~6 0)) ULTIMATE.start_main_~str2~6) (<= ULTIMATE.start_main_~MAX~6 13)) [2019-01-07 18:48:12,995 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 12))) [2019-01-07 18:48:13,056 INFO L273 TraceCheckUtils]: 0: Hoare triple {4879#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {4881#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {4881#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4882#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,058 INFO L273 TraceCheckUtils]: 2: Hoare triple {4882#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4883#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,059 INFO L273 TraceCheckUtils]: 3: Hoare triple {4883#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4884#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:48:13,060 INFO L273 TraceCheckUtils]: 4: Hoare triple {4884#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4885#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {4885#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4886#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:48:13,062 INFO L273 TraceCheckUtils]: 6: Hoare triple {4886#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4887#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {4887#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4888#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:48:13,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {4888#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4889#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,065 INFO L273 TraceCheckUtils]: 9: Hoare triple {4889#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4890#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,066 INFO L273 TraceCheckUtils]: 10: Hoare triple {4890#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4891#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {4891#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4892#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:48:13,068 INFO L273 TraceCheckUtils]: 12: Hoare triple {4892#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4948#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,069 INFO L273 TraceCheckUtils]: 13: Hoare triple {4948#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4952#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~i~6 13))} is VALID [2019-01-07 18:48:13,071 INFO L273 TraceCheckUtils]: 14: Hoare triple {4952#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~i~6 13))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {4956#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 0))} is VALID [2019-01-07 18:48:13,071 INFO L273 TraceCheckUtils]: 15: Hoare triple {4956#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 0))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4960#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 1))} is VALID [2019-01-07 18:48:13,072 INFO L273 TraceCheckUtils]: 16: Hoare triple {4960#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 1))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4964#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:48:13,073 INFO L273 TraceCheckUtils]: 17: Hoare triple {4964#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4968#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 3))} is VALID [2019-01-07 18:48:13,074 INFO L273 TraceCheckUtils]: 18: Hoare triple {4968#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 3))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4972#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 4))} is VALID [2019-01-07 18:48:13,075 INFO L273 TraceCheckUtils]: 19: Hoare triple {4972#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 4))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4976#(and (<= 13 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 5) (<= ULTIMATE.start_main_~MAX~6 13))} is VALID [2019-01-07 18:48:13,076 INFO L273 TraceCheckUtils]: 20: Hoare triple {4976#(and (<= 13 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 5) (<= ULTIMATE.start_main_~MAX~6 13))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4980#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 6))} is VALID [2019-01-07 18:48:13,076 INFO L273 TraceCheckUtils]: 21: Hoare triple {4980#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4984#(and (= ULTIMATE.start_main_~j~6 7) (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13))} is VALID [2019-01-07 18:48:13,077 INFO L273 TraceCheckUtils]: 22: Hoare triple {4984#(and (= ULTIMATE.start_main_~j~6 7) (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4988#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 8))} is VALID [2019-01-07 18:48:13,078 INFO L273 TraceCheckUtils]: 23: Hoare triple {4988#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4992#(and (<= 13 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 9) (<= ULTIMATE.start_main_~MAX~6 13))} is VALID [2019-01-07 18:48:13,079 INFO L273 TraceCheckUtils]: 24: Hoare triple {4992#(and (<= 13 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 9) (<= ULTIMATE.start_main_~MAX~6 13))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4996#(and (= ULTIMATE.start_main_~j~6 10) (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13))} is VALID [2019-01-07 18:48:13,080 INFO L273 TraceCheckUtils]: 25: Hoare triple {4996#(and (= ULTIMATE.start_main_~j~6 10) (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5000#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 11))} is VALID [2019-01-07 18:48:13,081 INFO L273 TraceCheckUtils]: 26: Hoare triple {5000#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= ULTIMATE.start_main_~j~6 11))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5004#(and (<= 13 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 12) (<= ULTIMATE.start_main_~MAX~6 13))} is VALID [2019-01-07 18:48:13,082 INFO L273 TraceCheckUtils]: 27: Hoare triple {5004#(and (<= 13 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 12) (<= ULTIMATE.start_main_~MAX~6 13))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5008#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 12)))} is VALID [2019-01-07 18:48:13,083 INFO L273 TraceCheckUtils]: 28: Hoare triple {5008#(and (<= 13 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 13) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 12)))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {4880#false} is VALID [2019-01-07 18:48:13,083 INFO L273 TraceCheckUtils]: 29: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2019-01-07 18:48:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:13,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:48:13,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:48:13,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:48:13,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:48:13,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-07 18:48:13,145 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:48:13,145 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) [2019-01-07 18:48:13,145 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6) [2019-01-07 18:48:13,374 INFO L273 TraceCheckUtils]: 29: Hoare triple {4880#false} assume !false; {4880#false} is VALID [2019-01-07 18:48:13,376 INFO L273 TraceCheckUtils]: 28: Hoare triple {4908#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {4880#false} is VALID [2019-01-07 18:48:13,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {4907#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4908#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:48:13,378 INFO L273 TraceCheckUtils]: 26: Hoare triple {4906#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4907#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:13,380 INFO L273 TraceCheckUtils]: 25: Hoare triple {4905#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4906#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:13,381 INFO L273 TraceCheckUtils]: 24: Hoare triple {4904#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4905#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:13,382 INFO L273 TraceCheckUtils]: 23: Hoare triple {4903#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4904#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:13,383 INFO L273 TraceCheckUtils]: 22: Hoare triple {4902#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4903#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:13,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {4901#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4902#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:13,385 INFO L273 TraceCheckUtils]: 20: Hoare triple {4900#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4901#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:13,386 INFO L273 TraceCheckUtils]: 19: Hoare triple {4899#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4900#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:13,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {4898#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4899#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:13,388 INFO L273 TraceCheckUtils]: 17: Hoare triple {4897#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4898#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:13,389 INFO L273 TraceCheckUtils]: 16: Hoare triple {4896#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4897#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:13,390 INFO L273 TraceCheckUtils]: 15: Hoare triple {4895#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {4896#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:13,391 INFO L273 TraceCheckUtils]: 14: Hoare triple {4894#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 13 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {4895#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:13,393 INFO L273 TraceCheckUtils]: 13: Hoare triple {4948#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4894#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 13 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:13,394 INFO L273 TraceCheckUtils]: 12: Hoare triple {4892#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4948#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {4891#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4892#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:48:13,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {4890#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4891#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {4889#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4890#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,398 INFO L273 TraceCheckUtils]: 8: Hoare triple {4888#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4889#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,399 INFO L273 TraceCheckUtils]: 7: Hoare triple {4887#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4888#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:48:13,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {4886#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4887#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {4885#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4886#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:48:13,402 INFO L273 TraceCheckUtils]: 4: Hoare triple {4884#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4885#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,403 INFO L273 TraceCheckUtils]: 3: Hoare triple {4883#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4884#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:48:13,405 INFO L273 TraceCheckUtils]: 2: Hoare triple {4882#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4883#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {4881#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {4882#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,406 INFO L273 TraceCheckUtils]: 0: Hoare triple {4879#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {4881#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:13,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:48:13,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2019-01-07 18:48:13,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:48:13,430 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2019-01-07 18:48:13,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:48:13,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2019-01-07 18:48:13,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:13,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-07 18:48:13,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-07 18:48:13,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2019-01-07 18:48:13,482 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 46 states. [2019-01-07 18:48:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:17,927 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-01-07 18:48:17,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-07 18:48:17,927 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2019-01-07 18:48:17,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:48:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-07 18:48:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-01-07 18:48:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-07 18:48:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-01-07 18:48:17,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 38 transitions. [2019-01-07 18:48:18,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:18,016 INFO L225 Difference]: With dead ends: 48 [2019-01-07 18:48:18,016 INFO L226 Difference]: Without dead ends: 32 [2019-01-07 18:48:18,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2019-01-07 18:48:18,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-07 18:48:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-07 18:48:18,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:48:18,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2019-01-07 18:48:18,445 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2019-01-07 18:48:18,446 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2019-01-07 18:48:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:18,447 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-01-07 18:48:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-07 18:48:18,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:18,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:18,448 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2019-01-07 18:48:18,448 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2019-01-07 18:48:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:18,449 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-01-07 18:48:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-07 18:48:18,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:18,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:18,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:48:18,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:48:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-07 18:48:18,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-07 18:48:18,451 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2019-01-07 18:48:18,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:48:18,451 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-07 18:48:18,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-07 18:48:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-07 18:48:18,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-07 18:48:18,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:48:18,452 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1] [2019-01-07 18:48:18,452 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:48:18,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:48:18,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1693839084, now seen corresponding path program 20 times [2019-01-07 18:48:18,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:48:18,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:18,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:48:18,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:18,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:48:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:19,563 INFO L273 TraceCheckUtils]: 0: Hoare triple {5352#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {5354#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,565 INFO L273 TraceCheckUtils]: 1: Hoare triple {5354#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5355#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,566 INFO L273 TraceCheckUtils]: 2: Hoare triple {5355#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5356#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,567 INFO L273 TraceCheckUtils]: 3: Hoare triple {5356#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5357#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,568 INFO L273 TraceCheckUtils]: 4: Hoare triple {5357#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5358#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,569 INFO L273 TraceCheckUtils]: 5: Hoare triple {5358#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5359#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {5359#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5360#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {5360#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5361#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,572 INFO L273 TraceCheckUtils]: 8: Hoare triple {5361#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5362#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {5362#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5363#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {5363#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5364#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {5364#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5365#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,576 INFO L273 TraceCheckUtils]: 12: Hoare triple {5365#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5366#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,577 INFO L273 TraceCheckUtils]: 13: Hoare triple {5366#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5367#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,578 INFO L273 TraceCheckUtils]: 14: Hoare triple {5367#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5368#(<= 14 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:19,579 INFO L273 TraceCheckUtils]: 15: Hoare triple {5368#(<= 14 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {5367#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,580 INFO L273 TraceCheckUtils]: 16: Hoare triple {5367#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5366#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {5366#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5365#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {5365#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5364#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,583 INFO L273 TraceCheckUtils]: 19: Hoare triple {5364#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5363#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {5363#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5362#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,585 INFO L273 TraceCheckUtils]: 21: Hoare triple {5362#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5361#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {5361#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5360#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {5360#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5359#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,588 INFO L273 TraceCheckUtils]: 24: Hoare triple {5359#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5358#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,589 INFO L273 TraceCheckUtils]: 25: Hoare triple {5358#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5357#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,590 INFO L273 TraceCheckUtils]: 26: Hoare triple {5357#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5356#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,591 INFO L273 TraceCheckUtils]: 27: Hoare triple {5356#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5355#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,592 INFO L273 TraceCheckUtils]: 28: Hoare triple {5355#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5354#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,592 INFO L273 TraceCheckUtils]: 29: Hoare triple {5354#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {5353#false} is VALID [2019-01-07 18:48:19,593 INFO L273 TraceCheckUtils]: 30: Hoare triple {5353#false} assume !false; {5353#false} is VALID [2019-01-07 18:48:19,594 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:19,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:19,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:48:19,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:48:19,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:48:19,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:19,595 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:48:19,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 18:48:19,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 18:48:19,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-07 18:48:19,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:48:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:19,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:48:19,824 INFO L273 TraceCheckUtils]: 0: Hoare triple {5352#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {5354#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {5354#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5355#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,826 INFO L273 TraceCheckUtils]: 2: Hoare triple {5355#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5356#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,828 INFO L273 TraceCheckUtils]: 3: Hoare triple {5356#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5357#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,828 INFO L273 TraceCheckUtils]: 4: Hoare triple {5357#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5358#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {5358#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5359#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,830 INFO L273 TraceCheckUtils]: 6: Hoare triple {5359#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5360#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,831 INFO L273 TraceCheckUtils]: 7: Hoare triple {5360#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5361#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,832 INFO L273 TraceCheckUtils]: 8: Hoare triple {5361#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5362#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,833 INFO L273 TraceCheckUtils]: 9: Hoare triple {5362#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5363#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,834 INFO L273 TraceCheckUtils]: 10: Hoare triple {5363#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5364#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {5364#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5365#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {5365#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5366#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {5366#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5367#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {5367#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5368#(<= 14 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:19,840 INFO L273 TraceCheckUtils]: 15: Hoare triple {5368#(<= 14 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {5367#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,840 INFO L273 TraceCheckUtils]: 16: Hoare triple {5367#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5366#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {5366#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5365#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {5365#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5364#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,843 INFO L273 TraceCheckUtils]: 19: Hoare triple {5364#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5363#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,844 INFO L273 TraceCheckUtils]: 20: Hoare triple {5363#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5362#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,845 INFO L273 TraceCheckUtils]: 21: Hoare triple {5362#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5361#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,846 INFO L273 TraceCheckUtils]: 22: Hoare triple {5361#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5360#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,847 INFO L273 TraceCheckUtils]: 23: Hoare triple {5360#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5359#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,848 INFO L273 TraceCheckUtils]: 24: Hoare triple {5359#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5358#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,849 INFO L273 TraceCheckUtils]: 25: Hoare triple {5358#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5357#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,850 INFO L273 TraceCheckUtils]: 26: Hoare triple {5357#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5356#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,851 INFO L273 TraceCheckUtils]: 27: Hoare triple {5356#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5355#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,852 INFO L273 TraceCheckUtils]: 28: Hoare triple {5355#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5354#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:19,853 INFO L273 TraceCheckUtils]: 29: Hoare triple {5354#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {5353#false} is VALID [2019-01-07 18:48:19,853 INFO L273 TraceCheckUtils]: 30: Hoare triple {5353#false} assume !false; {5353#false} is VALID [2019-01-07 18:48:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:19,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:48:20,219 INFO L273 TraceCheckUtils]: 30: Hoare triple {5353#false} assume !false; {5353#false} is VALID [2019-01-07 18:48:20,220 INFO L273 TraceCheckUtils]: 29: Hoare triple {5354#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {5353#false} is VALID [2019-01-07 18:48:20,220 INFO L273 TraceCheckUtils]: 28: Hoare triple {5355#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5354#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,221 INFO L273 TraceCheckUtils]: 27: Hoare triple {5356#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5355#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,221 INFO L273 TraceCheckUtils]: 26: Hoare triple {5357#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5356#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,222 INFO L273 TraceCheckUtils]: 25: Hoare triple {5358#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5357#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,223 INFO L273 TraceCheckUtils]: 24: Hoare triple {5359#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5358#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,224 INFO L273 TraceCheckUtils]: 23: Hoare triple {5360#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5359#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {5361#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5360#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,226 INFO L273 TraceCheckUtils]: 21: Hoare triple {5362#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5361#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,226 INFO L273 TraceCheckUtils]: 20: Hoare triple {5363#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5362#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,227 INFO L273 TraceCheckUtils]: 19: Hoare triple {5364#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5363#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {5365#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5364#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {5366#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5365#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,230 INFO L273 TraceCheckUtils]: 16: Hoare triple {5367#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5366#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,231 INFO L273 TraceCheckUtils]: 15: Hoare triple {5368#(<= 14 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {5367#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,232 INFO L273 TraceCheckUtils]: 14: Hoare triple {5367#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5368#(<= 14 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:20,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {5366#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5367#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {5365#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5366#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,235 INFO L273 TraceCheckUtils]: 11: Hoare triple {5364#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5365#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,236 INFO L273 TraceCheckUtils]: 10: Hoare triple {5363#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5364#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {5362#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5363#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,238 INFO L273 TraceCheckUtils]: 8: Hoare triple {5361#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5362#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,239 INFO L273 TraceCheckUtils]: 7: Hoare triple {5360#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5361#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,240 INFO L273 TraceCheckUtils]: 6: Hoare triple {5359#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5360#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {5358#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5359#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,242 INFO L273 TraceCheckUtils]: 4: Hoare triple {5357#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5358#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,243 INFO L273 TraceCheckUtils]: 3: Hoare triple {5356#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5357#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,244 INFO L273 TraceCheckUtils]: 2: Hoare triple {5355#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5356#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {5354#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5355#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,246 INFO L273 TraceCheckUtils]: 0: Hoare triple {5352#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {5354#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:20,247 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:20,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:48:20,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2019-01-07 18:48:20,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:48:20,269 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-01-07 18:48:20,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:48:20,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2019-01-07 18:48:20,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:20,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-07 18:48:20,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-07 18:48:20,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-01-07 18:48:20,326 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2019-01-07 18:48:21,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:21,282 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-01-07 18:48:21,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-07 18:48:21,283 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-01-07 18:48:21,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:48:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-07 18:48:21,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-01-07 18:48:21,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-07 18:48:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-01-07 18:48:21,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 36 transitions. [2019-01-07 18:48:21,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:21,320 INFO L225 Difference]: With dead ends: 35 [2019-01-07 18:48:21,320 INFO L226 Difference]: Without dead ends: 33 [2019-01-07 18:48:21,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-01-07 18:48:21,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-07 18:48:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-07 18:48:21,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:48:21,808 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2019-01-07 18:48:21,808 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2019-01-07 18:48:21,808 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2019-01-07 18:48:21,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:21,809 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-07 18:48:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-07 18:48:21,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:21,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:21,810 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2019-01-07 18:48:21,810 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2019-01-07 18:48:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:21,811 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-07 18:48:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-07 18:48:21,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:21,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:21,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:48:21,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:48:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-07 18:48:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-07 18:48:21,812 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2019-01-07 18:48:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:48:21,812 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-07 18:48:21,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-07 18:48:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-07 18:48:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-07 18:48:21,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:48:21,813 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-07 18:48:21,813 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:48:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:48:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 21 times [2019-01-07 18:48:21,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:48:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:21,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:48:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:21,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:48:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:22,790 INFO L273 TraceCheckUtils]: 0: Hoare triple {5776#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {5778#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:22,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {5778#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5779#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:22,793 INFO L273 TraceCheckUtils]: 2: Hoare triple {5779#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5780#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:22,794 INFO L273 TraceCheckUtils]: 3: Hoare triple {5780#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5781#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:48:22,795 INFO L273 TraceCheckUtils]: 4: Hoare triple {5781#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5782#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:22,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {5782#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5783#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:48:22,797 INFO L273 TraceCheckUtils]: 6: Hoare triple {5783#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5784#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:22,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {5784#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5785#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:48:22,799 INFO L273 TraceCheckUtils]: 8: Hoare triple {5785#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5786#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:22,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {5786#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5787#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:22,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {5787#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5788#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:22,802 INFO L273 TraceCheckUtils]: 11: Hoare triple {5788#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5789#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:48:22,803 INFO L273 TraceCheckUtils]: 12: Hoare triple {5789#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5790#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:22,804 INFO L273 TraceCheckUtils]: 13: Hoare triple {5790#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5791#(or (and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6)) (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))))} is VALID [2019-01-07 18:48:22,806 INFO L273 TraceCheckUtils]: 14: Hoare triple {5791#(or (and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6)) (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5792#(or (= 14 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:22,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {5792#(or (= 14 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {5793#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:22,808 INFO L273 TraceCheckUtils]: 16: Hoare triple {5793#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5794#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:22,809 INFO L273 TraceCheckUtils]: 17: Hoare triple {5794#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5795#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:22,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {5795#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5796#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:22,811 INFO L273 TraceCheckUtils]: 19: Hoare triple {5796#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5797#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:22,812 INFO L273 TraceCheckUtils]: 20: Hoare triple {5797#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5798#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:22,813 INFO L273 TraceCheckUtils]: 21: Hoare triple {5798#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5799#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:22,814 INFO L273 TraceCheckUtils]: 22: Hoare triple {5799#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5800#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:22,816 INFO L273 TraceCheckUtils]: 23: Hoare triple {5800#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5801#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:22,817 INFO L273 TraceCheckUtils]: 24: Hoare triple {5801#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5802#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:22,818 INFO L273 TraceCheckUtils]: 25: Hoare triple {5802#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5803#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:22,819 INFO L273 TraceCheckUtils]: 26: Hoare triple {5803#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5804#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:22,820 INFO L273 TraceCheckUtils]: 27: Hoare triple {5804#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5805#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:22,821 INFO L273 TraceCheckUtils]: 28: Hoare triple {5805#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5806#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:22,822 INFO L273 TraceCheckUtils]: 29: Hoare triple {5806#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5807#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:48:22,823 INFO L273 TraceCheckUtils]: 30: Hoare triple {5807#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {5777#false} is VALID [2019-01-07 18:48:22,824 INFO L273 TraceCheckUtils]: 31: Hoare triple {5777#false} assume !false; {5777#false} is VALID [2019-01-07 18:48:22,826 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:22,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:22,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:48:22,826 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:48:22,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:48:22,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:22,826 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:48:22,835 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 18:48:22,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 18:48:22,878 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 18:48:22,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:48:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:22,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:48:23,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:48:23,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:48:23,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:48:23,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-07 18:48:23,831 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:48:23,831 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_160]. (and (<= 14 ULTIMATE.start_main_~MAX~6) (= (store v_ULTIMATE.start_main_~str2~6_160 13 (select ULTIMATE.start_main_~str1~6 0)) ULTIMATE.start_main_~str2~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 15))) [2019-01-07 18:48:23,831 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select ULTIMATE.start_main_~str2~6 13) (select ULTIMATE.start_main_~str1~6 0)) (<= 14 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 15))) [2019-01-07 18:48:23,899 INFO L273 TraceCheckUtils]: 0: Hoare triple {5776#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {5776#true} is VALID [2019-01-07 18:48:23,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:23,900 INFO L273 TraceCheckUtils]: 2: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:23,900 INFO L273 TraceCheckUtils]: 3: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:23,900 INFO L273 TraceCheckUtils]: 4: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:23,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:23,901 INFO L273 TraceCheckUtils]: 6: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:23,901 INFO L273 TraceCheckUtils]: 7: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:23,901 INFO L273 TraceCheckUtils]: 8: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:23,901 INFO L273 TraceCheckUtils]: 9: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:23,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:23,901 INFO L273 TraceCheckUtils]: 11: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:23,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:23,902 INFO L273 TraceCheckUtils]: 13: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:23,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:23,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {5776#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {5856#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:23,903 INFO L273 TraceCheckUtils]: 16: Hoare triple {5856#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5860#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} is VALID [2019-01-07 18:48:23,904 INFO L273 TraceCheckUtils]: 17: Hoare triple {5860#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5864#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:48:23,905 INFO L273 TraceCheckUtils]: 18: Hoare triple {5864#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5868#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} is VALID [2019-01-07 18:48:23,906 INFO L273 TraceCheckUtils]: 19: Hoare triple {5868#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5872#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} is VALID [2019-01-07 18:48:23,907 INFO L273 TraceCheckUtils]: 20: Hoare triple {5872#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5876#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:23,908 INFO L273 TraceCheckUtils]: 21: Hoare triple {5876#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5880#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)) (= ULTIMATE.start_main_~j~6 6))} is VALID [2019-01-07 18:48:23,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {5880#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)) (= ULTIMATE.start_main_~j~6 6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5884#(and (= ULTIMATE.start_main_~j~6 7) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 8)))} is VALID [2019-01-07 18:48:23,914 INFO L273 TraceCheckUtils]: 23: Hoare triple {5884#(and (= ULTIMATE.start_main_~j~6 7) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 8)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5888#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9)) (= ULTIMATE.start_main_~j~6 8))} is VALID [2019-01-07 18:48:23,915 INFO L273 TraceCheckUtils]: 24: Hoare triple {5888#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9)) (= ULTIMATE.start_main_~j~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5892#(and (= ULTIMATE.start_main_~j~6 9) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 10)))} is VALID [2019-01-07 18:48:23,917 INFO L273 TraceCheckUtils]: 25: Hoare triple {5892#(and (= ULTIMATE.start_main_~j~6 9) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 10)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5896#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 11)) (= ULTIMATE.start_main_~j~6 10))} is VALID [2019-01-07 18:48:23,919 INFO L273 TraceCheckUtils]: 26: Hoare triple {5896#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 11)) (= ULTIMATE.start_main_~j~6 10))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5900#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 12)) (= ULTIMATE.start_main_~j~6 11))} is VALID [2019-01-07 18:48:23,921 INFO L273 TraceCheckUtils]: 27: Hoare triple {5900#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 12)) (= ULTIMATE.start_main_~j~6 11))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5904#(and (= ULTIMATE.start_main_~j~6 12) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 13)))} is VALID [2019-01-07 18:48:23,922 INFO L273 TraceCheckUtils]: 28: Hoare triple {5904#(and (= ULTIMATE.start_main_~j~6 12) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 13)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5908#(and (= ULTIMATE.start_main_~j~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 14)))} is VALID [2019-01-07 18:48:23,922 INFO L273 TraceCheckUtils]: 29: Hoare triple {5908#(and (= ULTIMATE.start_main_~j~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 14)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5912#(and (= (select ULTIMATE.start_main_~str2~6 13) (select ULTIMATE.start_main_~str1~6 0)) (<= 14 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 15)))} is VALID [2019-01-07 18:48:23,924 INFO L273 TraceCheckUtils]: 30: Hoare triple {5912#(and (= (select ULTIMATE.start_main_~str2~6 13) (select ULTIMATE.start_main_~str1~6 0)) (<= 14 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 15)))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {5777#false} is VALID [2019-01-07 18:48:23,924 INFO L273 TraceCheckUtils]: 31: Hoare triple {5777#false} assume !false; {5777#false} is VALID [2019-01-07 18:48:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-07 18:48:23,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:48:24,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:48:24,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:48:24,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:48:24,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-07 18:48:24,208 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:48:24,209 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (or (not (<= 0 ULTIMATE.start_main_~i~6)) (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) (< 0 ULTIMATE.start_main_~i~6)) [2019-01-07 18:48:24,209 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:48:25,934 INFO L273 TraceCheckUtils]: 31: Hoare triple {5777#false} assume !false; {5777#false} is VALID [2019-01-07 18:48:25,935 INFO L273 TraceCheckUtils]: 30: Hoare triple {5922#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {5777#false} is VALID [2019-01-07 18:48:25,937 INFO L273 TraceCheckUtils]: 29: Hoare triple {5926#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5922#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:25,938 INFO L273 TraceCheckUtils]: 28: Hoare triple {5930#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5926#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:25,940 INFO L273 TraceCheckUtils]: 27: Hoare triple {5934#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5930#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} is VALID [2019-01-07 18:48:25,941 INFO L273 TraceCheckUtils]: 26: Hoare triple {5938#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5934#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:25,942 INFO L273 TraceCheckUtils]: 25: Hoare triple {5942#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5938#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:25,944 INFO L273 TraceCheckUtils]: 24: Hoare triple {5946#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5942#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} is VALID [2019-01-07 18:48:25,945 INFO L273 TraceCheckUtils]: 23: Hoare triple {5950#(or (< ULTIMATE.start_main_~i~6 6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 7)) (< 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5946#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:25,946 INFO L273 TraceCheckUtils]: 22: Hoare triple {5954#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 8)) (< ULTIMATE.start_main_~i~6 7) (< 7 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5950#(or (< ULTIMATE.start_main_~i~6 6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 7)) (< 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:25,947 INFO L273 TraceCheckUtils]: 21: Hoare triple {5958#(or (< 8 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 9)) (< ULTIMATE.start_main_~i~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5954#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 8)) (< ULTIMATE.start_main_~i~6 7) (< 7 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:25,949 INFO L273 TraceCheckUtils]: 20: Hoare triple {5962#(or (< ULTIMATE.start_main_~i~6 9) (= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6) (< 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5958#(or (< 8 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 9)) (< ULTIMATE.start_main_~i~6 8))} is VALID [2019-01-07 18:48:25,950 INFO L273 TraceCheckUtils]: 19: Hoare triple {5966#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 11)) (< 10 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 10))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5962#(or (< ULTIMATE.start_main_~i~6 9) (= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6) (< 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:25,952 INFO L273 TraceCheckUtils]: 18: Hoare triple {5970#(or (< ULTIMATE.start_main_~i~6 11) (= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6) (< 11 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5966#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 11)) (< 10 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 10))} is VALID [2019-01-07 18:48:25,953 INFO L273 TraceCheckUtils]: 17: Hoare triple {5974#(or (< 12 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 13)) (< ULTIMATE.start_main_~i~6 12))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5970#(or (< ULTIMATE.start_main_~i~6 11) (= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6) (< 11 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:25,954 INFO L273 TraceCheckUtils]: 16: Hoare triple {5978#(or (< ULTIMATE.start_main_~i~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 14)) (< 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {5974#(or (< 12 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 13)) (< ULTIMATE.start_main_~i~6 12))} is VALID [2019-01-07 18:48:25,955 INFO L273 TraceCheckUtils]: 15: Hoare triple {5776#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {5978#(or (< ULTIMATE.start_main_~i~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 14)) (< 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:25,956 INFO L273 TraceCheckUtils]: 14: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:25,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:25,956 INFO L273 TraceCheckUtils]: 12: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:25,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:25,956 INFO L273 TraceCheckUtils]: 10: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:25,957 INFO L273 TraceCheckUtils]: 9: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:25,957 INFO L273 TraceCheckUtils]: 8: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:25,957 INFO L273 TraceCheckUtils]: 7: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:25,957 INFO L273 TraceCheckUtils]: 6: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:25,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:25,958 INFO L273 TraceCheckUtils]: 4: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:25,958 INFO L273 TraceCheckUtils]: 3: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:25,958 INFO L273 TraceCheckUtils]: 2: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:25,958 INFO L273 TraceCheckUtils]: 1: Hoare triple {5776#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {5776#true} is VALID [2019-01-07 18:48:25,958 INFO L273 TraceCheckUtils]: 0: Hoare triple {5776#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {5776#true} is VALID [2019-01-07 18:48:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-07 18:48:25,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:48:25,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17, 17] total 62 [2019-01-07 18:48:25,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:48:25,980 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 32 [2019-01-07 18:48:25,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:48:25,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2019-01-07 18:48:26,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:26,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-07 18:48:26,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-07 18:48:26,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=3240, Unknown=0, NotChecked=0, Total=3782 [2019-01-07 18:48:26,036 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 47 states. [2019-01-07 18:48:32,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:32,094 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-01-07 18:48:32,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-07 18:48:32,095 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 32 [2019-01-07 18:48:32,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:48:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-07 18:48:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-01-07 18:48:32,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-07 18:48:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-01-07 18:48:32,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 57 transitions. [2019-01-07 18:48:32,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:32,343 INFO L225 Difference]: With dead ends: 53 [2019-01-07 18:48:32,344 INFO L226 Difference]: Without dead ends: 35 [2019-01-07 18:48:32,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=925, Invalid=5555, Unknown=0, NotChecked=0, Total=6480 [2019-01-07 18:48:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-07 18:48:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-07 18:48:32,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:48:32,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2019-01-07 18:48:32,850 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2019-01-07 18:48:32,850 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2019-01-07 18:48:32,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:32,851 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-01-07 18:48:32,852 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-07 18:48:32,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:32,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:32,852 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2019-01-07 18:48:32,853 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2019-01-07 18:48:32,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:32,854 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-01-07 18:48:32,854 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-07 18:48:32,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:32,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:32,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:48:32,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:48:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-07 18:48:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-07 18:48:32,855 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-07 18:48:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:48:32,856 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-07 18:48:32,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-07 18:48:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-07 18:48:32,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-07 18:48:32,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:48:32,856 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-07 18:48:32,857 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:48:32,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:48:32,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 22 times [2019-01-07 18:48:32,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:48:32,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:32,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:48:32,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:32,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:48:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:34,081 INFO L273 TraceCheckUtils]: 0: Hoare triple {6305#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {6307#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:34,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {6307#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6308#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:34,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {6308#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6309#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:34,085 INFO L273 TraceCheckUtils]: 3: Hoare triple {6309#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6310#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:48:34,086 INFO L273 TraceCheckUtils]: 4: Hoare triple {6310#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6311#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:34,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {6311#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6312#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:48:34,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {6312#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6313#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:34,089 INFO L273 TraceCheckUtils]: 7: Hoare triple {6313#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6314#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:48:34,090 INFO L273 TraceCheckUtils]: 8: Hoare triple {6314#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6315#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:34,092 INFO L273 TraceCheckUtils]: 9: Hoare triple {6315#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6316#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:34,093 INFO L273 TraceCheckUtils]: 10: Hoare triple {6316#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6317#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:34,094 INFO L273 TraceCheckUtils]: 11: Hoare triple {6317#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6318#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:48:34,095 INFO L273 TraceCheckUtils]: 12: Hoare triple {6318#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6319#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:34,096 INFO L273 TraceCheckUtils]: 13: Hoare triple {6319#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6320#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:34,097 INFO L273 TraceCheckUtils]: 14: Hoare triple {6320#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6321#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6)))} is VALID [2019-01-07 18:48:34,098 INFO L273 TraceCheckUtils]: 15: Hoare triple {6321#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6322#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 15 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:34,099 INFO L273 TraceCheckUtils]: 16: Hoare triple {6322#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 15 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {6323#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:34,101 INFO L273 TraceCheckUtils]: 17: Hoare triple {6323#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6324#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:34,102 INFO L273 TraceCheckUtils]: 18: Hoare triple {6324#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6325#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:34,103 INFO L273 TraceCheckUtils]: 19: Hoare triple {6325#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6326#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:34,104 INFO L273 TraceCheckUtils]: 20: Hoare triple {6326#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6327#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:34,105 INFO L273 TraceCheckUtils]: 21: Hoare triple {6327#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6328#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:34,106 INFO L273 TraceCheckUtils]: 22: Hoare triple {6328#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6329#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:34,107 INFO L273 TraceCheckUtils]: 23: Hoare triple {6329#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6330#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:34,108 INFO L273 TraceCheckUtils]: 24: Hoare triple {6330#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6331#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:34,110 INFO L273 TraceCheckUtils]: 25: Hoare triple {6331#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6332#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:34,111 INFO L273 TraceCheckUtils]: 26: Hoare triple {6332#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6333#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:34,112 INFO L273 TraceCheckUtils]: 27: Hoare triple {6333#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6334#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:34,113 INFO L273 TraceCheckUtils]: 28: Hoare triple {6334#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6335#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:34,114 INFO L273 TraceCheckUtils]: 29: Hoare triple {6335#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6336#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:34,115 INFO L273 TraceCheckUtils]: 30: Hoare triple {6336#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6337#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:34,116 INFO L273 TraceCheckUtils]: 31: Hoare triple {6337#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6338#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:48:34,117 INFO L273 TraceCheckUtils]: 32: Hoare triple {6338#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {6306#false} is VALID [2019-01-07 18:48:34,118 INFO L273 TraceCheckUtils]: 33: Hoare triple {6306#false} assume !false; {6306#false} is VALID [2019-01-07 18:48:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:34,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:34,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:48:34,121 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:48:34,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:48:34,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:34,121 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:48:34,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:48:34,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:48:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:34,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:48:35,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:48:35,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:48:35,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:48:35,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-07 18:48:35,266 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:48:35,266 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_175]. (and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= (store v_ULTIMATE.start_main_~str2~6_175 14 (select ULTIMATE.start_main_~str1~6 0)) ULTIMATE.start_main_~str2~6)) [2019-01-07 18:48:35,266 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 14))) [2019-01-07 18:48:35,334 INFO L273 TraceCheckUtils]: 0: Hoare triple {6305#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {6307#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,335 INFO L273 TraceCheckUtils]: 1: Hoare triple {6307#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6308#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,336 INFO L273 TraceCheckUtils]: 2: Hoare triple {6308#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6309#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,337 INFO L273 TraceCheckUtils]: 3: Hoare triple {6309#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6310#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:48:35,338 INFO L273 TraceCheckUtils]: 4: Hoare triple {6310#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6311#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {6311#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6312#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:48:35,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {6312#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6313#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,342 INFO L273 TraceCheckUtils]: 7: Hoare triple {6313#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6314#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:48:35,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {6314#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6315#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {6315#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6316#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,345 INFO L273 TraceCheckUtils]: 10: Hoare triple {6316#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6317#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,346 INFO L273 TraceCheckUtils]: 11: Hoare triple {6317#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6318#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:48:35,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {6318#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6319#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,348 INFO L273 TraceCheckUtils]: 13: Hoare triple {6319#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6320#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,350 INFO L273 TraceCheckUtils]: 14: Hoare triple {6320#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6384#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,351 INFO L273 TraceCheckUtils]: 15: Hoare triple {6384#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6388#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~i~6 15))} is VALID [2019-01-07 18:48:35,352 INFO L273 TraceCheckUtils]: 16: Hoare triple {6388#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~i~6 15))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {6392#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 0))} is VALID [2019-01-07 18:48:35,353 INFO L273 TraceCheckUtils]: 17: Hoare triple {6392#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 0))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6396#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 1))} is VALID [2019-01-07 18:48:35,353 INFO L273 TraceCheckUtils]: 18: Hoare triple {6396#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 1))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6400#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:48:35,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {6400#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6404#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 3))} is VALID [2019-01-07 18:48:35,355 INFO L273 TraceCheckUtils]: 20: Hoare triple {6404#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 3))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6408#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 4))} is VALID [2019-01-07 18:48:35,356 INFO L273 TraceCheckUtils]: 21: Hoare triple {6408#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 4))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6412#(and (<= 15 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 5) (<= ULTIMATE.start_main_~MAX~6 15))} is VALID [2019-01-07 18:48:35,357 INFO L273 TraceCheckUtils]: 22: Hoare triple {6412#(and (<= 15 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 5) (<= ULTIMATE.start_main_~MAX~6 15))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6416#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 6))} is VALID [2019-01-07 18:48:35,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {6416#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6420#(and (<= 15 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 7) (<= ULTIMATE.start_main_~MAX~6 15))} is VALID [2019-01-07 18:48:35,359 INFO L273 TraceCheckUtils]: 24: Hoare triple {6420#(and (<= 15 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 7) (<= ULTIMATE.start_main_~MAX~6 15))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6424#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 8))} is VALID [2019-01-07 18:48:35,360 INFO L273 TraceCheckUtils]: 25: Hoare triple {6424#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6428#(and (<= 15 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 9) (<= ULTIMATE.start_main_~MAX~6 15))} is VALID [2019-01-07 18:48:35,361 INFO L273 TraceCheckUtils]: 26: Hoare triple {6428#(and (<= 15 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 9) (<= ULTIMATE.start_main_~MAX~6 15))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6432#(and (<= 15 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 10) (<= ULTIMATE.start_main_~MAX~6 15))} is VALID [2019-01-07 18:48:35,362 INFO L273 TraceCheckUtils]: 27: Hoare triple {6432#(and (<= 15 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 10) (<= ULTIMATE.start_main_~MAX~6 15))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6436#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 11))} is VALID [2019-01-07 18:48:35,362 INFO L273 TraceCheckUtils]: 28: Hoare triple {6436#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 11))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6440#(and (<= 15 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 12) (<= ULTIMATE.start_main_~MAX~6 15))} is VALID [2019-01-07 18:48:35,363 INFO L273 TraceCheckUtils]: 29: Hoare triple {6440#(and (<= 15 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 12) (<= ULTIMATE.start_main_~MAX~6 15))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6444#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 13))} is VALID [2019-01-07 18:48:35,364 INFO L273 TraceCheckUtils]: 30: Hoare triple {6444#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 13))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6448#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 14))} is VALID [2019-01-07 18:48:35,365 INFO L273 TraceCheckUtils]: 31: Hoare triple {6448#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= ULTIMATE.start_main_~j~6 14))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6452#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 14)))} is VALID [2019-01-07 18:48:35,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {6452#(and (<= 15 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 15) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 14)))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {6306#false} is VALID [2019-01-07 18:48:35,367 INFO L273 TraceCheckUtils]: 33: Hoare triple {6306#false} assume !false; {6306#false} is VALID [2019-01-07 18:48:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:35,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:48:35,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:48:35,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:48:35,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:48:35,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-07 18:48:35,418 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:48:35,419 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) [2019-01-07 18:48:35,419 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6) [2019-01-07 18:48:35,718 INFO L273 TraceCheckUtils]: 33: Hoare triple {6306#false} assume !false; {6306#false} is VALID [2019-01-07 18:48:35,719 INFO L273 TraceCheckUtils]: 32: Hoare triple {6338#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {6306#false} is VALID [2019-01-07 18:48:35,720 INFO L273 TraceCheckUtils]: 31: Hoare triple {6337#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6338#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:48:35,722 INFO L273 TraceCheckUtils]: 30: Hoare triple {6336#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6337#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:35,723 INFO L273 TraceCheckUtils]: 29: Hoare triple {6335#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6336#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:35,724 INFO L273 TraceCheckUtils]: 28: Hoare triple {6334#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6335#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:35,725 INFO L273 TraceCheckUtils]: 27: Hoare triple {6333#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6334#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:35,726 INFO L273 TraceCheckUtils]: 26: Hoare triple {6332#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6333#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:35,727 INFO L273 TraceCheckUtils]: 25: Hoare triple {6331#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6332#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:35,728 INFO L273 TraceCheckUtils]: 24: Hoare triple {6330#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6331#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:35,729 INFO L273 TraceCheckUtils]: 23: Hoare triple {6329#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6330#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:35,730 INFO L273 TraceCheckUtils]: 22: Hoare triple {6328#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6329#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:35,732 INFO L273 TraceCheckUtils]: 21: Hoare triple {6327#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6328#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:35,733 INFO L273 TraceCheckUtils]: 20: Hoare triple {6326#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6327#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:35,734 INFO L273 TraceCheckUtils]: 19: Hoare triple {6325#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6326#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:35,735 INFO L273 TraceCheckUtils]: 18: Hoare triple {6324#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6325#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:35,736 INFO L273 TraceCheckUtils]: 17: Hoare triple {6323#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6324#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:35,737 INFO L273 TraceCheckUtils]: 16: Hoare triple {6322#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 15 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {6323#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:35,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {6384#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6322#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 15 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:35,739 INFO L273 TraceCheckUtils]: 14: Hoare triple {6320#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6384#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {6319#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6320#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,742 INFO L273 TraceCheckUtils]: 12: Hoare triple {6318#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6319#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,743 INFO L273 TraceCheckUtils]: 11: Hoare triple {6317#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6318#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:48:35,744 INFO L273 TraceCheckUtils]: 10: Hoare triple {6316#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6317#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {6315#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6316#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {6314#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6315#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,747 INFO L273 TraceCheckUtils]: 7: Hoare triple {6313#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6314#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:48:35,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {6312#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6313#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,749 INFO L273 TraceCheckUtils]: 5: Hoare triple {6311#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6312#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:48:35,750 INFO L273 TraceCheckUtils]: 4: Hoare triple {6310#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6311#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,752 INFO L273 TraceCheckUtils]: 3: Hoare triple {6309#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6310#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:48:35,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {6308#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6309#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,754 INFO L273 TraceCheckUtils]: 1: Hoare triple {6307#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6308#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,754 INFO L273 TraceCheckUtils]: 0: Hoare triple {6305#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {6307#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:35,757 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:35,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:48:35,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2019-01-07 18:48:35,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:48:35,778 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 34 [2019-01-07 18:48:35,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:48:35,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2019-01-07 18:48:35,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:35,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-07 18:48:35,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-07 18:48:35,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2501, Unknown=0, NotChecked=0, Total=2652 [2019-01-07 18:48:35,836 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 52 states. [2019-01-07 18:48:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:41,980 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-01-07 18:48:41,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-07 18:48:41,981 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 34 [2019-01-07 18:48:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:48:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-07 18:48:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-01-07 18:48:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-07 18:48:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-01-07 18:48:41,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 42 transitions. [2019-01-07 18:48:42,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:42,035 INFO L225 Difference]: With dead ends: 54 [2019-01-07 18:48:42,035 INFO L226 Difference]: Without dead ends: 36 [2019-01-07 18:48:42,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=320, Invalid=4510, Unknown=0, NotChecked=0, Total=4830 [2019-01-07 18:48:42,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-07 18:48:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-07 18:48:42,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:48:42,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2019-01-07 18:48:42,604 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2019-01-07 18:48:42,604 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2019-01-07 18:48:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:42,604 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-07 18:48:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-07 18:48:42,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:42,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:42,605 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2019-01-07 18:48:42,605 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2019-01-07 18:48:42,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:42,605 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-07 18:48:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-07 18:48:42,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:42,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:42,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:48:42,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:48:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-07 18:48:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-01-07 18:48:42,620 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2019-01-07 18:48:42,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:48:42,620 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-01-07 18:48:42,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-07 18:48:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-07 18:48:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-07 18:48:42,622 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:48:42,622 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1] [2019-01-07 18:48:42,622 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:48:42,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:48:42,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1394260940, now seen corresponding path program 23 times [2019-01-07 18:48:42,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:48:42,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:42,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:48:42,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:42,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:48:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:43,287 INFO L273 TraceCheckUtils]: 0: Hoare triple {6840#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {6842#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {6842#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6843#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,290 INFO L273 TraceCheckUtils]: 2: Hoare triple {6843#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6844#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,291 INFO L273 TraceCheckUtils]: 3: Hoare triple {6844#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6845#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,292 INFO L273 TraceCheckUtils]: 4: Hoare triple {6845#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6846#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {6846#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6847#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,294 INFO L273 TraceCheckUtils]: 6: Hoare triple {6847#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6848#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {6848#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6849#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {6849#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6850#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,297 INFO L273 TraceCheckUtils]: 9: Hoare triple {6850#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6851#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {6851#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6852#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {6852#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6853#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,300 INFO L273 TraceCheckUtils]: 12: Hoare triple {6853#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6854#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,301 INFO L273 TraceCheckUtils]: 13: Hoare triple {6854#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6855#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,302 INFO L273 TraceCheckUtils]: 14: Hoare triple {6855#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6856#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {6856#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6857#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,303 INFO L273 TraceCheckUtils]: 16: Hoare triple {6857#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6858#(<= 16 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:43,304 INFO L273 TraceCheckUtils]: 17: Hoare triple {6858#(<= 16 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {6857#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,305 INFO L273 TraceCheckUtils]: 18: Hoare triple {6857#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6856#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,306 INFO L273 TraceCheckUtils]: 19: Hoare triple {6856#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6855#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,307 INFO L273 TraceCheckUtils]: 20: Hoare triple {6855#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6854#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,308 INFO L273 TraceCheckUtils]: 21: Hoare triple {6854#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6853#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {6853#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6852#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {6852#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6851#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {6851#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6850#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,312 INFO L273 TraceCheckUtils]: 25: Hoare triple {6850#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6849#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,313 INFO L273 TraceCheckUtils]: 26: Hoare triple {6849#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6848#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,314 INFO L273 TraceCheckUtils]: 27: Hoare triple {6848#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6847#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,315 INFO L273 TraceCheckUtils]: 28: Hoare triple {6847#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6846#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {6846#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6845#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,317 INFO L273 TraceCheckUtils]: 30: Hoare triple {6845#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6844#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,318 INFO L273 TraceCheckUtils]: 31: Hoare triple {6844#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6843#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,319 INFO L273 TraceCheckUtils]: 32: Hoare triple {6843#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6842#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,320 INFO L273 TraceCheckUtils]: 33: Hoare triple {6842#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {6841#false} is VALID [2019-01-07 18:48:43,320 INFO L273 TraceCheckUtils]: 34: Hoare triple {6841#false} assume !false; {6841#false} is VALID [2019-01-07 18:48:43,322 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:43,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:43,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:48:43,323 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:48:43,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:48:43,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:43,324 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:48:43,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 18:48:43,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 18:48:43,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-07 18:48:43,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:48:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:43,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:48:43,610 INFO L273 TraceCheckUtils]: 0: Hoare triple {6840#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {6842#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,611 INFO L273 TraceCheckUtils]: 1: Hoare triple {6842#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6843#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,612 INFO L273 TraceCheckUtils]: 2: Hoare triple {6843#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6844#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,613 INFO L273 TraceCheckUtils]: 3: Hoare triple {6844#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6845#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,614 INFO L273 TraceCheckUtils]: 4: Hoare triple {6845#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6846#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {6846#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6847#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,616 INFO L273 TraceCheckUtils]: 6: Hoare triple {6847#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6848#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {6848#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6849#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,618 INFO L273 TraceCheckUtils]: 8: Hoare triple {6849#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6850#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,619 INFO L273 TraceCheckUtils]: 9: Hoare triple {6850#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6851#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {6851#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6852#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,621 INFO L273 TraceCheckUtils]: 11: Hoare triple {6852#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6853#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,622 INFO L273 TraceCheckUtils]: 12: Hoare triple {6853#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6854#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {6854#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6855#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {6855#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6856#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,624 INFO L273 TraceCheckUtils]: 15: Hoare triple {6856#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6857#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,625 INFO L273 TraceCheckUtils]: 16: Hoare triple {6857#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6858#(<= 16 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:43,626 INFO L273 TraceCheckUtils]: 17: Hoare triple {6858#(<= 16 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {6857#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,627 INFO L273 TraceCheckUtils]: 18: Hoare triple {6857#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6856#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,628 INFO L273 TraceCheckUtils]: 19: Hoare triple {6856#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6855#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {6855#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6854#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {6854#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6853#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,631 INFO L273 TraceCheckUtils]: 22: Hoare triple {6853#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6852#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,632 INFO L273 TraceCheckUtils]: 23: Hoare triple {6852#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6851#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,633 INFO L273 TraceCheckUtils]: 24: Hoare triple {6851#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6850#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,634 INFO L273 TraceCheckUtils]: 25: Hoare triple {6850#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6849#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,635 INFO L273 TraceCheckUtils]: 26: Hoare triple {6849#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6848#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,636 INFO L273 TraceCheckUtils]: 27: Hoare triple {6848#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6847#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,637 INFO L273 TraceCheckUtils]: 28: Hoare triple {6847#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6846#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,638 INFO L273 TraceCheckUtils]: 29: Hoare triple {6846#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6845#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,639 INFO L273 TraceCheckUtils]: 30: Hoare triple {6845#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6844#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,640 INFO L273 TraceCheckUtils]: 31: Hoare triple {6844#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6843#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,641 INFO L273 TraceCheckUtils]: 32: Hoare triple {6843#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6842#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:43,642 INFO L273 TraceCheckUtils]: 33: Hoare triple {6842#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {6841#false} is VALID [2019-01-07 18:48:43,642 INFO L273 TraceCheckUtils]: 34: Hoare triple {6841#false} assume !false; {6841#false} is VALID [2019-01-07 18:48:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:43,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:48:44,074 INFO L273 TraceCheckUtils]: 34: Hoare triple {6841#false} assume !false; {6841#false} is VALID [2019-01-07 18:48:44,075 INFO L273 TraceCheckUtils]: 33: Hoare triple {6842#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {6841#false} is VALID [2019-01-07 18:48:44,075 INFO L273 TraceCheckUtils]: 32: Hoare triple {6843#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6842#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,076 INFO L273 TraceCheckUtils]: 31: Hoare triple {6844#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6843#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,077 INFO L273 TraceCheckUtils]: 30: Hoare triple {6845#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6844#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,077 INFO L273 TraceCheckUtils]: 29: Hoare triple {6846#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6845#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,078 INFO L273 TraceCheckUtils]: 28: Hoare triple {6847#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6846#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,079 INFO L273 TraceCheckUtils]: 27: Hoare triple {6848#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6847#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,080 INFO L273 TraceCheckUtils]: 26: Hoare triple {6849#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6848#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {6850#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6849#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,082 INFO L273 TraceCheckUtils]: 24: Hoare triple {6851#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6850#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,083 INFO L273 TraceCheckUtils]: 23: Hoare triple {6852#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6851#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,084 INFO L273 TraceCheckUtils]: 22: Hoare triple {6853#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6852#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {6854#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6853#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,086 INFO L273 TraceCheckUtils]: 20: Hoare triple {6855#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6854#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,087 INFO L273 TraceCheckUtils]: 19: Hoare triple {6856#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6855#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,088 INFO L273 TraceCheckUtils]: 18: Hoare triple {6857#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {6856#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,089 INFO L273 TraceCheckUtils]: 17: Hoare triple {6858#(<= 16 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {6857#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {6857#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6858#(<= 16 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:44,091 INFO L273 TraceCheckUtils]: 15: Hoare triple {6856#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6857#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,092 INFO L273 TraceCheckUtils]: 14: Hoare triple {6855#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6856#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,093 INFO L273 TraceCheckUtils]: 13: Hoare triple {6854#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6855#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,094 INFO L273 TraceCheckUtils]: 12: Hoare triple {6853#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6854#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,095 INFO L273 TraceCheckUtils]: 11: Hoare triple {6852#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6853#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,096 INFO L273 TraceCheckUtils]: 10: Hoare triple {6851#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6852#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {6850#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6851#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,098 INFO L273 TraceCheckUtils]: 8: Hoare triple {6849#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6850#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,099 INFO L273 TraceCheckUtils]: 7: Hoare triple {6848#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6849#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,100 INFO L273 TraceCheckUtils]: 6: Hoare triple {6847#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6848#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {6846#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6847#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,103 INFO L273 TraceCheckUtils]: 4: Hoare triple {6845#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6846#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,104 INFO L273 TraceCheckUtils]: 3: Hoare triple {6844#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6845#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,105 INFO L273 TraceCheckUtils]: 2: Hoare triple {6843#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6844#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {6842#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {6843#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,106 INFO L273 TraceCheckUtils]: 0: Hoare triple {6840#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {6842#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:48:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:44,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:48:44,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2019-01-07 18:48:44,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:48:44,130 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-01-07 18:48:44,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:48:44,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2019-01-07 18:48:44,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:44,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-07 18:48:44,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-07 18:48:44,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-01-07 18:48:44,175 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2019-01-07 18:48:45,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:45,431 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-07 18:48:45,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-07 18:48:45,431 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-01-07 18:48:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:48:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-07 18:48:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-01-07 18:48:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-07 18:48:45,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-01-07 18:48:45,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 40 transitions. [2019-01-07 18:48:45,472 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:45,473 INFO L225 Difference]: With dead ends: 39 [2019-01-07 18:48:45,473 INFO L226 Difference]: Without dead ends: 37 [2019-01-07 18:48:45,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 32 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-01-07 18:48:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-07 18:48:46,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-07 18:48:46,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:48:46,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2019-01-07 18:48:46,029 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2019-01-07 18:48:46,029 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2019-01-07 18:48:46,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:46,030 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-01-07 18:48:46,030 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-07 18:48:46,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:46,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:46,031 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2019-01-07 18:48:46,031 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2019-01-07 18:48:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:46,032 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-01-07 18:48:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-07 18:48:46,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:46,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:46,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:48:46,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:48:46,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-07 18:48:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-07 18:48:46,033 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-01-07 18:48:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:48:46,033 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-07 18:48:46,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-07 18:48:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-07 18:48:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-07 18:48:46,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:48:46,034 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-07 18:48:46,034 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:48:46,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:48:46,034 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 24 times [2019-01-07 18:48:46,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:48:46,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:46,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:48:46,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:46,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:48:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:47,355 INFO L273 TraceCheckUtils]: 0: Hoare triple {7318#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {7320#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:47,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {7320#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7321#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:47,358 INFO L273 TraceCheckUtils]: 2: Hoare triple {7321#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7322#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:47,359 INFO L273 TraceCheckUtils]: 3: Hoare triple {7322#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7323#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:48:47,360 INFO L273 TraceCheckUtils]: 4: Hoare triple {7323#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7324#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:47,361 INFO L273 TraceCheckUtils]: 5: Hoare triple {7324#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7325#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:48:47,362 INFO L273 TraceCheckUtils]: 6: Hoare triple {7325#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7326#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:47,363 INFO L273 TraceCheckUtils]: 7: Hoare triple {7326#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7327#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:48:47,364 INFO L273 TraceCheckUtils]: 8: Hoare triple {7327#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7328#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:47,366 INFO L273 TraceCheckUtils]: 9: Hoare triple {7328#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7329#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:47,367 INFO L273 TraceCheckUtils]: 10: Hoare triple {7329#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7330#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:47,368 INFO L273 TraceCheckUtils]: 11: Hoare triple {7330#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7331#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:48:47,369 INFO L273 TraceCheckUtils]: 12: Hoare triple {7331#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7332#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:47,370 INFO L273 TraceCheckUtils]: 13: Hoare triple {7332#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7333#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:47,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {7333#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7334#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:47,372 INFO L273 TraceCheckUtils]: 15: Hoare triple {7334#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7335#(or (and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15)) (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))))} is VALID [2019-01-07 18:48:47,373 INFO L273 TraceCheckUtils]: 16: Hoare triple {7335#(or (and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15)) (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7336#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 16 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:47,374 INFO L273 TraceCheckUtils]: 17: Hoare triple {7336#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 16 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {7337#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {7337#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7338#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,377 INFO L273 TraceCheckUtils]: 19: Hoare triple {7338#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7339#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,378 INFO L273 TraceCheckUtils]: 20: Hoare triple {7339#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7340#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,379 INFO L273 TraceCheckUtils]: 21: Hoare triple {7340#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7341#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,380 INFO L273 TraceCheckUtils]: 22: Hoare triple {7341#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7342#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,381 INFO L273 TraceCheckUtils]: 23: Hoare triple {7342#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7343#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,382 INFO L273 TraceCheckUtils]: 24: Hoare triple {7343#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7344#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,383 INFO L273 TraceCheckUtils]: 25: Hoare triple {7344#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7345#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,384 INFO L273 TraceCheckUtils]: 26: Hoare triple {7345#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7346#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,385 INFO L273 TraceCheckUtils]: 27: Hoare triple {7346#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7347#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,386 INFO L273 TraceCheckUtils]: 28: Hoare triple {7347#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7348#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,387 INFO L273 TraceCheckUtils]: 29: Hoare triple {7348#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7349#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,389 INFO L273 TraceCheckUtils]: 30: Hoare triple {7349#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7350#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,390 INFO L273 TraceCheckUtils]: 31: Hoare triple {7350#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7351#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,391 INFO L273 TraceCheckUtils]: 32: Hoare triple {7351#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7352#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:47,392 INFO L273 TraceCheckUtils]: 33: Hoare triple {7352#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7353#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:48:47,393 INFO L273 TraceCheckUtils]: 34: Hoare triple {7353#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {7319#false} is VALID [2019-01-07 18:48:47,393 INFO L273 TraceCheckUtils]: 35: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2019-01-07 18:48:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:47,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:47,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:48:47,397 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:48:47,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:48:47,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:47,397 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:48:47,410 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 18:48:47,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 18:48:47,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 18:48:47,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:48:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:47,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:48:48,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:48:48,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:48:48,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:48:48,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-07 18:48:48,418 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:48:48,418 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_206]. (and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 17)) (<= 16 ULTIMATE.start_main_~MAX~6) (= (store v_ULTIMATE.start_main_~str2~6_206 15 (select ULTIMATE.start_main_~str1~6 0)) ULTIMATE.start_main_~str2~6)) [2019-01-07 18:48:48,418 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 17)) (= (select ULTIMATE.start_main_~str2~6 15) (select ULTIMATE.start_main_~str1~6 0)) (<= 16 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:48:48,488 INFO L273 TraceCheckUtils]: 0: Hoare triple {7318#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {7318#true} is VALID [2019-01-07 18:48:48,488 INFO L273 TraceCheckUtils]: 1: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,489 INFO L273 TraceCheckUtils]: 3: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,489 INFO L273 TraceCheckUtils]: 4: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,489 INFO L273 TraceCheckUtils]: 6: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,489 INFO L273 TraceCheckUtils]: 7: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,489 INFO L273 TraceCheckUtils]: 8: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,489 INFO L273 TraceCheckUtils]: 9: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,490 INFO L273 TraceCheckUtils]: 10: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,490 INFO L273 TraceCheckUtils]: 11: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,490 INFO L273 TraceCheckUtils]: 12: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,490 INFO L273 TraceCheckUtils]: 13: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,490 INFO L273 TraceCheckUtils]: 14: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,490 INFO L273 TraceCheckUtils]: 15: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,490 INFO L273 TraceCheckUtils]: 16: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:48,491 INFO L273 TraceCheckUtils]: 17: Hoare triple {7318#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {7408#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:48,492 INFO L273 TraceCheckUtils]: 18: Hoare triple {7408#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7412#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} is VALID [2019-01-07 18:48:48,492 INFO L273 TraceCheckUtils]: 19: Hoare triple {7412#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7416#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:48:48,493 INFO L273 TraceCheckUtils]: 20: Hoare triple {7416#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7420#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} is VALID [2019-01-07 18:48:48,494 INFO L273 TraceCheckUtils]: 21: Hoare triple {7420#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7424#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} is VALID [2019-01-07 18:48:48,495 INFO L273 TraceCheckUtils]: 22: Hoare triple {7424#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7428#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:48,496 INFO L273 TraceCheckUtils]: 23: Hoare triple {7428#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7432#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)) (= ULTIMATE.start_main_~j~6 6))} is VALID [2019-01-07 18:48:48,497 INFO L273 TraceCheckUtils]: 24: Hoare triple {7432#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)) (= ULTIMATE.start_main_~j~6 6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7436#(and (= ULTIMATE.start_main_~j~6 7) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 8)))} is VALID [2019-01-07 18:48:48,498 INFO L273 TraceCheckUtils]: 25: Hoare triple {7436#(and (= ULTIMATE.start_main_~j~6 7) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 8)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7440#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9)) (= ULTIMATE.start_main_~j~6 8))} is VALID [2019-01-07 18:48:48,500 INFO L273 TraceCheckUtils]: 26: Hoare triple {7440#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9)) (= ULTIMATE.start_main_~j~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7444#(and (= ULTIMATE.start_main_~j~6 9) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 10)))} is VALID [2019-01-07 18:48:48,501 INFO L273 TraceCheckUtils]: 27: Hoare triple {7444#(and (= ULTIMATE.start_main_~j~6 9) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 10)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7448#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 11)) (= ULTIMATE.start_main_~j~6 10))} is VALID [2019-01-07 18:48:48,502 INFO L273 TraceCheckUtils]: 28: Hoare triple {7448#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 11)) (= ULTIMATE.start_main_~j~6 10))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7452#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 12)) (= ULTIMATE.start_main_~j~6 11))} is VALID [2019-01-07 18:48:48,503 INFO L273 TraceCheckUtils]: 29: Hoare triple {7452#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 12)) (= ULTIMATE.start_main_~j~6 11))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7456#(and (= ULTIMATE.start_main_~j~6 12) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 13)))} is VALID [2019-01-07 18:48:48,504 INFO L273 TraceCheckUtils]: 30: Hoare triple {7456#(and (= ULTIMATE.start_main_~j~6 12) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 13)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7460#(and (= ULTIMATE.start_main_~j~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 14)))} is VALID [2019-01-07 18:48:48,505 INFO L273 TraceCheckUtils]: 31: Hoare triple {7460#(and (= ULTIMATE.start_main_~j~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 14)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7464#(and (= ULTIMATE.start_main_~j~6 14) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 15)))} is VALID [2019-01-07 18:48:48,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {7464#(and (= ULTIMATE.start_main_~j~6 14) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 15)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7468#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 16)) (= ULTIMATE.start_main_~j~6 15))} is VALID [2019-01-07 18:48:48,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {7468#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 16)) (= ULTIMATE.start_main_~j~6 15))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7472#(and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 17)) (= (select ULTIMATE.start_main_~str2~6 15) (select ULTIMATE.start_main_~str1~6 0)) (<= 16 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:48,509 INFO L273 TraceCheckUtils]: 34: Hoare triple {7472#(and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 17)) (= (select ULTIMATE.start_main_~str2~6 15) (select ULTIMATE.start_main_~str1~6 0)) (<= 16 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {7319#false} is VALID [2019-01-07 18:48:48,509 INFO L273 TraceCheckUtils]: 35: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2019-01-07 18:48:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-07 18:48:48,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:48:48,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:48:48,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:48:48,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:48:48,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-07 18:48:48,647 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:48:48,647 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (or (not (<= 0 ULTIMATE.start_main_~i~6)) (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) (< 0 ULTIMATE.start_main_~i~6)) [2019-01-07 18:48:48,647 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:48:50,031 INFO L273 TraceCheckUtils]: 35: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2019-01-07 18:48:50,033 INFO L273 TraceCheckUtils]: 34: Hoare triple {7482#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {7319#false} is VALID [2019-01-07 18:48:50,034 INFO L273 TraceCheckUtils]: 33: Hoare triple {7486#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7482#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:50,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {7490#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7486#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:50,037 INFO L273 TraceCheckUtils]: 31: Hoare triple {7494#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7490#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} is VALID [2019-01-07 18:48:50,038 INFO L273 TraceCheckUtils]: 30: Hoare triple {7498#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7494#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:50,039 INFO L273 TraceCheckUtils]: 29: Hoare triple {7502#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7498#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:50,041 INFO L273 TraceCheckUtils]: 28: Hoare triple {7506#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7502#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} is VALID [2019-01-07 18:48:50,042 INFO L273 TraceCheckUtils]: 27: Hoare triple {7510#(or (< ULTIMATE.start_main_~i~6 6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 7)) (< 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7506#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:50,043 INFO L273 TraceCheckUtils]: 26: Hoare triple {7514#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 8)) (< ULTIMATE.start_main_~i~6 7) (< 7 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7510#(or (< ULTIMATE.start_main_~i~6 6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 7)) (< 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:50,044 INFO L273 TraceCheckUtils]: 25: Hoare triple {7518#(or (< 8 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 9)) (< ULTIMATE.start_main_~i~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7514#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 8)) (< ULTIMATE.start_main_~i~6 7) (< 7 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:50,045 INFO L273 TraceCheckUtils]: 24: Hoare triple {7522#(or (< ULTIMATE.start_main_~i~6 9) (= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6) (< 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7518#(or (< 8 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 9)) (< ULTIMATE.start_main_~i~6 8))} is VALID [2019-01-07 18:48:50,047 INFO L273 TraceCheckUtils]: 23: Hoare triple {7526#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 11)) (< 10 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 10))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7522#(or (< ULTIMATE.start_main_~i~6 9) (= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6) (< 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:50,048 INFO L273 TraceCheckUtils]: 22: Hoare triple {7530#(or (< ULTIMATE.start_main_~i~6 11) (= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6) (< 11 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7526#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 11)) (< 10 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 10))} is VALID [2019-01-07 18:48:50,049 INFO L273 TraceCheckUtils]: 21: Hoare triple {7534#(or (< 12 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 13)) (< ULTIMATE.start_main_~i~6 12))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7530#(or (< ULTIMATE.start_main_~i~6 11) (= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6) (< 11 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:50,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {7538#(or (< ULTIMATE.start_main_~i~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 14)) (< 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7534#(or (< 12 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 13)) (< ULTIMATE.start_main_~i~6 12))} is VALID [2019-01-07 18:48:50,052 INFO L273 TraceCheckUtils]: 19: Hoare triple {7542#(or (< 14 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 15)) (< ULTIMATE.start_main_~i~6 14))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7538#(or (< ULTIMATE.start_main_~i~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 14)) (< 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:50,053 INFO L273 TraceCheckUtils]: 18: Hoare triple {7546#(or (< 15 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 15) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 16)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7542#(or (< 14 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 15)) (< ULTIMATE.start_main_~i~6 14))} is VALID [2019-01-07 18:48:50,054 INFO L273 TraceCheckUtils]: 17: Hoare triple {7318#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {7546#(or (< 15 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 15) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 16)))} is VALID [2019-01-07 18:48:50,054 INFO L273 TraceCheckUtils]: 16: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,054 INFO L273 TraceCheckUtils]: 15: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,055 INFO L273 TraceCheckUtils]: 14: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,055 INFO L273 TraceCheckUtils]: 13: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,055 INFO L273 TraceCheckUtils]: 11: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,056 INFO L273 TraceCheckUtils]: 9: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,056 INFO L273 TraceCheckUtils]: 8: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,056 INFO L273 TraceCheckUtils]: 7: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,057 INFO L273 TraceCheckUtils]: 4: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,057 INFO L273 TraceCheckUtils]: 3: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,057 INFO L273 TraceCheckUtils]: 2: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {7318#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7318#true} is VALID [2019-01-07 18:48:50,057 INFO L273 TraceCheckUtils]: 0: Hoare triple {7318#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {7318#true} is VALID [2019-01-07 18:48:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-07 18:48:50,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:48:50,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19, 19] total 70 [2019-01-07 18:48:50,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:48:50,080 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 36 [2019-01-07 18:48:50,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:48:50,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states. [2019-01-07 18:48:50,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:50,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-07 18:48:50,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-07 18:48:50,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=4148, Unknown=0, NotChecked=0, Total=4830 [2019-01-07 18:48:50,143 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 53 states. [2019-01-07 18:48:57,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:57,751 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-01-07 18:48:57,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-07 18:48:57,752 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 36 [2019-01-07 18:48:57,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:48:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-07 18:48:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2019-01-07 18:48:57,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-07 18:48:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2019-01-07 18:48:57,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 63 transitions. [2019-01-07 18:48:57,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:48:57,832 INFO L225 Difference]: With dead ends: 59 [2019-01-07 18:48:57,832 INFO L226 Difference]: Without dead ends: 39 [2019-01-07 18:48:57,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1147, Invalid=7043, Unknown=0, NotChecked=0, Total=8190 [2019-01-07 18:48:57,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-07 18:48:58,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-07 18:48:58,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:48:58,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2019-01-07 18:48:58,474 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2019-01-07 18:48:58,474 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2019-01-07 18:48:58,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:58,475 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-07 18:48:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-07 18:48:58,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:58,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:58,476 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2019-01-07 18:48:58,476 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2019-01-07 18:48:58,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:48:58,477 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-07 18:48:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-07 18:48:58,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:48:58,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:48:58,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:48:58,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:48:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-07 18:48:58,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-07 18:48:58,478 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-07 18:48:58,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:48:58,478 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-07 18:48:58,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-07 18:48:58,479 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-07 18:48:58,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-07 18:48:58,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:48:58,479 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-07 18:48:58,479 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:48:58,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:48:58,480 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 25 times [2019-01-07 18:48:58,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:48:58,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:58,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:48:58,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:48:58,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:48:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:59,758 INFO L273 TraceCheckUtils]: 0: Hoare triple {7911#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {7913#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:59,760 INFO L273 TraceCheckUtils]: 1: Hoare triple {7913#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7914#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:59,761 INFO L273 TraceCheckUtils]: 2: Hoare triple {7914#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7915#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:59,766 INFO L273 TraceCheckUtils]: 3: Hoare triple {7915#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7916#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:48:59,767 INFO L273 TraceCheckUtils]: 4: Hoare triple {7916#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7917#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:59,768 INFO L273 TraceCheckUtils]: 5: Hoare triple {7917#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7918#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:48:59,768 INFO L273 TraceCheckUtils]: 6: Hoare triple {7918#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7919#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:59,771 INFO L273 TraceCheckUtils]: 7: Hoare triple {7919#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7920#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:48:59,772 INFO L273 TraceCheckUtils]: 8: Hoare triple {7920#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7921#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:59,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {7921#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7922#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:59,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {7922#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7923#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:59,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {7923#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7924#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:48:59,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {7924#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7925#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:59,777 INFO L273 TraceCheckUtils]: 13: Hoare triple {7925#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7926#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:59,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {7926#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7927#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:48:59,780 INFO L273 TraceCheckUtils]: 15: Hoare triple {7927#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7928#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} is VALID [2019-01-07 18:48:59,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {7928#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7929#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16)))} is VALID [2019-01-07 18:48:59,787 INFO L273 TraceCheckUtils]: 17: Hoare triple {7929#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7930#(or (= 17 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:48:59,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {7930#(or (= 17 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {7931#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,789 INFO L273 TraceCheckUtils]: 19: Hoare triple {7931#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7932#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {7932#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7933#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {7933#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7934#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {7934#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7935#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,793 INFO L273 TraceCheckUtils]: 23: Hoare triple {7935#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7936#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,807 INFO L273 TraceCheckUtils]: 24: Hoare triple {7936#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7937#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,808 INFO L273 TraceCheckUtils]: 25: Hoare triple {7937#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7938#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,811 INFO L273 TraceCheckUtils]: 26: Hoare triple {7938#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7939#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,812 INFO L273 TraceCheckUtils]: 27: Hoare triple {7939#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7940#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,813 INFO L273 TraceCheckUtils]: 28: Hoare triple {7940#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7941#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,814 INFO L273 TraceCheckUtils]: 29: Hoare triple {7941#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7942#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,815 INFO L273 TraceCheckUtils]: 30: Hoare triple {7942#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7943#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,817 INFO L273 TraceCheckUtils]: 31: Hoare triple {7943#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7944#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,818 INFO L273 TraceCheckUtils]: 32: Hoare triple {7944#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7945#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,819 INFO L273 TraceCheckUtils]: 33: Hoare triple {7945#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7946#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,819 INFO L273 TraceCheckUtils]: 34: Hoare triple {7946#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7947#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:48:59,821 INFO L273 TraceCheckUtils]: 35: Hoare triple {7947#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7948#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:48:59,822 INFO L273 TraceCheckUtils]: 36: Hoare triple {7948#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {7912#false} is VALID [2019-01-07 18:48:59,822 INFO L273 TraceCheckUtils]: 37: Hoare triple {7912#false} assume !false; {7912#false} is VALID [2019-01-07 18:48:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:48:59,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:59,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:48:59,826 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:48:59,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:48:59,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:48:59,826 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:48:59,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:48:59,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:48:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:48:59,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:49:01,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:49:01,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:49:01,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:49:01,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-07 18:49:01,239 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:49:01,239 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_223]. (and (= (store v_ULTIMATE.start_main_~str2~6_223 16 (select ULTIMATE.start_main_~str1~6 0)) ULTIMATE.start_main_~str2~6) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17)) [2019-01-07 18:49:01,239 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select ULTIMATE.start_main_~str2~6 16) (select ULTIMATE.start_main_~str1~6 0)) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17)) [2019-01-07 18:49:01,309 INFO L273 TraceCheckUtils]: 0: Hoare triple {7911#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {7913#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,311 INFO L273 TraceCheckUtils]: 1: Hoare triple {7913#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7914#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,312 INFO L273 TraceCheckUtils]: 2: Hoare triple {7914#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7915#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,313 INFO L273 TraceCheckUtils]: 3: Hoare triple {7915#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7916#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:49:01,314 INFO L273 TraceCheckUtils]: 4: Hoare triple {7916#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7917#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {7917#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7918#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:49:01,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {7918#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7919#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,317 INFO L273 TraceCheckUtils]: 7: Hoare triple {7919#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7920#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:49:01,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {7920#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7921#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,319 INFO L273 TraceCheckUtils]: 9: Hoare triple {7921#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7922#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,320 INFO L273 TraceCheckUtils]: 10: Hoare triple {7922#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7923#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,321 INFO L273 TraceCheckUtils]: 11: Hoare triple {7923#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7924#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:49:01,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {7924#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7925#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,323 INFO L273 TraceCheckUtils]: 13: Hoare triple {7925#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7926#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {7926#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7927#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {7927#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7928#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} is VALID [2019-01-07 18:49:01,326 INFO L273 TraceCheckUtils]: 16: Hoare triple {7928#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8000#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} is VALID [2019-01-07 18:49:01,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {8000#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8004#(and (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~i~6 17))} is VALID [2019-01-07 18:49:01,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {8004#(and (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~i~6 17))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {8008#(and (= ULTIMATE.start_main_~j~6 0) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} is VALID [2019-01-07 18:49:01,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {8008#(and (= ULTIMATE.start_main_~j~6 0) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8012#(and (= ULTIMATE.start_main_~j~6 1) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} is VALID [2019-01-07 18:49:01,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {8012#(and (= ULTIMATE.start_main_~j~6 1) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8016#(and (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:49:01,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {8016#(and (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8020#(and (<= 17 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 3) (<= ULTIMATE.start_main_~MAX~6 17))} is VALID [2019-01-07 18:49:01,332 INFO L273 TraceCheckUtils]: 22: Hoare triple {8020#(and (<= 17 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 3) (<= ULTIMATE.start_main_~MAX~6 17))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8024#(and (= ULTIMATE.start_main_~j~6 4) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} is VALID [2019-01-07 18:49:01,333 INFO L273 TraceCheckUtils]: 23: Hoare triple {8024#(and (= ULTIMATE.start_main_~j~6 4) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8028#(and (= ULTIMATE.start_main_~j~6 5) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} is VALID [2019-01-07 18:49:01,334 INFO L273 TraceCheckUtils]: 24: Hoare triple {8028#(and (= ULTIMATE.start_main_~j~6 5) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8032#(and (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17) (= ULTIMATE.start_main_~j~6 6))} is VALID [2019-01-07 18:49:01,335 INFO L273 TraceCheckUtils]: 25: Hoare triple {8032#(and (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17) (= ULTIMATE.start_main_~j~6 6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8036#(and (= ULTIMATE.start_main_~j~6 7) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} is VALID [2019-01-07 18:49:01,336 INFO L273 TraceCheckUtils]: 26: Hoare triple {8036#(and (= ULTIMATE.start_main_~j~6 7) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8040#(and (= ULTIMATE.start_main_~j~6 8) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} is VALID [2019-01-07 18:49:01,336 INFO L273 TraceCheckUtils]: 27: Hoare triple {8040#(and (= ULTIMATE.start_main_~j~6 8) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8044#(and (= ULTIMATE.start_main_~j~6 9) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} is VALID [2019-01-07 18:49:01,337 INFO L273 TraceCheckUtils]: 28: Hoare triple {8044#(and (= ULTIMATE.start_main_~j~6 9) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8048#(and (= ULTIMATE.start_main_~j~6 10) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} is VALID [2019-01-07 18:49:01,338 INFO L273 TraceCheckUtils]: 29: Hoare triple {8048#(and (= ULTIMATE.start_main_~j~6 10) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8052#(and (<= 17 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 11) (<= ULTIMATE.start_main_~MAX~6 17))} is VALID [2019-01-07 18:49:01,339 INFO L273 TraceCheckUtils]: 30: Hoare triple {8052#(and (<= 17 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 11) (<= ULTIMATE.start_main_~MAX~6 17))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8056#(and (= ULTIMATE.start_main_~j~6 12) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} is VALID [2019-01-07 18:49:01,340 INFO L273 TraceCheckUtils]: 31: Hoare triple {8056#(and (= ULTIMATE.start_main_~j~6 12) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8060#(and (= ULTIMATE.start_main_~j~6 13) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} is VALID [2019-01-07 18:49:01,341 INFO L273 TraceCheckUtils]: 32: Hoare triple {8060#(and (= ULTIMATE.start_main_~j~6 13) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8064#(and (= ULTIMATE.start_main_~j~6 14) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} is VALID [2019-01-07 18:49:01,342 INFO L273 TraceCheckUtils]: 33: Hoare triple {8064#(and (= ULTIMATE.start_main_~j~6 14) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8068#(and (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17) (= ULTIMATE.start_main_~j~6 15))} is VALID [2019-01-07 18:49:01,343 INFO L273 TraceCheckUtils]: 34: Hoare triple {8068#(and (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17) (= ULTIMATE.start_main_~j~6 15))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8072#(and (= ULTIMATE.start_main_~j~6 16) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} is VALID [2019-01-07 18:49:01,344 INFO L273 TraceCheckUtils]: 35: Hoare triple {8072#(and (= ULTIMATE.start_main_~j~6 16) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8076#(and (= (select ULTIMATE.start_main_~str2~6 16) (select ULTIMATE.start_main_~str1~6 0)) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} is VALID [2019-01-07 18:49:01,345 INFO L273 TraceCheckUtils]: 36: Hoare triple {8076#(and (= (select ULTIMATE.start_main_~str2~6 16) (select ULTIMATE.start_main_~str1~6 0)) (<= 17 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 17))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {7912#false} is VALID [2019-01-07 18:49:01,345 INFO L273 TraceCheckUtils]: 37: Hoare triple {7912#false} assume !false; {7912#false} is VALID [2019-01-07 18:49:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:49:01,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:49:01,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:49:01,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:49:01,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:49:01,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-07 18:49:01,395 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:49:01,396 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) [2019-01-07 18:49:01,396 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6) [2019-01-07 18:49:01,767 INFO L273 TraceCheckUtils]: 37: Hoare triple {7912#false} assume !false; {7912#false} is VALID [2019-01-07 18:49:01,768 INFO L273 TraceCheckUtils]: 36: Hoare triple {7948#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {7912#false} is VALID [2019-01-07 18:49:01,769 INFO L273 TraceCheckUtils]: 35: Hoare triple {7947#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7948#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:49:01,770 INFO L273 TraceCheckUtils]: 34: Hoare triple {7946#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7947#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,771 INFO L273 TraceCheckUtils]: 33: Hoare triple {7945#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7946#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,772 INFO L273 TraceCheckUtils]: 32: Hoare triple {7944#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7945#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,773 INFO L273 TraceCheckUtils]: 31: Hoare triple {7943#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7944#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,774 INFO L273 TraceCheckUtils]: 30: Hoare triple {7942#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7943#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,775 INFO L273 TraceCheckUtils]: 29: Hoare triple {7941#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7942#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,776 INFO L273 TraceCheckUtils]: 28: Hoare triple {7940#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7941#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {7939#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7940#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,778 INFO L273 TraceCheckUtils]: 26: Hoare triple {7938#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7939#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,780 INFO L273 TraceCheckUtils]: 25: Hoare triple {7937#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7938#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,781 INFO L273 TraceCheckUtils]: 24: Hoare triple {7936#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7937#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,782 INFO L273 TraceCheckUtils]: 23: Hoare triple {7935#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7936#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,783 INFO L273 TraceCheckUtils]: 22: Hoare triple {7934#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7935#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,784 INFO L273 TraceCheckUtils]: 21: Hoare triple {7933#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7934#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,785 INFO L273 TraceCheckUtils]: 20: Hoare triple {7932#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7933#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,786 INFO L273 TraceCheckUtils]: 19: Hoare triple {7931#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {7932#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {7930#(or (= 17 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {7931#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:01,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {8000#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7930#(or (= 17 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:01,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {7928#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8000#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} is VALID [2019-01-07 18:49:01,790 INFO L273 TraceCheckUtils]: 15: Hoare triple {7927#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7928#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} is VALID [2019-01-07 18:49:01,792 INFO L273 TraceCheckUtils]: 14: Hoare triple {7926#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7927#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,793 INFO L273 TraceCheckUtils]: 13: Hoare triple {7925#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7926#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {7924#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7925#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,795 INFO L273 TraceCheckUtils]: 11: Hoare triple {7923#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7924#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:49:01,796 INFO L273 TraceCheckUtils]: 10: Hoare triple {7922#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7923#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {7921#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7922#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {7920#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7921#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {7919#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7920#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:49:01,800 INFO L273 TraceCheckUtils]: 6: Hoare triple {7918#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7919#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,801 INFO L273 TraceCheckUtils]: 5: Hoare triple {7917#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7918#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:49:01,802 INFO L273 TraceCheckUtils]: 4: Hoare triple {7916#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7917#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,803 INFO L273 TraceCheckUtils]: 3: Hoare triple {7915#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7916#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:49:01,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {7914#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7915#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,806 INFO L273 TraceCheckUtils]: 1: Hoare triple {7913#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {7914#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,806 INFO L273 TraceCheckUtils]: 0: Hoare triple {7911#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {7913#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:01,810 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:49:01,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:49:01,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2019-01-07 18:49:01,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:49:01,830 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 38 [2019-01-07 18:49:01,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:49:01,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states. [2019-01-07 18:49:01,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:49:01,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-07 18:49:01,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-07 18:49:01,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2019-01-07 18:49:01,893 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 58 states. [2019-01-07 18:49:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:49:08,935 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-07 18:49:08,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-07 18:49:08,935 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 38 [2019-01-07 18:49:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:49:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-07 18:49:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-01-07 18:49:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-07 18:49:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2019-01-07 18:49:08,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 46 transitions. [2019-01-07 18:49:08,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:49:08,993 INFO L225 Difference]: With dead ends: 60 [2019-01-07 18:49:08,993 INFO L226 Difference]: Without dead ends: 40 [2019-01-07 18:49:08,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2019-01-07 18:49:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-07 18:49:09,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-07 18:49:09,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:49:09,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2019-01-07 18:49:09,646 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2019-01-07 18:49:09,646 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2019-01-07 18:49:09,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:49:09,647 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-01-07 18:49:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-07 18:49:09,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:49:09,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:49:09,648 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2019-01-07 18:49:09,648 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2019-01-07 18:49:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:49:09,648 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2019-01-07 18:49:09,649 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-07 18:49:09,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:49:09,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:49:09,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:49:09,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:49:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-07 18:49:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-07 18:49:09,650 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-01-07 18:49:09,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:49:09,650 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-07 18:49:09,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-07 18:49:09,650 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-07 18:49:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-07 18:49:09,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:49:09,651 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1] [2019-01-07 18:49:09,651 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:49:09,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:49:09,651 INFO L82 PathProgramCache]: Analyzing trace with hash 536887468, now seen corresponding path program 26 times [2019-01-07 18:49:09,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:49:09,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:49:09,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:49:09,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:49:09,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:49:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:49:10,184 INFO L273 TraceCheckUtils]: 0: Hoare triple {8508#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {8510#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,185 INFO L273 TraceCheckUtils]: 1: Hoare triple {8510#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8511#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {8511#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8512#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,186 INFO L273 TraceCheckUtils]: 3: Hoare triple {8512#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8513#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,187 INFO L273 TraceCheckUtils]: 4: Hoare triple {8513#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8514#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,188 INFO L273 TraceCheckUtils]: 5: Hoare triple {8514#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8515#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,189 INFO L273 TraceCheckUtils]: 6: Hoare triple {8515#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8516#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,190 INFO L273 TraceCheckUtils]: 7: Hoare triple {8516#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8517#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,191 INFO L273 TraceCheckUtils]: 8: Hoare triple {8517#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8518#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,192 INFO L273 TraceCheckUtils]: 9: Hoare triple {8518#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8519#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,193 INFO L273 TraceCheckUtils]: 10: Hoare triple {8519#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8520#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,194 INFO L273 TraceCheckUtils]: 11: Hoare triple {8520#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8521#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,195 INFO L273 TraceCheckUtils]: 12: Hoare triple {8521#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8522#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,196 INFO L273 TraceCheckUtils]: 13: Hoare triple {8522#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8523#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,197 INFO L273 TraceCheckUtils]: 14: Hoare triple {8523#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8524#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,198 INFO L273 TraceCheckUtils]: 15: Hoare triple {8524#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8525#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,199 INFO L273 TraceCheckUtils]: 16: Hoare triple {8525#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8526#(<= 16 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,200 INFO L273 TraceCheckUtils]: 17: Hoare triple {8526#(<= 16 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8527#(<= 17 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,201 INFO L273 TraceCheckUtils]: 18: Hoare triple {8527#(<= 17 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8528#(<= 18 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:10,202 INFO L273 TraceCheckUtils]: 19: Hoare triple {8528#(<= 18 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {8527#(<= 17 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,203 INFO L273 TraceCheckUtils]: 20: Hoare triple {8527#(<= 17 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8526#(<= 16 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,204 INFO L273 TraceCheckUtils]: 21: Hoare triple {8526#(<= 16 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8525#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,205 INFO L273 TraceCheckUtils]: 22: Hoare triple {8525#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8524#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,206 INFO L273 TraceCheckUtils]: 23: Hoare triple {8524#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8523#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,207 INFO L273 TraceCheckUtils]: 24: Hoare triple {8523#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8522#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,208 INFO L273 TraceCheckUtils]: 25: Hoare triple {8522#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8521#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,209 INFO L273 TraceCheckUtils]: 26: Hoare triple {8521#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8520#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,210 INFO L273 TraceCheckUtils]: 27: Hoare triple {8520#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8519#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,211 INFO L273 TraceCheckUtils]: 28: Hoare triple {8519#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8518#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,212 INFO L273 TraceCheckUtils]: 29: Hoare triple {8518#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8517#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,213 INFO L273 TraceCheckUtils]: 30: Hoare triple {8517#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8516#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,214 INFO L273 TraceCheckUtils]: 31: Hoare triple {8516#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8515#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,215 INFO L273 TraceCheckUtils]: 32: Hoare triple {8515#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8514#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,216 INFO L273 TraceCheckUtils]: 33: Hoare triple {8514#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8513#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,217 INFO L273 TraceCheckUtils]: 34: Hoare triple {8513#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8512#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,218 INFO L273 TraceCheckUtils]: 35: Hoare triple {8512#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8511#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,221 INFO L273 TraceCheckUtils]: 36: Hoare triple {8511#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8510#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,222 INFO L273 TraceCheckUtils]: 37: Hoare triple {8510#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {8509#false} is VALID [2019-01-07 18:49:10,222 INFO L273 TraceCheckUtils]: 38: Hoare triple {8509#false} assume !false; {8509#false} is VALID [2019-01-07 18:49:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:49:10,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:49:10,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:49:10,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:49:10,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:49:10,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:49:10,224 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:49:10,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 18:49:10,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 18:49:10,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-07 18:49:10,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:49:10,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:49:10,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:49:10,637 INFO L273 TraceCheckUtils]: 0: Hoare triple {8508#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {8510#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {8510#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8511#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {8511#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8512#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,640 INFO L273 TraceCheckUtils]: 3: Hoare triple {8512#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8513#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,642 INFO L273 TraceCheckUtils]: 4: Hoare triple {8513#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8514#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {8514#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8515#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {8515#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8516#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,644 INFO L273 TraceCheckUtils]: 7: Hoare triple {8516#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8517#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {8517#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8518#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,646 INFO L273 TraceCheckUtils]: 9: Hoare triple {8518#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8519#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,647 INFO L273 TraceCheckUtils]: 10: Hoare triple {8519#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8520#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,648 INFO L273 TraceCheckUtils]: 11: Hoare triple {8520#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8521#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {8521#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8522#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,650 INFO L273 TraceCheckUtils]: 13: Hoare triple {8522#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8523#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,651 INFO L273 TraceCheckUtils]: 14: Hoare triple {8523#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8524#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,652 INFO L273 TraceCheckUtils]: 15: Hoare triple {8524#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8525#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,653 INFO L273 TraceCheckUtils]: 16: Hoare triple {8525#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8526#(<= 16 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,654 INFO L273 TraceCheckUtils]: 17: Hoare triple {8526#(<= 16 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8527#(<= 17 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,655 INFO L273 TraceCheckUtils]: 18: Hoare triple {8527#(<= 17 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8528#(<= 18 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:10,656 INFO L273 TraceCheckUtils]: 19: Hoare triple {8528#(<= 18 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {8527#(<= 17 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,657 INFO L273 TraceCheckUtils]: 20: Hoare triple {8527#(<= 17 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8526#(<= 16 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,658 INFO L273 TraceCheckUtils]: 21: Hoare triple {8526#(<= 16 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8525#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,659 INFO L273 TraceCheckUtils]: 22: Hoare triple {8525#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8524#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,660 INFO L273 TraceCheckUtils]: 23: Hoare triple {8524#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8523#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,661 INFO L273 TraceCheckUtils]: 24: Hoare triple {8523#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8522#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,662 INFO L273 TraceCheckUtils]: 25: Hoare triple {8522#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8521#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,663 INFO L273 TraceCheckUtils]: 26: Hoare triple {8521#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8520#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,664 INFO L273 TraceCheckUtils]: 27: Hoare triple {8520#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8519#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,664 INFO L273 TraceCheckUtils]: 28: Hoare triple {8519#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8518#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,665 INFO L273 TraceCheckUtils]: 29: Hoare triple {8518#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8517#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,666 INFO L273 TraceCheckUtils]: 30: Hoare triple {8517#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8516#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,667 INFO L273 TraceCheckUtils]: 31: Hoare triple {8516#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8515#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,668 INFO L273 TraceCheckUtils]: 32: Hoare triple {8515#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8514#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,669 INFO L273 TraceCheckUtils]: 33: Hoare triple {8514#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8513#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,670 INFO L273 TraceCheckUtils]: 34: Hoare triple {8513#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8512#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,671 INFO L273 TraceCheckUtils]: 35: Hoare triple {8512#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8511#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,672 INFO L273 TraceCheckUtils]: 36: Hoare triple {8511#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8510#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:10,673 INFO L273 TraceCheckUtils]: 37: Hoare triple {8510#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {8509#false} is VALID [2019-01-07 18:49:10,673 INFO L273 TraceCheckUtils]: 38: Hoare triple {8509#false} assume !false; {8509#false} is VALID [2019-01-07 18:49:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:49:10,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:49:11,216 INFO L273 TraceCheckUtils]: 38: Hoare triple {8509#false} assume !false; {8509#false} is VALID [2019-01-07 18:49:11,217 INFO L273 TraceCheckUtils]: 37: Hoare triple {8510#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {8509#false} is VALID [2019-01-07 18:49:11,218 INFO L273 TraceCheckUtils]: 36: Hoare triple {8511#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8510#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,218 INFO L273 TraceCheckUtils]: 35: Hoare triple {8512#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8511#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,219 INFO L273 TraceCheckUtils]: 34: Hoare triple {8513#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8512#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,220 INFO L273 TraceCheckUtils]: 33: Hoare triple {8514#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8513#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,220 INFO L273 TraceCheckUtils]: 32: Hoare triple {8515#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8514#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,221 INFO L273 TraceCheckUtils]: 31: Hoare triple {8516#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8515#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,222 INFO L273 TraceCheckUtils]: 30: Hoare triple {8517#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8516#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,223 INFO L273 TraceCheckUtils]: 29: Hoare triple {8518#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8517#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,224 INFO L273 TraceCheckUtils]: 28: Hoare triple {8519#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8518#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,225 INFO L273 TraceCheckUtils]: 27: Hoare triple {8520#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8519#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,226 INFO L273 TraceCheckUtils]: 26: Hoare triple {8521#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8520#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,227 INFO L273 TraceCheckUtils]: 25: Hoare triple {8522#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8521#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,228 INFO L273 TraceCheckUtils]: 24: Hoare triple {8523#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8522#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {8524#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8523#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,230 INFO L273 TraceCheckUtils]: 22: Hoare triple {8525#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8524#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {8526#(<= 16 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8525#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,232 INFO L273 TraceCheckUtils]: 20: Hoare triple {8527#(<= 17 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {8526#(<= 16 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,233 INFO L273 TraceCheckUtils]: 19: Hoare triple {8528#(<= 18 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {8527#(<= 17 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,234 INFO L273 TraceCheckUtils]: 18: Hoare triple {8527#(<= 17 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8528#(<= 18 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:11,235 INFO L273 TraceCheckUtils]: 17: Hoare triple {8526#(<= 16 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8527#(<= 17 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {8525#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8526#(<= 16 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,237 INFO L273 TraceCheckUtils]: 15: Hoare triple {8524#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8525#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,238 INFO L273 TraceCheckUtils]: 14: Hoare triple {8523#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8524#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,239 INFO L273 TraceCheckUtils]: 13: Hoare triple {8522#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8523#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {8521#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8522#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {8520#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8521#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {8519#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8520#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,243 INFO L273 TraceCheckUtils]: 9: Hoare triple {8518#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8519#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,244 INFO L273 TraceCheckUtils]: 8: Hoare triple {8517#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8518#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,245 INFO L273 TraceCheckUtils]: 7: Hoare triple {8516#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8517#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {8515#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8516#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {8514#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8515#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,247 INFO L273 TraceCheckUtils]: 4: Hoare triple {8513#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8514#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,249 INFO L273 TraceCheckUtils]: 3: Hoare triple {8512#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8513#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,250 INFO L273 TraceCheckUtils]: 2: Hoare triple {8511#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8512#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {8510#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {8511#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,251 INFO L273 TraceCheckUtils]: 0: Hoare triple {8508#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {8510#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:11,254 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:49:11,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:49:11,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2019-01-07 18:49:11,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:49:11,276 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-01-07 18:49:11,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:49:11,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2019-01-07 18:49:11,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:49:11,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-07 18:49:11,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-07 18:49:11,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-01-07 18:49:11,326 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 21 states. [2019-01-07 18:49:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:49:12,531 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-07 18:49:12,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-07 18:49:12,531 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-01-07 18:49:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:49:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-07 18:49:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-01-07 18:49:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-07 18:49:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-01-07 18:49:12,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 44 transitions. [2019-01-07 18:49:12,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:49:12,578 INFO L225 Difference]: With dead ends: 43 [2019-01-07 18:49:12,578 INFO L226 Difference]: Without dead ends: 41 [2019-01-07 18:49:12,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 36 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-01-07 18:49:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-07 18:49:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-07 18:49:13,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:49:13,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2019-01-07 18:49:13,384 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2019-01-07 18:49:13,384 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2019-01-07 18:49:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:49:13,385 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-01-07 18:49:13,385 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-07 18:49:13,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:49:13,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:49:13,386 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2019-01-07 18:49:13,386 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2019-01-07 18:49:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:49:13,387 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-01-07 18:49:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-07 18:49:13,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:49:13,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:49:13,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:49:13,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:49:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-07 18:49:13,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-07 18:49:13,388 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2019-01-07 18:49:13,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:49:13,388 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-07 18:49:13,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-07 18:49:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-07 18:49:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-07 18:49:13,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:49:13,389 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-07 18:49:13,389 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:49:13,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:49:13,389 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 27 times [2019-01-07 18:49:13,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:49:13,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:49:13,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:49:13,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:49:13,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:49:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:49:15,016 INFO L273 TraceCheckUtils]: 0: Hoare triple {9040#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {9042#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:15,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {9042#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9043#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:15,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {9043#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9044#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:15,019 INFO L273 TraceCheckUtils]: 3: Hoare triple {9044#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9045#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:49:15,020 INFO L273 TraceCheckUtils]: 4: Hoare triple {9045#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9046#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:15,021 INFO L273 TraceCheckUtils]: 5: Hoare triple {9046#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9047#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:49:15,023 INFO L273 TraceCheckUtils]: 6: Hoare triple {9047#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9048#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:15,024 INFO L273 TraceCheckUtils]: 7: Hoare triple {9048#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9049#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:49:15,025 INFO L273 TraceCheckUtils]: 8: Hoare triple {9049#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9050#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:15,026 INFO L273 TraceCheckUtils]: 9: Hoare triple {9050#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9051#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:15,027 INFO L273 TraceCheckUtils]: 10: Hoare triple {9051#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9052#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:15,028 INFO L273 TraceCheckUtils]: 11: Hoare triple {9052#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9053#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:49:15,029 INFO L273 TraceCheckUtils]: 12: Hoare triple {9053#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9054#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:15,030 INFO L273 TraceCheckUtils]: 13: Hoare triple {9054#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9055#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:15,031 INFO L273 TraceCheckUtils]: 14: Hoare triple {9055#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9056#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:15,032 INFO L273 TraceCheckUtils]: 15: Hoare triple {9056#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9057#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} is VALID [2019-01-07 18:49:15,033 INFO L273 TraceCheckUtils]: 16: Hoare triple {9057#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9058#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} is VALID [2019-01-07 18:49:15,034 INFO L273 TraceCheckUtils]: 17: Hoare triple {9058#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9059#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6)))} is VALID [2019-01-07 18:49:15,036 INFO L273 TraceCheckUtils]: 18: Hoare triple {9059#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9060#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 18 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:15,037 INFO L273 TraceCheckUtils]: 19: Hoare triple {9060#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 18 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {9061#(= (+ ULTIMATE.start_main_~j~6 18) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,038 INFO L273 TraceCheckUtils]: 20: Hoare triple {9061#(= (+ ULTIMATE.start_main_~j~6 18) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9062#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,039 INFO L273 TraceCheckUtils]: 21: Hoare triple {9062#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9063#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,040 INFO L273 TraceCheckUtils]: 22: Hoare triple {9063#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9064#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,042 INFO L273 TraceCheckUtils]: 23: Hoare triple {9064#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9065#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,043 INFO L273 TraceCheckUtils]: 24: Hoare triple {9065#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9066#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,044 INFO L273 TraceCheckUtils]: 25: Hoare triple {9066#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9067#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,045 INFO L273 TraceCheckUtils]: 26: Hoare triple {9067#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9068#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,046 INFO L273 TraceCheckUtils]: 27: Hoare triple {9068#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9069#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,047 INFO L273 TraceCheckUtils]: 28: Hoare triple {9069#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9070#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,048 INFO L273 TraceCheckUtils]: 29: Hoare triple {9070#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9071#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,049 INFO L273 TraceCheckUtils]: 30: Hoare triple {9071#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9072#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,050 INFO L273 TraceCheckUtils]: 31: Hoare triple {9072#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9073#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,051 INFO L273 TraceCheckUtils]: 32: Hoare triple {9073#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9074#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,052 INFO L273 TraceCheckUtils]: 33: Hoare triple {9074#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9075#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,053 INFO L273 TraceCheckUtils]: 34: Hoare triple {9075#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9076#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,054 INFO L273 TraceCheckUtils]: 35: Hoare triple {9076#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9077#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,055 INFO L273 TraceCheckUtils]: 36: Hoare triple {9077#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9078#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:15,056 INFO L273 TraceCheckUtils]: 37: Hoare triple {9078#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9079#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:49:15,058 INFO L273 TraceCheckUtils]: 38: Hoare triple {9079#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {9041#false} is VALID [2019-01-07 18:49:15,058 INFO L273 TraceCheckUtils]: 39: Hoare triple {9041#false} assume !false; {9041#false} is VALID [2019-01-07 18:49:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:49:15,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:49:15,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:49:15,062 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:49:15,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:49:15,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:49:15,063 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:49:15,073 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 18:49:15,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 18:49:15,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 18:49:15,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:49:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:49:15,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:49:16,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:49:16,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:49:16,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:49:16,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-07 18:49:16,475 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:49:16,476 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_258]. (and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 19)) (= ULTIMATE.start_main_~str2~6 (store v_ULTIMATE.start_main_~str2~6_258 17 (select ULTIMATE.start_main_~str1~6 0))) (<= 18 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:49:16,476 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 19)) (= (select ULTIMATE.start_main_~str2~6 17) (select ULTIMATE.start_main_~str1~6 0)) (<= 18 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:49:16,550 INFO L273 TraceCheckUtils]: 0: Hoare triple {9040#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {9040#true} is VALID [2019-01-07 18:49:16,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,551 INFO L273 TraceCheckUtils]: 3: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,551 INFO L273 TraceCheckUtils]: 4: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,551 INFO L273 TraceCheckUtils]: 5: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,552 INFO L273 TraceCheckUtils]: 6: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,552 INFO L273 TraceCheckUtils]: 7: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,552 INFO L273 TraceCheckUtils]: 8: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,552 INFO L273 TraceCheckUtils]: 9: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,552 INFO L273 TraceCheckUtils]: 10: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,553 INFO L273 TraceCheckUtils]: 11: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,553 INFO L273 TraceCheckUtils]: 12: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,553 INFO L273 TraceCheckUtils]: 14: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:16,554 INFO L273 TraceCheckUtils]: 19: Hoare triple {9040#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {9140#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:16,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {9140#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9144#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} is VALID [2019-01-07 18:49:16,556 INFO L273 TraceCheckUtils]: 21: Hoare triple {9144#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9148#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:49:16,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {9148#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9152#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} is VALID [2019-01-07 18:49:16,557 INFO L273 TraceCheckUtils]: 23: Hoare triple {9152#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9156#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} is VALID [2019-01-07 18:49:16,558 INFO L273 TraceCheckUtils]: 24: Hoare triple {9156#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9160#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:16,558 INFO L273 TraceCheckUtils]: 25: Hoare triple {9160#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9164#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)) (= ULTIMATE.start_main_~j~6 6))} is VALID [2019-01-07 18:49:16,559 INFO L273 TraceCheckUtils]: 26: Hoare triple {9164#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)) (= ULTIMATE.start_main_~j~6 6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9168#(and (= ULTIMATE.start_main_~j~6 7) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 8)))} is VALID [2019-01-07 18:49:16,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {9168#(and (= ULTIMATE.start_main_~j~6 7) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 8)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9172#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9)) (= ULTIMATE.start_main_~j~6 8))} is VALID [2019-01-07 18:49:16,561 INFO L273 TraceCheckUtils]: 28: Hoare triple {9172#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9)) (= ULTIMATE.start_main_~j~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9176#(and (= ULTIMATE.start_main_~j~6 9) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 10)))} is VALID [2019-01-07 18:49:16,562 INFO L273 TraceCheckUtils]: 29: Hoare triple {9176#(and (= ULTIMATE.start_main_~j~6 9) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 10)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9180#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 11)) (= ULTIMATE.start_main_~j~6 10))} is VALID [2019-01-07 18:49:16,563 INFO L273 TraceCheckUtils]: 30: Hoare triple {9180#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 11)) (= ULTIMATE.start_main_~j~6 10))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9184#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 12)) (= ULTIMATE.start_main_~j~6 11))} is VALID [2019-01-07 18:49:16,565 INFO L273 TraceCheckUtils]: 31: Hoare triple {9184#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 12)) (= ULTIMATE.start_main_~j~6 11))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9188#(and (= ULTIMATE.start_main_~j~6 12) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 13)))} is VALID [2019-01-07 18:49:16,566 INFO L273 TraceCheckUtils]: 32: Hoare triple {9188#(and (= ULTIMATE.start_main_~j~6 12) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 13)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9192#(and (= ULTIMATE.start_main_~j~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 14)))} is VALID [2019-01-07 18:49:16,567 INFO L273 TraceCheckUtils]: 33: Hoare triple {9192#(and (= ULTIMATE.start_main_~j~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 14)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9196#(and (= ULTIMATE.start_main_~j~6 14) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 15)))} is VALID [2019-01-07 18:49:16,568 INFO L273 TraceCheckUtils]: 34: Hoare triple {9196#(and (= ULTIMATE.start_main_~j~6 14) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 15)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9200#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 16)) (= ULTIMATE.start_main_~j~6 15))} is VALID [2019-01-07 18:49:16,569 INFO L273 TraceCheckUtils]: 35: Hoare triple {9200#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 16)) (= ULTIMATE.start_main_~j~6 15))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9204#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 17)) (= ULTIMATE.start_main_~j~6 16))} is VALID [2019-01-07 18:49:16,570 INFO L273 TraceCheckUtils]: 36: Hoare triple {9204#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 17)) (= ULTIMATE.start_main_~j~6 16))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9208#(and (= ULTIMATE.start_main_~j~6 17) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 18)))} is VALID [2019-01-07 18:49:16,572 INFO L273 TraceCheckUtils]: 37: Hoare triple {9208#(and (= ULTIMATE.start_main_~j~6 17) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 18)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9212#(and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 19)) (= (select ULTIMATE.start_main_~str2~6 17) (select ULTIMATE.start_main_~str1~6 0)) (<= 18 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:16,573 INFO L273 TraceCheckUtils]: 38: Hoare triple {9212#(and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 19)) (= (select ULTIMATE.start_main_~str2~6 17) (select ULTIMATE.start_main_~str1~6 0)) (<= 18 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {9041#false} is VALID [2019-01-07 18:49:16,573 INFO L273 TraceCheckUtils]: 39: Hoare triple {9041#false} assume !false; {9041#false} is VALID [2019-01-07 18:49:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-07 18:49:16,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:49:16,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:49:16,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:49:16,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:49:16,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-07 18:49:16,717 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:49:16,718 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (or (not (<= 0 ULTIMATE.start_main_~i~6)) (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) (< 0 ULTIMATE.start_main_~i~6)) [2019-01-07 18:49:16,718 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:49:18,091 INFO L273 TraceCheckUtils]: 39: Hoare triple {9041#false} assume !false; {9041#false} is VALID [2019-01-07 18:49:18,093 INFO L273 TraceCheckUtils]: 38: Hoare triple {9222#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {9041#false} is VALID [2019-01-07 18:49:18,094 INFO L273 TraceCheckUtils]: 37: Hoare triple {9226#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9222#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:18,096 INFO L273 TraceCheckUtils]: 36: Hoare triple {9230#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9226#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:18,097 INFO L273 TraceCheckUtils]: 35: Hoare triple {9234#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9230#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} is VALID [2019-01-07 18:49:18,098 INFO L273 TraceCheckUtils]: 34: Hoare triple {9238#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9234#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:18,099 INFO L273 TraceCheckUtils]: 33: Hoare triple {9242#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9238#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:18,101 INFO L273 TraceCheckUtils]: 32: Hoare triple {9246#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9242#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} is VALID [2019-01-07 18:49:18,102 INFO L273 TraceCheckUtils]: 31: Hoare triple {9250#(or (< ULTIMATE.start_main_~i~6 6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 7)) (< 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9246#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:18,103 INFO L273 TraceCheckUtils]: 30: Hoare triple {9254#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 8)) (< ULTIMATE.start_main_~i~6 7) (< 7 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9250#(or (< ULTIMATE.start_main_~i~6 6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 7)) (< 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:18,104 INFO L273 TraceCheckUtils]: 29: Hoare triple {9258#(or (< 8 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 9)) (< ULTIMATE.start_main_~i~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9254#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 8)) (< ULTIMATE.start_main_~i~6 7) (< 7 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:18,106 INFO L273 TraceCheckUtils]: 28: Hoare triple {9262#(or (< ULTIMATE.start_main_~i~6 9) (= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6) (< 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9258#(or (< 8 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 9)) (< ULTIMATE.start_main_~i~6 8))} is VALID [2019-01-07 18:49:18,107 INFO L273 TraceCheckUtils]: 27: Hoare triple {9266#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 11)) (< 10 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 10))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9262#(or (< ULTIMATE.start_main_~i~6 9) (= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6) (< 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:18,108 INFO L273 TraceCheckUtils]: 26: Hoare triple {9270#(or (< ULTIMATE.start_main_~i~6 11) (= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6) (< 11 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9266#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 11)) (< 10 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 10))} is VALID [2019-01-07 18:49:18,109 INFO L273 TraceCheckUtils]: 25: Hoare triple {9274#(or (< 12 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 13)) (< ULTIMATE.start_main_~i~6 12))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9270#(or (< ULTIMATE.start_main_~i~6 11) (= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6) (< 11 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:18,111 INFO L273 TraceCheckUtils]: 24: Hoare triple {9278#(or (< ULTIMATE.start_main_~i~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 14)) (< 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9274#(or (< 12 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 13)) (< ULTIMATE.start_main_~i~6 12))} is VALID [2019-01-07 18:49:18,112 INFO L273 TraceCheckUtils]: 23: Hoare triple {9282#(or (< 14 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 15)) (< ULTIMATE.start_main_~i~6 14))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9278#(or (< ULTIMATE.start_main_~i~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 14)) (< 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:18,113 INFO L273 TraceCheckUtils]: 22: Hoare triple {9286#(or (< 15 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 15) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 16)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9282#(or (< 14 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 15)) (< ULTIMATE.start_main_~i~6 14))} is VALID [2019-01-07 18:49:18,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {9290#(or (< ULTIMATE.start_main_~i~6 16) (< 16 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 17)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9286#(or (< 15 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 15) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 16)))} is VALID [2019-01-07 18:49:18,116 INFO L273 TraceCheckUtils]: 20: Hoare triple {9294#(or (< ULTIMATE.start_main_~i~6 17) (< 17 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 18)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9290#(or (< ULTIMATE.start_main_~i~6 16) (< 16 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 17)))} is VALID [2019-01-07 18:49:18,117 INFO L273 TraceCheckUtils]: 19: Hoare triple {9040#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {9294#(or (< ULTIMATE.start_main_~i~6 17) (< 17 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 18)))} is VALID [2019-01-07 18:49:18,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,118 INFO L273 TraceCheckUtils]: 17: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,118 INFO L273 TraceCheckUtils]: 16: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,118 INFO L273 TraceCheckUtils]: 14: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,118 INFO L273 TraceCheckUtils]: 13: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,119 INFO L273 TraceCheckUtils]: 12: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,119 INFO L273 TraceCheckUtils]: 11: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,119 INFO L273 TraceCheckUtils]: 10: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,119 INFO L273 TraceCheckUtils]: 9: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,120 INFO L273 TraceCheckUtils]: 5: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,120 INFO L273 TraceCheckUtils]: 4: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,120 INFO L273 TraceCheckUtils]: 3: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,120 INFO L273 TraceCheckUtils]: 2: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {9040#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9040#true} is VALID [2019-01-07 18:49:18,120 INFO L273 TraceCheckUtils]: 0: Hoare triple {9040#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {9040#true} is VALID [2019-01-07 18:49:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-07 18:49:18,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:49:18,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 21, 21] total 78 [2019-01-07 18:49:18,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:49:18,143 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 40 [2019-01-07 18:49:18,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:49:18,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 59 states. [2019-01-07 18:49:18,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:49:18,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-07 18:49:18,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-07 18:49:18,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=5168, Unknown=0, NotChecked=0, Total=6006 [2019-01-07 18:49:18,210 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 59 states. [2019-01-07 18:49:27,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:49:27,533 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-01-07 18:49:27,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-07 18:49:27,533 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 40 [2019-01-07 18:49:27,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:49:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-07 18:49:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2019-01-07 18:49:27,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-07 18:49:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2019-01-07 18:49:27,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 69 transitions. [2019-01-07 18:49:27,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:49:27,633 INFO L225 Difference]: With dead ends: 65 [2019-01-07 18:49:27,633 INFO L226 Difference]: Without dead ends: 43 [2019-01-07 18:49:27,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1393, Invalid=8707, Unknown=0, NotChecked=0, Total=10100 [2019-01-07 18:49:27,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-07 18:49:28,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-07 18:49:28,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:49:28,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2019-01-07 18:49:28,388 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2019-01-07 18:49:28,388 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2019-01-07 18:49:28,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:49:28,389 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-07 18:49:28,389 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-07 18:49:28,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:49:28,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:49:28,390 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2019-01-07 18:49:28,390 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2019-01-07 18:49:28,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:49:28,391 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-07 18:49:28,391 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-07 18:49:28,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:49:28,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:49:28,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:49:28,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:49:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-07 18:49:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-07 18:49:28,392 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-07 18:49:28,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:49:28,392 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-07 18:49:28,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-07 18:49:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-07 18:49:28,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-07 18:49:28,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:49:28,393 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-07 18:49:28,393 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:49:28,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:49:28,394 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 28 times [2019-01-07 18:49:28,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:49:28,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:49:28,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:49:28,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:49:28,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:49:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:49:30,040 INFO L273 TraceCheckUtils]: 0: Hoare triple {9697#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {9699#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:30,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {9699#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9700#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:30,042 INFO L273 TraceCheckUtils]: 2: Hoare triple {9700#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9701#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:30,044 INFO L273 TraceCheckUtils]: 3: Hoare triple {9701#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9702#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:49:30,045 INFO L273 TraceCheckUtils]: 4: Hoare triple {9702#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9703#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:30,046 INFO L273 TraceCheckUtils]: 5: Hoare triple {9703#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9704#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:49:30,061 INFO L273 TraceCheckUtils]: 6: Hoare triple {9704#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9705#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:30,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {9705#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9706#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:49:30,063 INFO L273 TraceCheckUtils]: 8: Hoare triple {9706#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9707#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:30,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {9707#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9708#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:30,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {9708#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9709#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:30,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {9709#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9710#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:49:30,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {9710#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9711#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:30,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {9711#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9712#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:30,069 INFO L273 TraceCheckUtils]: 14: Hoare triple {9712#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9713#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:30,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {9713#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9714#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} is VALID [2019-01-07 18:49:30,071 INFO L273 TraceCheckUtils]: 16: Hoare triple {9714#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9715#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} is VALID [2019-01-07 18:49:30,072 INFO L273 TraceCheckUtils]: 17: Hoare triple {9715#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9716#(and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:30,074 INFO L273 TraceCheckUtils]: 18: Hoare triple {9716#(and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9717#(or (and (<= ULTIMATE.start_main_~i~6 18) (<= 18 ULTIMATE.start_main_~i~6)) (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))))} is VALID [2019-01-07 18:49:30,075 INFO L273 TraceCheckUtils]: 19: Hoare triple {9717#(or (and (<= ULTIMATE.start_main_~i~6 18) (<= 18 ULTIMATE.start_main_~i~6)) (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9718#(or (= 19 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:30,076 INFO L273 TraceCheckUtils]: 20: Hoare triple {9718#(or (= 19 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {9719#(= (+ ULTIMATE.start_main_~j~6 19) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,077 INFO L273 TraceCheckUtils]: 21: Hoare triple {9719#(= (+ ULTIMATE.start_main_~j~6 19) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9720#(= (+ ULTIMATE.start_main_~j~6 18) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,079 INFO L273 TraceCheckUtils]: 22: Hoare triple {9720#(= (+ ULTIMATE.start_main_~j~6 18) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9721#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,080 INFO L273 TraceCheckUtils]: 23: Hoare triple {9721#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9722#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,081 INFO L273 TraceCheckUtils]: 24: Hoare triple {9722#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9723#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,082 INFO L273 TraceCheckUtils]: 25: Hoare triple {9723#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9724#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,083 INFO L273 TraceCheckUtils]: 26: Hoare triple {9724#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9725#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,084 INFO L273 TraceCheckUtils]: 27: Hoare triple {9725#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9726#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,085 INFO L273 TraceCheckUtils]: 28: Hoare triple {9726#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9727#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,086 INFO L273 TraceCheckUtils]: 29: Hoare triple {9727#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9728#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,087 INFO L273 TraceCheckUtils]: 30: Hoare triple {9728#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9729#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,089 INFO L273 TraceCheckUtils]: 31: Hoare triple {9729#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9730#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,090 INFO L273 TraceCheckUtils]: 32: Hoare triple {9730#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9731#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,091 INFO L273 TraceCheckUtils]: 33: Hoare triple {9731#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9732#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,092 INFO L273 TraceCheckUtils]: 34: Hoare triple {9732#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9733#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,093 INFO L273 TraceCheckUtils]: 35: Hoare triple {9733#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9734#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,094 INFO L273 TraceCheckUtils]: 36: Hoare triple {9734#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9735#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,095 INFO L273 TraceCheckUtils]: 37: Hoare triple {9735#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9736#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,096 INFO L273 TraceCheckUtils]: 38: Hoare triple {9736#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9737#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:30,097 INFO L273 TraceCheckUtils]: 39: Hoare triple {9737#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9738#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:49:30,099 INFO L273 TraceCheckUtils]: 40: Hoare triple {9738#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {9698#false} is VALID [2019-01-07 18:49:30,099 INFO L273 TraceCheckUtils]: 41: Hoare triple {9698#false} assume !false; {9698#false} is VALID [2019-01-07 18:49:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:49:30,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:49:30,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:49:30,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:49:30,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:49:30,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:49:30,103 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:49:30,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:49:30,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:49:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:49:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:49:30,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:49:31,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:49:31,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:49:31,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:49:31,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-07 18:49:31,772 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:49:31,772 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_277]. (and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= (store v_ULTIMATE.start_main_~str2~6_277 18 (select ULTIMATE.start_main_~str1~6 0)) ULTIMATE.start_main_~str2~6)) [2019-01-07 18:49:31,772 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= ULTIMATE.start_main_~MAX~6 19) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 18)) (<= 19 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:49:31,863 INFO L273 TraceCheckUtils]: 0: Hoare triple {9697#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {9699#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:31,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {9699#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9700#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:31,865 INFO L273 TraceCheckUtils]: 2: Hoare triple {9700#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9701#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:31,866 INFO L273 TraceCheckUtils]: 3: Hoare triple {9701#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9702#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:49:31,866 INFO L273 TraceCheckUtils]: 4: Hoare triple {9702#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9703#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:31,867 INFO L273 TraceCheckUtils]: 5: Hoare triple {9703#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9704#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:49:31,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {9704#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9705#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:31,869 INFO L273 TraceCheckUtils]: 7: Hoare triple {9705#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9706#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:49:31,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {9706#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9707#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:31,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {9707#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9708#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:31,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {9708#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9709#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:31,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {9709#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9710#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:49:31,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {9710#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9711#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:31,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {9711#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9712#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:31,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {9712#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9713#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:31,878 INFO L273 TraceCheckUtils]: 15: Hoare triple {9713#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9714#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} is VALID [2019-01-07 18:49:31,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {9714#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9715#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} is VALID [2019-01-07 18:49:31,880 INFO L273 TraceCheckUtils]: 17: Hoare triple {9715#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9716#(and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:31,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {9716#(and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9796#(and (<= ULTIMATE.start_main_~i~6 18) (<= 18 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:31,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {9796#(and (<= ULTIMATE.start_main_~i~6 18) (<= 18 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9800#(and (<= ULTIMATE.start_main_~i~6 19) (<= 19 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:31,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {9800#(and (<= ULTIMATE.start_main_~i~6 19) (<= 19 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {9804#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 0))} is VALID [2019-01-07 18:49:31,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {9804#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 0))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9808#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 1))} is VALID [2019-01-07 18:49:31,886 INFO L273 TraceCheckUtils]: 22: Hoare triple {9808#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 1))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9812#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:49:31,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {9812#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9816#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 3))} is VALID [2019-01-07 18:49:31,888 INFO L273 TraceCheckUtils]: 24: Hoare triple {9816#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 3))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9820#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 4))} is VALID [2019-01-07 18:49:31,888 INFO L273 TraceCheckUtils]: 25: Hoare triple {9820#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 4))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9824#(and (<= ULTIMATE.start_main_~MAX~6 19) (= ULTIMATE.start_main_~j~6 5) (<= 19 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:31,889 INFO L273 TraceCheckUtils]: 26: Hoare triple {9824#(and (<= ULTIMATE.start_main_~MAX~6 19) (= ULTIMATE.start_main_~j~6 5) (<= 19 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9828#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 6))} is VALID [2019-01-07 18:49:31,890 INFO L273 TraceCheckUtils]: 27: Hoare triple {9828#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9832#(and (<= ULTIMATE.start_main_~MAX~6 19) (= ULTIMATE.start_main_~j~6 7) (<= 19 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:31,891 INFO L273 TraceCheckUtils]: 28: Hoare triple {9832#(and (<= ULTIMATE.start_main_~MAX~6 19) (= ULTIMATE.start_main_~j~6 7) (<= 19 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9836#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 8))} is VALID [2019-01-07 18:49:31,892 INFO L273 TraceCheckUtils]: 29: Hoare triple {9836#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9840#(and (<= ULTIMATE.start_main_~MAX~6 19) (= ULTIMATE.start_main_~j~6 9) (<= 19 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:31,893 INFO L273 TraceCheckUtils]: 30: Hoare triple {9840#(and (<= ULTIMATE.start_main_~MAX~6 19) (= ULTIMATE.start_main_~j~6 9) (<= 19 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9844#(and (<= ULTIMATE.start_main_~MAX~6 19) (= ULTIMATE.start_main_~j~6 10) (<= 19 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:31,894 INFO L273 TraceCheckUtils]: 31: Hoare triple {9844#(and (<= ULTIMATE.start_main_~MAX~6 19) (= ULTIMATE.start_main_~j~6 10) (<= 19 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9848#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 11))} is VALID [2019-01-07 18:49:31,895 INFO L273 TraceCheckUtils]: 32: Hoare triple {9848#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 11))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9852#(and (<= ULTIMATE.start_main_~MAX~6 19) (= ULTIMATE.start_main_~j~6 12) (<= 19 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:31,896 INFO L273 TraceCheckUtils]: 33: Hoare triple {9852#(and (<= ULTIMATE.start_main_~MAX~6 19) (= ULTIMATE.start_main_~j~6 12) (<= 19 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9856#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 13))} is VALID [2019-01-07 18:49:31,896 INFO L273 TraceCheckUtils]: 34: Hoare triple {9856#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 13))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9860#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 14))} is VALID [2019-01-07 18:49:31,897 INFO L273 TraceCheckUtils]: 35: Hoare triple {9860#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 14))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9864#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 15))} is VALID [2019-01-07 18:49:31,898 INFO L273 TraceCheckUtils]: 36: Hoare triple {9864#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 15))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9868#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 16))} is VALID [2019-01-07 18:49:31,899 INFO L273 TraceCheckUtils]: 37: Hoare triple {9868#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 16))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9872#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 17))} is VALID [2019-01-07 18:49:31,900 INFO L273 TraceCheckUtils]: 38: Hoare triple {9872#(and (<= ULTIMATE.start_main_~MAX~6 19) (<= 19 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 17))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9876#(and (<= ULTIMATE.start_main_~MAX~6 19) (= ULTIMATE.start_main_~j~6 18) (<= 19 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:31,901 INFO L273 TraceCheckUtils]: 39: Hoare triple {9876#(and (<= ULTIMATE.start_main_~MAX~6 19) (= ULTIMATE.start_main_~j~6 18) (<= 19 ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9880#(and (<= ULTIMATE.start_main_~MAX~6 19) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 18)) (<= 19 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:31,902 INFO L273 TraceCheckUtils]: 40: Hoare triple {9880#(and (<= ULTIMATE.start_main_~MAX~6 19) (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 18)) (<= 19 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {9698#false} is VALID [2019-01-07 18:49:31,903 INFO L273 TraceCheckUtils]: 41: Hoare triple {9698#false} assume !false; {9698#false} is VALID [2019-01-07 18:49:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:49:31,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:49:31,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:49:31,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:49:31,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:49:31,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-07 18:49:31,959 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:49:31,959 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) [2019-01-07 18:49:31,960 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6) [2019-01-07 18:49:32,442 INFO L273 TraceCheckUtils]: 41: Hoare triple {9698#false} assume !false; {9698#false} is VALID [2019-01-07 18:49:32,443 INFO L273 TraceCheckUtils]: 40: Hoare triple {9738#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {9698#false} is VALID [2019-01-07 18:49:32,444 INFO L273 TraceCheckUtils]: 39: Hoare triple {9737#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9738#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:49:32,454 INFO L273 TraceCheckUtils]: 38: Hoare triple {9736#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9737#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,455 INFO L273 TraceCheckUtils]: 37: Hoare triple {9735#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9736#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,456 INFO L273 TraceCheckUtils]: 36: Hoare triple {9734#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9735#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,457 INFO L273 TraceCheckUtils]: 35: Hoare triple {9733#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9734#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,458 INFO L273 TraceCheckUtils]: 34: Hoare triple {9732#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9733#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,459 INFO L273 TraceCheckUtils]: 33: Hoare triple {9731#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9732#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,460 INFO L273 TraceCheckUtils]: 32: Hoare triple {9730#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9731#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,461 INFO L273 TraceCheckUtils]: 31: Hoare triple {9729#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9730#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,462 INFO L273 TraceCheckUtils]: 30: Hoare triple {9728#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9729#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,463 INFO L273 TraceCheckUtils]: 29: Hoare triple {9727#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9728#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,464 INFO L273 TraceCheckUtils]: 28: Hoare triple {9726#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9727#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,465 INFO L273 TraceCheckUtils]: 27: Hoare triple {9725#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9726#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,467 INFO L273 TraceCheckUtils]: 26: Hoare triple {9724#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9725#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,468 INFO L273 TraceCheckUtils]: 25: Hoare triple {9723#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9724#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,469 INFO L273 TraceCheckUtils]: 24: Hoare triple {9722#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9723#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,470 INFO L273 TraceCheckUtils]: 23: Hoare triple {9721#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9722#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,471 INFO L273 TraceCheckUtils]: 22: Hoare triple {9720#(= (+ ULTIMATE.start_main_~j~6 18) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9721#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,472 INFO L273 TraceCheckUtils]: 21: Hoare triple {9719#(= (+ ULTIMATE.start_main_~j~6 19) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {9720#(= (+ ULTIMATE.start_main_~j~6 18) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,473 INFO L273 TraceCheckUtils]: 20: Hoare triple {9718#(or (= 19 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {9719#(= (+ ULTIMATE.start_main_~j~6 19) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:32,475 INFO L273 TraceCheckUtils]: 19: Hoare triple {9796#(and (<= ULTIMATE.start_main_~i~6 18) (<= 18 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9718#(or (= 19 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:32,476 INFO L273 TraceCheckUtils]: 18: Hoare triple {9716#(and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9796#(and (<= ULTIMATE.start_main_~i~6 18) (<= 18 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:32,477 INFO L273 TraceCheckUtils]: 17: Hoare triple {9715#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9716#(and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:32,478 INFO L273 TraceCheckUtils]: 16: Hoare triple {9714#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9715#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} is VALID [2019-01-07 18:49:32,479 INFO L273 TraceCheckUtils]: 15: Hoare triple {9713#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9714#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} is VALID [2019-01-07 18:49:32,480 INFO L273 TraceCheckUtils]: 14: Hoare triple {9712#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9713#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:32,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {9711#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9712#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:32,482 INFO L273 TraceCheckUtils]: 12: Hoare triple {9710#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9711#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:32,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {9709#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9710#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:49:32,484 INFO L273 TraceCheckUtils]: 10: Hoare triple {9708#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9709#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:32,485 INFO L273 TraceCheckUtils]: 9: Hoare triple {9707#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9708#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:32,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {9706#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9707#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:32,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {9705#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9706#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:49:32,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {9704#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9705#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:32,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {9703#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9704#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:49:32,491 INFO L273 TraceCheckUtils]: 4: Hoare triple {9702#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9703#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:32,492 INFO L273 TraceCheckUtils]: 3: Hoare triple {9701#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9702#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:49:32,493 INFO L273 TraceCheckUtils]: 2: Hoare triple {9700#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9701#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:32,494 INFO L273 TraceCheckUtils]: 1: Hoare triple {9699#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {9700#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:32,495 INFO L273 TraceCheckUtils]: 0: Hoare triple {9697#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {9699#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:49:32,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:49:32,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2019-01-07 18:49:32,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:49:32,519 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 42 [2019-01-07 18:49:32,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:49:32,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 64 states. [2019-01-07 18:49:32,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:49:32,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-07 18:49:32,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-07 18:49:32,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3845, Unknown=0, NotChecked=0, Total=4032 [2019-01-07 18:49:32,589 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 64 states. [2019-01-07 18:49:41,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:49:41,357 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-01-07 18:49:41,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-07 18:49:41,358 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 42 [2019-01-07 18:49:41,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:49:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-07 18:49:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-01-07 18:49:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-07 18:49:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2019-01-07 18:49:41,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 50 transitions. [2019-01-07 18:49:41,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:49:41,487 INFO L225 Difference]: With dead ends: 66 [2019-01-07 18:49:41,488 INFO L226 Difference]: Without dead ends: 44 [2019-01-07 18:49:41,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 47 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=396, Invalid=6914, Unknown=0, NotChecked=0, Total=7310 [2019-01-07 18:49:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-07 18:49:42,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-07 18:49:42,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:49:42,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2019-01-07 18:49:42,281 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2019-01-07 18:49:42,281 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2019-01-07 18:49:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:49:42,282 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-01-07 18:49:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-07 18:49:42,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:49:42,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:49:42,283 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2019-01-07 18:49:42,283 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2019-01-07 18:49:42,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:49:42,284 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2019-01-07 18:49:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-07 18:49:42,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:49:42,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:49:42,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:49:42,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:49:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-07 18:49:42,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-07 18:49:42,285 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2019-01-07 18:49:42,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:49:42,286 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-07 18:49:42,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-07 18:49:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-07 18:49:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-07 18:49:42,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:49:42,286 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1] [2019-01-07 18:49:42,287 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:49:42,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:49:42,287 INFO L82 PathProgramCache]: Analyzing trace with hash -392135284, now seen corresponding path program 29 times [2019-01-07 18:49:42,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:49:42,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:49:42,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:49:42,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:49:42,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:49:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:49:42,996 INFO L273 TraceCheckUtils]: 0: Hoare triple {10356#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {10358#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:42,998 INFO L273 TraceCheckUtils]: 1: Hoare triple {10358#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10359#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:42,999 INFO L273 TraceCheckUtils]: 2: Hoare triple {10359#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10360#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,000 INFO L273 TraceCheckUtils]: 3: Hoare triple {10360#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10361#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,001 INFO L273 TraceCheckUtils]: 4: Hoare triple {10361#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10362#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,002 INFO L273 TraceCheckUtils]: 5: Hoare triple {10362#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10363#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,003 INFO L273 TraceCheckUtils]: 6: Hoare triple {10363#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10364#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,004 INFO L273 TraceCheckUtils]: 7: Hoare triple {10364#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10365#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {10365#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10366#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {10366#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10367#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {10367#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10368#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {10368#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10369#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {10369#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10370#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {10370#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10371#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {10371#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10372#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {10372#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10373#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {10373#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10374#(<= 16 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {10374#(<= 16 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10375#(<= 17 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {10375#(<= 17 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10376#(<= 18 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {10376#(<= 18 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10377#(<= 19 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {10377#(<= 19 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10378#(<= 20 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:43,017 INFO L273 TraceCheckUtils]: 21: Hoare triple {10378#(<= 20 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {10377#(<= 19 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,018 INFO L273 TraceCheckUtils]: 22: Hoare triple {10377#(<= 19 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10376#(<= 18 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,019 INFO L273 TraceCheckUtils]: 23: Hoare triple {10376#(<= 18 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10375#(<= 17 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,020 INFO L273 TraceCheckUtils]: 24: Hoare triple {10375#(<= 17 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10374#(<= 16 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,021 INFO L273 TraceCheckUtils]: 25: Hoare triple {10374#(<= 16 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10373#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,022 INFO L273 TraceCheckUtils]: 26: Hoare triple {10373#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10372#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,023 INFO L273 TraceCheckUtils]: 27: Hoare triple {10372#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10371#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,024 INFO L273 TraceCheckUtils]: 28: Hoare triple {10371#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10370#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,025 INFO L273 TraceCheckUtils]: 29: Hoare triple {10370#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10369#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,026 INFO L273 TraceCheckUtils]: 30: Hoare triple {10369#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10368#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,027 INFO L273 TraceCheckUtils]: 31: Hoare triple {10368#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10367#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,028 INFO L273 TraceCheckUtils]: 32: Hoare triple {10367#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10366#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,029 INFO L273 TraceCheckUtils]: 33: Hoare triple {10366#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10365#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,030 INFO L273 TraceCheckUtils]: 34: Hoare triple {10365#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10364#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,031 INFO L273 TraceCheckUtils]: 35: Hoare triple {10364#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10363#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,032 INFO L273 TraceCheckUtils]: 36: Hoare triple {10363#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10362#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,033 INFO L273 TraceCheckUtils]: 37: Hoare triple {10362#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10361#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,034 INFO L273 TraceCheckUtils]: 38: Hoare triple {10361#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10360#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,035 INFO L273 TraceCheckUtils]: 39: Hoare triple {10360#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10359#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,036 INFO L273 TraceCheckUtils]: 40: Hoare triple {10359#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10358#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,036 INFO L273 TraceCheckUtils]: 41: Hoare triple {10358#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10357#false} is VALID [2019-01-07 18:49:43,037 INFO L273 TraceCheckUtils]: 42: Hoare triple {10357#false} assume !false; {10357#false} is VALID [2019-01-07 18:49:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:49:43,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:49:43,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:49:43,040 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:49:43,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:49:43,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:49:43,040 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:49:43,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 18:49:43,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 18:49:43,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-07 18:49:43,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:49:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:49:43,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:49:43,414 INFO L273 TraceCheckUtils]: 0: Hoare triple {10356#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {10358#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {10358#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10359#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,416 INFO L273 TraceCheckUtils]: 2: Hoare triple {10359#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10360#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,417 INFO L273 TraceCheckUtils]: 3: Hoare triple {10360#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10361#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,418 INFO L273 TraceCheckUtils]: 4: Hoare triple {10361#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10362#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,419 INFO L273 TraceCheckUtils]: 5: Hoare triple {10362#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10363#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,420 INFO L273 TraceCheckUtils]: 6: Hoare triple {10363#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10364#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {10364#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10365#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,423 INFO L273 TraceCheckUtils]: 8: Hoare triple {10365#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10366#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {10366#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10367#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,424 INFO L273 TraceCheckUtils]: 10: Hoare triple {10367#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10368#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,425 INFO L273 TraceCheckUtils]: 11: Hoare triple {10368#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10369#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {10369#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10370#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,428 INFO L273 TraceCheckUtils]: 13: Hoare triple {10370#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10371#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,429 INFO L273 TraceCheckUtils]: 14: Hoare triple {10371#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10372#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,430 INFO L273 TraceCheckUtils]: 15: Hoare triple {10372#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10373#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,431 INFO L273 TraceCheckUtils]: 16: Hoare triple {10373#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10374#(<= 16 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,432 INFO L273 TraceCheckUtils]: 17: Hoare triple {10374#(<= 16 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10375#(<= 17 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,433 INFO L273 TraceCheckUtils]: 18: Hoare triple {10375#(<= 17 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10376#(<= 18 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,434 INFO L273 TraceCheckUtils]: 19: Hoare triple {10376#(<= 18 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10377#(<= 19 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,435 INFO L273 TraceCheckUtils]: 20: Hoare triple {10377#(<= 19 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10378#(<= 20 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:43,436 INFO L273 TraceCheckUtils]: 21: Hoare triple {10378#(<= 20 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {10377#(<= 19 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,437 INFO L273 TraceCheckUtils]: 22: Hoare triple {10377#(<= 19 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10376#(<= 18 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,438 INFO L273 TraceCheckUtils]: 23: Hoare triple {10376#(<= 18 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10375#(<= 17 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,439 INFO L273 TraceCheckUtils]: 24: Hoare triple {10375#(<= 17 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10374#(<= 16 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,440 INFO L273 TraceCheckUtils]: 25: Hoare triple {10374#(<= 16 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10373#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,441 INFO L273 TraceCheckUtils]: 26: Hoare triple {10373#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10372#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,441 INFO L273 TraceCheckUtils]: 27: Hoare triple {10372#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10371#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,442 INFO L273 TraceCheckUtils]: 28: Hoare triple {10371#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10370#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,443 INFO L273 TraceCheckUtils]: 29: Hoare triple {10370#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10369#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,444 INFO L273 TraceCheckUtils]: 30: Hoare triple {10369#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10368#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,445 INFO L273 TraceCheckUtils]: 31: Hoare triple {10368#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10367#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,446 INFO L273 TraceCheckUtils]: 32: Hoare triple {10367#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10366#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,447 INFO L273 TraceCheckUtils]: 33: Hoare triple {10366#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10365#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,448 INFO L273 TraceCheckUtils]: 34: Hoare triple {10365#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10364#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,449 INFO L273 TraceCheckUtils]: 35: Hoare triple {10364#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10363#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,450 INFO L273 TraceCheckUtils]: 36: Hoare triple {10363#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10362#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,451 INFO L273 TraceCheckUtils]: 37: Hoare triple {10362#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10361#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,452 INFO L273 TraceCheckUtils]: 38: Hoare triple {10361#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10360#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,453 INFO L273 TraceCheckUtils]: 39: Hoare triple {10360#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10359#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,454 INFO L273 TraceCheckUtils]: 40: Hoare triple {10359#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10358#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:43,454 INFO L273 TraceCheckUtils]: 41: Hoare triple {10358#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10357#false} is VALID [2019-01-07 18:49:43,455 INFO L273 TraceCheckUtils]: 42: Hoare triple {10357#false} assume !false; {10357#false} is VALID [2019-01-07 18:49:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:49:43,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:49:44,173 INFO L273 TraceCheckUtils]: 42: Hoare triple {10357#false} assume !false; {10357#false} is VALID [2019-01-07 18:49:44,174 INFO L273 TraceCheckUtils]: 41: Hoare triple {10358#(<= 0 ULTIMATE.start_main_~i~6)} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10357#false} is VALID [2019-01-07 18:49:44,175 INFO L273 TraceCheckUtils]: 40: Hoare triple {10359#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10358#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,175 INFO L273 TraceCheckUtils]: 39: Hoare triple {10360#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10359#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,176 INFO L273 TraceCheckUtils]: 38: Hoare triple {10361#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10360#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,177 INFO L273 TraceCheckUtils]: 37: Hoare triple {10362#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10361#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,178 INFO L273 TraceCheckUtils]: 36: Hoare triple {10363#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10362#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,179 INFO L273 TraceCheckUtils]: 35: Hoare triple {10364#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10363#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,180 INFO L273 TraceCheckUtils]: 34: Hoare triple {10365#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10364#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,180 INFO L273 TraceCheckUtils]: 33: Hoare triple {10366#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10365#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,181 INFO L273 TraceCheckUtils]: 32: Hoare triple {10367#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10366#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,182 INFO L273 TraceCheckUtils]: 31: Hoare triple {10368#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10367#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,183 INFO L273 TraceCheckUtils]: 30: Hoare triple {10369#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10368#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,184 INFO L273 TraceCheckUtils]: 29: Hoare triple {10370#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10369#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,185 INFO L273 TraceCheckUtils]: 28: Hoare triple {10371#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10370#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,186 INFO L273 TraceCheckUtils]: 27: Hoare triple {10372#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10371#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,187 INFO L273 TraceCheckUtils]: 26: Hoare triple {10373#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10372#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,188 INFO L273 TraceCheckUtils]: 25: Hoare triple {10374#(<= 16 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10373#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,189 INFO L273 TraceCheckUtils]: 24: Hoare triple {10375#(<= 17 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10374#(<= 16 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,190 INFO L273 TraceCheckUtils]: 23: Hoare triple {10376#(<= 18 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10375#(<= 17 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,191 INFO L273 TraceCheckUtils]: 22: Hoare triple {10377#(<= 19 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10376#(<= 18 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,192 INFO L273 TraceCheckUtils]: 21: Hoare triple {10378#(<= 20 ULTIMATE.start_main_~MAX~6)} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {10377#(<= 19 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,193 INFO L273 TraceCheckUtils]: 20: Hoare triple {10377#(<= 19 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10378#(<= 20 ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:44,194 INFO L273 TraceCheckUtils]: 19: Hoare triple {10376#(<= 18 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10377#(<= 19 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,195 INFO L273 TraceCheckUtils]: 18: Hoare triple {10375#(<= 17 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10376#(<= 18 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,196 INFO L273 TraceCheckUtils]: 17: Hoare triple {10374#(<= 16 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10375#(<= 17 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,197 INFO L273 TraceCheckUtils]: 16: Hoare triple {10373#(<= 15 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10374#(<= 16 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,198 INFO L273 TraceCheckUtils]: 15: Hoare triple {10372#(<= 14 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10373#(<= 15 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,199 INFO L273 TraceCheckUtils]: 14: Hoare triple {10371#(<= 13 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10372#(<= 14 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {10370#(<= 12 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10371#(<= 13 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {10369#(<= 11 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10370#(<= 12 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,202 INFO L273 TraceCheckUtils]: 11: Hoare triple {10368#(<= 10 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10369#(<= 11 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,203 INFO L273 TraceCheckUtils]: 10: Hoare triple {10367#(<= 9 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10368#(<= 10 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {10366#(<= 8 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10367#(<= 9 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {10365#(<= 7 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10366#(<= 8 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,206 INFO L273 TraceCheckUtils]: 7: Hoare triple {10364#(<= 6 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10365#(<= 7 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,207 INFO L273 TraceCheckUtils]: 6: Hoare triple {10363#(<= 5 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10364#(<= 6 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,208 INFO L273 TraceCheckUtils]: 5: Hoare triple {10362#(<= 4 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10363#(<= 5 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,209 INFO L273 TraceCheckUtils]: 4: Hoare triple {10361#(<= 3 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10362#(<= 4 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,210 INFO L273 TraceCheckUtils]: 3: Hoare triple {10360#(<= 2 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10361#(<= 3 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,211 INFO L273 TraceCheckUtils]: 2: Hoare triple {10359#(<= 1 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10360#(<= 2 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {10358#(<= 0 ULTIMATE.start_main_~i~6)} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10359#(<= 1 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,213 INFO L273 TraceCheckUtils]: 0: Hoare triple {10356#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {10358#(<= 0 ULTIMATE.start_main_~i~6)} is VALID [2019-01-07 18:49:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:49:44,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:49:44,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2019-01-07 18:49:44,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:49:44,236 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-01-07 18:49:44,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:49:44,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2019-01-07 18:49:44,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:49:44,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-07 18:49:44,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-07 18:49:44,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-01-07 18:49:44,290 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 23 states. [2019-01-07 18:49:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:49:45,749 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-01-07 18:49:45,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-07 18:49:45,750 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-01-07 18:49:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:49:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-07 18:49:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-01-07 18:49:45,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-07 18:49:45,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2019-01-07 18:49:45,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2019-01-07 18:49:45,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:49:45,799 INFO L225 Difference]: With dead ends: 47 [2019-01-07 18:49:45,799 INFO L226 Difference]: Without dead ends: 45 [2019-01-07 18:49:45,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 40 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-01-07 18:49:45,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-07 18:49:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-07 18:49:46,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:49:46,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2019-01-07 18:49:46,830 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2019-01-07 18:49:46,830 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2019-01-07 18:49:46,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:49:46,831 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-07 18:49:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-07 18:49:46,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:49:46,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:49:46,832 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2019-01-07 18:49:46,832 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2019-01-07 18:49:46,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:49:46,833 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-07 18:49:46,833 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-07 18:49:46,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:49:46,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:49:46,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:49:46,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:49:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-07 18:49:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-07 18:49:46,834 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2019-01-07 18:49:46,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:49:46,835 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-07 18:49:46,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-07 18:49:46,835 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-07 18:49:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-07 18:49:46,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:49:46,835 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-07 18:49:46,835 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:49:46,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:49:46,836 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 30 times [2019-01-07 18:49:46,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:49:46,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:49:46,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:49:46,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:49:46,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:49:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:49:48,305 INFO L273 TraceCheckUtils]: 0: Hoare triple {10942#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {10944#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:48,306 INFO L273 TraceCheckUtils]: 1: Hoare triple {10944#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10945#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:48,307 INFO L273 TraceCheckUtils]: 2: Hoare triple {10945#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10946#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:48,309 INFO L273 TraceCheckUtils]: 3: Hoare triple {10946#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10947#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:49:48,310 INFO L273 TraceCheckUtils]: 4: Hoare triple {10947#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10948#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:48,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {10948#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10949#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:49:48,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {10949#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10950#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:48,313 INFO L273 TraceCheckUtils]: 7: Hoare triple {10950#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10951#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:49:48,314 INFO L273 TraceCheckUtils]: 8: Hoare triple {10951#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10952#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:48,315 INFO L273 TraceCheckUtils]: 9: Hoare triple {10952#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10953#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:48,316 INFO L273 TraceCheckUtils]: 10: Hoare triple {10953#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10954#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:48,317 INFO L273 TraceCheckUtils]: 11: Hoare triple {10954#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10955#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:49:48,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {10955#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10956#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:48,319 INFO L273 TraceCheckUtils]: 13: Hoare triple {10956#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10957#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:48,320 INFO L273 TraceCheckUtils]: 14: Hoare triple {10957#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10958#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:48,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {10958#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10959#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} is VALID [2019-01-07 18:49:48,323 INFO L273 TraceCheckUtils]: 16: Hoare triple {10959#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10960#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} is VALID [2019-01-07 18:49:48,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {10960#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10961#(and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:48,325 INFO L273 TraceCheckUtils]: 18: Hoare triple {10961#(and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10962#(and (<= ULTIMATE.start_main_~i~6 18) (<= 18 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:48,326 INFO L273 TraceCheckUtils]: 19: Hoare triple {10962#(and (<= ULTIMATE.start_main_~i~6 18) (<= 18 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10963#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 19) (<= 19 ULTIMATE.start_main_~i~6)))} is VALID [2019-01-07 18:49:48,327 INFO L273 TraceCheckUtils]: 20: Hoare triple {10963#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 19) (<= 19 ULTIMATE.start_main_~i~6)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10964#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 20 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:48,328 INFO L273 TraceCheckUtils]: 21: Hoare triple {10964#(or (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6) (= 20 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {10965#(= (+ ULTIMATE.start_main_~j~6 20) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {10965#(= (+ ULTIMATE.start_main_~j~6 20) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10966#(= (+ ULTIMATE.start_main_~j~6 19) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {10966#(= (+ ULTIMATE.start_main_~j~6 19) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10967#(= (+ ULTIMATE.start_main_~j~6 18) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,332 INFO L273 TraceCheckUtils]: 24: Hoare triple {10967#(= (+ ULTIMATE.start_main_~j~6 18) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10968#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,333 INFO L273 TraceCheckUtils]: 25: Hoare triple {10968#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10969#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {10969#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10970#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,335 INFO L273 TraceCheckUtils]: 27: Hoare triple {10970#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10971#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,336 INFO L273 TraceCheckUtils]: 28: Hoare triple {10971#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10972#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,337 INFO L273 TraceCheckUtils]: 29: Hoare triple {10972#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10973#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,338 INFO L273 TraceCheckUtils]: 30: Hoare triple {10973#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10974#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,339 INFO L273 TraceCheckUtils]: 31: Hoare triple {10974#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10975#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,340 INFO L273 TraceCheckUtils]: 32: Hoare triple {10975#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10976#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,342 INFO L273 TraceCheckUtils]: 33: Hoare triple {10976#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10977#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,343 INFO L273 TraceCheckUtils]: 34: Hoare triple {10977#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10978#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,344 INFO L273 TraceCheckUtils]: 35: Hoare triple {10978#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10979#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,345 INFO L273 TraceCheckUtils]: 36: Hoare triple {10979#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10980#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,346 INFO L273 TraceCheckUtils]: 37: Hoare triple {10980#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10981#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,347 INFO L273 TraceCheckUtils]: 38: Hoare triple {10981#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10982#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,348 INFO L273 TraceCheckUtils]: 39: Hoare triple {10982#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10983#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,349 INFO L273 TraceCheckUtils]: 40: Hoare triple {10983#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10984#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:49:48,350 INFO L273 TraceCheckUtils]: 41: Hoare triple {10984#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {10985#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:49:48,352 INFO L273 TraceCheckUtils]: 42: Hoare triple {10985#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10943#false} is VALID [2019-01-07 18:49:48,352 INFO L273 TraceCheckUtils]: 43: Hoare triple {10943#false} assume !false; {10943#false} is VALID [2019-01-07 18:49:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:49:48,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:49:48,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:49:48,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:49:48,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:49:48,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:49:48,357 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:49:48,365 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 18:49:48,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 18:49:48,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 18:49:48,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 18:49:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:49:48,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:49:49,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:49:49,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:49:49,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:49:49,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-07 18:49:49,890 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:49:49,890 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_316]. (and (= (store v_ULTIMATE.start_main_~str2~6_316 19 (select ULTIMATE.start_main_~str1~6 0)) ULTIMATE.start_main_~str2~6) (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 21)) (<= 20 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:49:49,890 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 21)) (= (select ULTIMATE.start_main_~str2~6 19) (select ULTIMATE.start_main_~str1~6 0)) (<= 20 ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:49:49,971 INFO L273 TraceCheckUtils]: 0: Hoare triple {10942#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {10942#true} is VALID [2019-01-07 18:49:49,971 INFO L273 TraceCheckUtils]: 1: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,971 INFO L273 TraceCheckUtils]: 2: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,971 INFO L273 TraceCheckUtils]: 3: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,971 INFO L273 TraceCheckUtils]: 4: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,972 INFO L273 TraceCheckUtils]: 6: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,972 INFO L273 TraceCheckUtils]: 7: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,972 INFO L273 TraceCheckUtils]: 8: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,972 INFO L273 TraceCheckUtils]: 11: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,972 INFO L273 TraceCheckUtils]: 12: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,973 INFO L273 TraceCheckUtils]: 13: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,973 INFO L273 TraceCheckUtils]: 14: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,973 INFO L273 TraceCheckUtils]: 15: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,973 INFO L273 TraceCheckUtils]: 16: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,973 INFO L273 TraceCheckUtils]: 17: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,973 INFO L273 TraceCheckUtils]: 18: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,973 INFO L273 TraceCheckUtils]: 19: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,974 INFO L273 TraceCheckUtils]: 20: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:49,975 INFO L273 TraceCheckUtils]: 21: Hoare triple {10942#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {11052#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:49,976 INFO L273 TraceCheckUtils]: 22: Hoare triple {11052#(and (= ULTIMATE.start_main_~j~6 0) (= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11056#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} is VALID [2019-01-07 18:49:49,976 INFO L273 TraceCheckUtils]: 23: Hoare triple {11056#(and (= ULTIMATE.start_main_~j~6 1) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 2)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11060#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:49:49,977 INFO L273 TraceCheckUtils]: 24: Hoare triple {11060#(and (= (+ ULTIMATE.start_main_~i~6 3) ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11064#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} is VALID [2019-01-07 18:49:49,978 INFO L273 TraceCheckUtils]: 25: Hoare triple {11064#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 4)) (= ULTIMATE.start_main_~j~6 3))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11068#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} is VALID [2019-01-07 18:49:49,978 INFO L273 TraceCheckUtils]: 26: Hoare triple {11068#(and (= ULTIMATE.start_main_~j~6 4) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 5)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11072#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:49,979 INFO L273 TraceCheckUtils]: 27: Hoare triple {11072#(and (= ULTIMATE.start_main_~j~6 5) (= (+ ULTIMATE.start_main_~i~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11076#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)) (= ULTIMATE.start_main_~j~6 6))} is VALID [2019-01-07 18:49:49,981 INFO L273 TraceCheckUtils]: 28: Hoare triple {11076#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 7)) (= ULTIMATE.start_main_~j~6 6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11080#(and (= ULTIMATE.start_main_~j~6 7) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 8)))} is VALID [2019-01-07 18:49:49,982 INFO L273 TraceCheckUtils]: 29: Hoare triple {11080#(and (= ULTIMATE.start_main_~j~6 7) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 8)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11084#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9)) (= ULTIMATE.start_main_~j~6 8))} is VALID [2019-01-07 18:49:49,983 INFO L273 TraceCheckUtils]: 30: Hoare triple {11084#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 9)) (= ULTIMATE.start_main_~j~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11088#(and (= ULTIMATE.start_main_~j~6 9) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 10)))} is VALID [2019-01-07 18:49:49,984 INFO L273 TraceCheckUtils]: 31: Hoare triple {11088#(and (= ULTIMATE.start_main_~j~6 9) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 10)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11092#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 11)) (= ULTIMATE.start_main_~j~6 10))} is VALID [2019-01-07 18:49:49,985 INFO L273 TraceCheckUtils]: 32: Hoare triple {11092#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 11)) (= ULTIMATE.start_main_~j~6 10))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11096#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 12)) (= ULTIMATE.start_main_~j~6 11))} is VALID [2019-01-07 18:49:49,986 INFO L273 TraceCheckUtils]: 33: Hoare triple {11096#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 12)) (= ULTIMATE.start_main_~j~6 11))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11100#(and (= ULTIMATE.start_main_~j~6 12) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 13)))} is VALID [2019-01-07 18:49:49,987 INFO L273 TraceCheckUtils]: 34: Hoare triple {11100#(and (= ULTIMATE.start_main_~j~6 12) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 13)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11104#(and (= ULTIMATE.start_main_~j~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 14)))} is VALID [2019-01-07 18:49:49,988 INFO L273 TraceCheckUtils]: 35: Hoare triple {11104#(and (= ULTIMATE.start_main_~j~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 14)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11108#(and (= ULTIMATE.start_main_~j~6 14) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 15)))} is VALID [2019-01-07 18:49:49,990 INFO L273 TraceCheckUtils]: 36: Hoare triple {11108#(and (= ULTIMATE.start_main_~j~6 14) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 15)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11112#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 16)) (= ULTIMATE.start_main_~j~6 15))} is VALID [2019-01-07 18:49:49,991 INFO L273 TraceCheckUtils]: 37: Hoare triple {11112#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 16)) (= ULTIMATE.start_main_~j~6 15))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11116#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 17)) (= ULTIMATE.start_main_~j~6 16))} is VALID [2019-01-07 18:49:49,992 INFO L273 TraceCheckUtils]: 38: Hoare triple {11116#(and (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 17)) (= ULTIMATE.start_main_~j~6 16))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11120#(and (= ULTIMATE.start_main_~j~6 17) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 18)))} is VALID [2019-01-07 18:49:49,993 INFO L273 TraceCheckUtils]: 39: Hoare triple {11120#(and (= ULTIMATE.start_main_~j~6 17) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 18)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11124#(and (= ULTIMATE.start_main_~j~6 18) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 19)))} is VALID [2019-01-07 18:49:49,994 INFO L273 TraceCheckUtils]: 40: Hoare triple {11124#(and (= ULTIMATE.start_main_~j~6 18) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 19)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11128#(and (= ULTIMATE.start_main_~j~6 19) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 20)))} is VALID [2019-01-07 18:49:49,995 INFO L273 TraceCheckUtils]: 41: Hoare triple {11128#(and (= ULTIMATE.start_main_~j~6 19) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 20)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11132#(and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 21)) (= (select ULTIMATE.start_main_~str2~6 19) (select ULTIMATE.start_main_~str1~6 0)) (<= 20 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:49,997 INFO L273 TraceCheckUtils]: 42: Hoare triple {11132#(and (<= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 21)) (= (select ULTIMATE.start_main_~str2~6 19) (select ULTIMATE.start_main_~str1~6 0)) (<= 20 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10943#false} is VALID [2019-01-07 18:49:49,997 INFO L273 TraceCheckUtils]: 43: Hoare triple {10943#false} assume !false; {10943#false} is VALID [2019-01-07 18:49:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-07 18:49:50,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:49:50,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:49:50,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:49:50,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:49:50,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-07 18:49:50,149 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:49:50,149 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (or (not (<= 0 ULTIMATE.start_main_~i~6)) (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) (< 0 ULTIMATE.start_main_~i~6)) [2019-01-07 18:49:50,149 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)) [2019-01-07 18:49:52,025 INFO L273 TraceCheckUtils]: 43: Hoare triple {10943#false} assume !false; {10943#false} is VALID [2019-01-07 18:49:52,027 INFO L273 TraceCheckUtils]: 42: Hoare triple {11142#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10943#false} is VALID [2019-01-07 18:49:52,028 INFO L273 TraceCheckUtils]: 41: Hoare triple {11146#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11142#(or (= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1)))) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:52,029 INFO L273 TraceCheckUtils]: 40: Hoare triple {11150#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11146#(or (< ULTIMATE.start_main_~i~6 0) (< 0 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:52,030 INFO L273 TraceCheckUtils]: 39: Hoare triple {11154#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11150#(or (= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6) (< 1 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 1))} is VALID [2019-01-07 18:49:52,032 INFO L273 TraceCheckUtils]: 38: Hoare triple {11158#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11154#(or (= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 2) (< 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:52,033 INFO L273 TraceCheckUtils]: 37: Hoare triple {11162#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11158#(or (= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6) (< ULTIMATE.start_main_~i~6 3) (< 3 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:52,034 INFO L273 TraceCheckUtils]: 36: Hoare triple {11166#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11162#(or (= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6) (< 4 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 4))} is VALID [2019-01-07 18:49:52,036 INFO L273 TraceCheckUtils]: 35: Hoare triple {11170#(or (< ULTIMATE.start_main_~i~6 6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 7)) (< 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11166#(or (< ULTIMATE.start_main_~i~6 5) (< 5 ULTIMATE.start_main_~i~6) (= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:49:52,037 INFO L273 TraceCheckUtils]: 34: Hoare triple {11174#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 8)) (< ULTIMATE.start_main_~i~6 7) (< 7 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11170#(or (< ULTIMATE.start_main_~i~6 6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 7)) (< 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:52,038 INFO L273 TraceCheckUtils]: 33: Hoare triple {11178#(or (< 8 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 9)) (< ULTIMATE.start_main_~i~6 8))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11174#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 8)) (< ULTIMATE.start_main_~i~6 7) (< 7 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:52,039 INFO L273 TraceCheckUtils]: 32: Hoare triple {11182#(or (< ULTIMATE.start_main_~i~6 9) (= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6) (< 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11178#(or (< 8 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 9)) (< ULTIMATE.start_main_~i~6 8))} is VALID [2019-01-07 18:49:52,040 INFO L273 TraceCheckUtils]: 31: Hoare triple {11186#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 11)) (< 10 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 10))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11182#(or (< ULTIMATE.start_main_~i~6 9) (= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6) (< 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:52,042 INFO L273 TraceCheckUtils]: 30: Hoare triple {11190#(or (< ULTIMATE.start_main_~i~6 11) (= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6) (< 11 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11186#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 11)) (< 10 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 10))} is VALID [2019-01-07 18:49:52,043 INFO L273 TraceCheckUtils]: 29: Hoare triple {11194#(or (< 12 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 13)) (< ULTIMATE.start_main_~i~6 12))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11190#(or (< ULTIMATE.start_main_~i~6 11) (= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6) (< 11 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:52,044 INFO L273 TraceCheckUtils]: 28: Hoare triple {11198#(or (< ULTIMATE.start_main_~i~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 14)) (< 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11194#(or (< 12 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 13)) (< ULTIMATE.start_main_~i~6 12))} is VALID [2019-01-07 18:49:52,045 INFO L273 TraceCheckUtils]: 27: Hoare triple {11202#(or (< 14 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 15)) (< ULTIMATE.start_main_~i~6 14))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11198#(or (< ULTIMATE.start_main_~i~6 13) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 14)) (< 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:49:52,047 INFO L273 TraceCheckUtils]: 26: Hoare triple {11206#(or (< 15 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 15) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 16)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11202#(or (< 14 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 15)) (< ULTIMATE.start_main_~i~6 14))} is VALID [2019-01-07 18:49:52,048 INFO L273 TraceCheckUtils]: 25: Hoare triple {11210#(or (< ULTIMATE.start_main_~i~6 16) (< 16 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 17)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11206#(or (< 15 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 15) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 16)))} is VALID [2019-01-07 18:49:52,049 INFO L273 TraceCheckUtils]: 24: Hoare triple {11214#(or (< ULTIMATE.start_main_~i~6 17) (< 17 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 18)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11210#(or (< ULTIMATE.start_main_~i~6 16) (< 16 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 17)))} is VALID [2019-01-07 18:49:52,051 INFO L273 TraceCheckUtils]: 23: Hoare triple {11218#(or (< ULTIMATE.start_main_~i~6 18) (< 18 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 19)))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11214#(or (< ULTIMATE.start_main_~i~6 17) (< 17 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 18)))} is VALID [2019-01-07 18:49:52,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {11222#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 20)) (< 19 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 19))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11218#(or (< ULTIMATE.start_main_~i~6 18) (< 18 ULTIMATE.start_main_~i~6) (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 19)))} is VALID [2019-01-07 18:49:52,053 INFO L273 TraceCheckUtils]: 21: Hoare triple {10942#true} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {11222#(or (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~j~6 20)) (< 19 ULTIMATE.start_main_~i~6) (< ULTIMATE.start_main_~i~6 19))} is VALID [2019-01-07 18:49:52,053 INFO L273 TraceCheckUtils]: 20: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,054 INFO L273 TraceCheckUtils]: 19: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,054 INFO L273 TraceCheckUtils]: 18: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,054 INFO L273 TraceCheckUtils]: 17: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,054 INFO L273 TraceCheckUtils]: 16: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,054 INFO L273 TraceCheckUtils]: 15: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,055 INFO L273 TraceCheckUtils]: 14: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,055 INFO L273 TraceCheckUtils]: 13: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,055 INFO L273 TraceCheckUtils]: 11: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,055 INFO L273 TraceCheckUtils]: 10: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,056 INFO L273 TraceCheckUtils]: 9: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,056 INFO L273 TraceCheckUtils]: 8: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,056 INFO L273 TraceCheckUtils]: 7: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,056 INFO L273 TraceCheckUtils]: 4: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,056 INFO L273 TraceCheckUtils]: 3: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,057 INFO L273 TraceCheckUtils]: 2: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {10942#true} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {10942#true} is VALID [2019-01-07 18:49:52,057 INFO L273 TraceCheckUtils]: 0: Hoare triple {10942#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {10942#true} is VALID [2019-01-07 18:49:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-07 18:49:52,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:49:52,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23, 23] total 86 [2019-01-07 18:49:52,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:49:52,079 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 44 [2019-01-07 18:49:52,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:49:52,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 65 states. [2019-01-07 18:49:52,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:49:52,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-07 18:49:52,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-07 18:49:52,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1010, Invalid=6300, Unknown=0, NotChecked=0, Total=7310 [2019-01-07 18:49:52,232 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 65 states. [2019-01-07 18:50:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:50:03,248 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-01-07 18:50:03,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-07 18:50:03,248 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 44 [2019-01-07 18:50:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 18:50:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-07 18:50:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-01-07 18:50:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-07 18:50:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2019-01-07 18:50:03,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 68 states and 75 transitions. [2019-01-07 18:50:03,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:50:03,345 INFO L225 Difference]: With dead ends: 71 [2019-01-07 18:50:03,345 INFO L226 Difference]: Without dead ends: 47 [2019-01-07 18:50:03,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1663, Invalid=10547, Unknown=0, NotChecked=0, Total=12210 [2019-01-07 18:50:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-07 18:50:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-07 18:50:04,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 18:50:04,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2019-01-07 18:50:04,229 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2019-01-07 18:50:04,230 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2019-01-07 18:50:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:50:04,231 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-01-07 18:50:04,231 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-07 18:50:04,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:50:04,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:50:04,232 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2019-01-07 18:50:04,232 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2019-01-07 18:50:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 18:50:04,233 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-01-07 18:50:04,233 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-07 18:50:04,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 18:50:04,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 18:50:04,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 18:50:04,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 18:50:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-07 18:50:04,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-07 18:50:04,234 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-07 18:50:04,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 18:50:04,235 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-07 18:50:04,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-07 18:50:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-07 18:50:04,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-07 18:50:04,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 18:50:04,236 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-07 18:50:04,236 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 18:50:04,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 18:50:04,236 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 31 times [2019-01-07 18:50:04,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 18:50:04,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:50:04,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 18:50:04,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 18:50:04,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 18:50:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:50:06,000 INFO L273 TraceCheckUtils]: 0: Hoare triple {11663#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {11665#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:06,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {11665#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11666#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:06,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {11666#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11667#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:06,004 INFO L273 TraceCheckUtils]: 3: Hoare triple {11667#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11668#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:50:06,005 INFO L273 TraceCheckUtils]: 4: Hoare triple {11668#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11669#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:06,006 INFO L273 TraceCheckUtils]: 5: Hoare triple {11669#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11670#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:50:06,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {11670#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11671#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:06,009 INFO L273 TraceCheckUtils]: 7: Hoare triple {11671#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11672#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:50:06,010 INFO L273 TraceCheckUtils]: 8: Hoare triple {11672#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11673#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:06,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {11673#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11674#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:06,012 INFO L273 TraceCheckUtils]: 10: Hoare triple {11674#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11675#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:06,013 INFO L273 TraceCheckUtils]: 11: Hoare triple {11675#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11676#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:50:06,014 INFO L273 TraceCheckUtils]: 12: Hoare triple {11676#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11677#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:06,015 INFO L273 TraceCheckUtils]: 13: Hoare triple {11677#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11678#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:06,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {11678#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11679#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:06,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {11679#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11680#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} is VALID [2019-01-07 18:50:06,018 INFO L273 TraceCheckUtils]: 16: Hoare triple {11680#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11681#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} is VALID [2019-01-07 18:50:06,019 INFO L273 TraceCheckUtils]: 17: Hoare triple {11681#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11682#(and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:06,021 INFO L273 TraceCheckUtils]: 18: Hoare triple {11682#(and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11683#(and (<= ULTIMATE.start_main_~i~6 18) (<= 18 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:06,022 INFO L273 TraceCheckUtils]: 19: Hoare triple {11683#(and (<= ULTIMATE.start_main_~i~6 18) (<= 18 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11684#(and (<= ULTIMATE.start_main_~i~6 19) (<= 19 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:06,023 INFO L273 TraceCheckUtils]: 20: Hoare triple {11684#(and (<= ULTIMATE.start_main_~i~6 19) (<= 19 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11685#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 20) (<= 20 ULTIMATE.start_main_~i~6)))} is VALID [2019-01-07 18:50:06,024 INFO L273 TraceCheckUtils]: 21: Hoare triple {11685#(or (not (= ULTIMATE.start_main_~MAX~6 (+ ULTIMATE.start_main_~i~6 1))) (and (<= ULTIMATE.start_main_~i~6 20) (<= 20 ULTIMATE.start_main_~i~6)))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11686#(or (= 21 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:50:06,025 INFO L273 TraceCheckUtils]: 22: Hoare triple {11686#(or (= 21 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {11687#(= (+ ULTIMATE.start_main_~j~6 21) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,027 INFO L273 TraceCheckUtils]: 23: Hoare triple {11687#(= (+ ULTIMATE.start_main_~j~6 21) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11688#(= (+ ULTIMATE.start_main_~j~6 20) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,028 INFO L273 TraceCheckUtils]: 24: Hoare triple {11688#(= (+ ULTIMATE.start_main_~j~6 20) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11689#(= (+ ULTIMATE.start_main_~j~6 19) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,029 INFO L273 TraceCheckUtils]: 25: Hoare triple {11689#(= (+ ULTIMATE.start_main_~j~6 19) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11690#(= (+ ULTIMATE.start_main_~j~6 18) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,030 INFO L273 TraceCheckUtils]: 26: Hoare triple {11690#(= (+ ULTIMATE.start_main_~j~6 18) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11691#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,031 INFO L273 TraceCheckUtils]: 27: Hoare triple {11691#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11692#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,032 INFO L273 TraceCheckUtils]: 28: Hoare triple {11692#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11693#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,033 INFO L273 TraceCheckUtils]: 29: Hoare triple {11693#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11694#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,034 INFO L273 TraceCheckUtils]: 30: Hoare triple {11694#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11695#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,035 INFO L273 TraceCheckUtils]: 31: Hoare triple {11695#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11696#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {11696#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11697#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,037 INFO L273 TraceCheckUtils]: 33: Hoare triple {11697#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11698#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,039 INFO L273 TraceCheckUtils]: 34: Hoare triple {11698#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11699#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,040 INFO L273 TraceCheckUtils]: 35: Hoare triple {11699#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11700#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,041 INFO L273 TraceCheckUtils]: 36: Hoare triple {11700#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11701#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,042 INFO L273 TraceCheckUtils]: 37: Hoare triple {11701#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11702#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,043 INFO L273 TraceCheckUtils]: 38: Hoare triple {11702#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11703#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,044 INFO L273 TraceCheckUtils]: 39: Hoare triple {11703#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11704#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,045 INFO L273 TraceCheckUtils]: 40: Hoare triple {11704#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11705#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,046 INFO L273 TraceCheckUtils]: 41: Hoare triple {11705#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11706#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,047 INFO L273 TraceCheckUtils]: 42: Hoare triple {11706#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11707#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:06,048 INFO L273 TraceCheckUtils]: 43: Hoare triple {11707#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11708#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:50:06,049 INFO L273 TraceCheckUtils]: 44: Hoare triple {11708#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {11664#false} is VALID [2019-01-07 18:50:06,050 INFO L273 TraceCheckUtils]: 45: Hoare triple {11664#false} assume !false; {11664#false} is VALID [2019-01-07 18:50:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:50:06,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:50:06,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 18:50:06,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 18:50:06,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 18:50:06,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 18:50:06,054 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 18:50:06,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 18:50:06,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 18:50:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:50:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 18:50:06,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 18:50:07,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-07 18:50:07,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:50:07,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:50:07,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-07 18:50:07,917 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:50:07,917 WARN L385 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~str2~6_337]. (and (= ULTIMATE.start_main_~str2~6 (store v_ULTIMATE.start_main_~str2~6_337 20 (select ULTIMATE.start_main_~str1~6 0))) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21)) [2019-01-07 18:50:07,917 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select ULTIMATE.start_main_~str2~6 20) (select ULTIMATE.start_main_~str1~6 0)) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21)) [2019-01-07 18:50:07,994 INFO L273 TraceCheckUtils]: 0: Hoare triple {11663#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {11665#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:07,995 INFO L273 TraceCheckUtils]: 1: Hoare triple {11665#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11666#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:07,996 INFO L273 TraceCheckUtils]: 2: Hoare triple {11666#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11667#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:07,997 INFO L273 TraceCheckUtils]: 3: Hoare triple {11667#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11668#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:50:07,998 INFO L273 TraceCheckUtils]: 4: Hoare triple {11668#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11669#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:07,999 INFO L273 TraceCheckUtils]: 5: Hoare triple {11669#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11670#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:50:08,000 INFO L273 TraceCheckUtils]: 6: Hoare triple {11670#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11671#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,001 INFO L273 TraceCheckUtils]: 7: Hoare triple {11671#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11672#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:50:08,002 INFO L273 TraceCheckUtils]: 8: Hoare triple {11672#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11673#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,003 INFO L273 TraceCheckUtils]: 9: Hoare triple {11673#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11674#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {11674#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11675#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {11675#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11676#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:50:08,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {11676#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11677#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {11677#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11678#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {11678#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11679#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {11679#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11680#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} is VALID [2019-01-07 18:50:08,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {11680#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11681#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} is VALID [2019-01-07 18:50:08,012 INFO L273 TraceCheckUtils]: 17: Hoare triple {11681#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11682#(and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,013 INFO L273 TraceCheckUtils]: 18: Hoare triple {11682#(and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11683#(and (<= ULTIMATE.start_main_~i~6 18) (<= 18 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,014 INFO L273 TraceCheckUtils]: 19: Hoare triple {11683#(and (<= ULTIMATE.start_main_~i~6 18) (<= 18 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11684#(and (<= ULTIMATE.start_main_~i~6 19) (<= 19 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,015 INFO L273 TraceCheckUtils]: 20: Hoare triple {11684#(and (<= ULTIMATE.start_main_~i~6 19) (<= 19 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11772#(and (<= ULTIMATE.start_main_~i~6 20) (<= 20 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,016 INFO L273 TraceCheckUtils]: 21: Hoare triple {11772#(and (<= ULTIMATE.start_main_~i~6 20) (<= 20 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11776#(and (<= ULTIMATE.start_main_~i~6 21) (<= 21 ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:50:08,017 INFO L273 TraceCheckUtils]: 22: Hoare triple {11776#(and (<= ULTIMATE.start_main_~i~6 21) (<= 21 ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {11780#(and (= ULTIMATE.start_main_~j~6 0) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,018 INFO L273 TraceCheckUtils]: 23: Hoare triple {11780#(and (= ULTIMATE.start_main_~j~6 0) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11784#(and (= ULTIMATE.start_main_~j~6 1) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,019 INFO L273 TraceCheckUtils]: 24: Hoare triple {11784#(and (= ULTIMATE.start_main_~j~6 1) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11788#(and (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21) (= ULTIMATE.start_main_~j~6 2))} is VALID [2019-01-07 18:50:08,020 INFO L273 TraceCheckUtils]: 25: Hoare triple {11788#(and (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21) (= ULTIMATE.start_main_~j~6 2))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11792#(and (<= 21 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 3) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,021 INFO L273 TraceCheckUtils]: 26: Hoare triple {11792#(and (<= 21 ULTIMATE.start_main_~MAX~6) (= ULTIMATE.start_main_~j~6 3) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11796#(and (= ULTIMATE.start_main_~j~6 4) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,021 INFO L273 TraceCheckUtils]: 27: Hoare triple {11796#(and (= ULTIMATE.start_main_~j~6 4) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11800#(and (= ULTIMATE.start_main_~j~6 5) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,022 INFO L273 TraceCheckUtils]: 28: Hoare triple {11800#(and (= ULTIMATE.start_main_~j~6 5) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11804#(and (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21) (= ULTIMATE.start_main_~j~6 6))} is VALID [2019-01-07 18:50:08,023 INFO L273 TraceCheckUtils]: 29: Hoare triple {11804#(and (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21) (= ULTIMATE.start_main_~j~6 6))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11808#(and (= ULTIMATE.start_main_~j~6 7) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,024 INFO L273 TraceCheckUtils]: 30: Hoare triple {11808#(and (= ULTIMATE.start_main_~j~6 7) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11812#(and (= ULTIMATE.start_main_~j~6 8) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,025 INFO L273 TraceCheckUtils]: 31: Hoare triple {11812#(and (= ULTIMATE.start_main_~j~6 8) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11816#(and (= ULTIMATE.start_main_~j~6 9) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,026 INFO L273 TraceCheckUtils]: 32: Hoare triple {11816#(and (= ULTIMATE.start_main_~j~6 9) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11820#(and (= ULTIMATE.start_main_~j~6 10) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,027 INFO L273 TraceCheckUtils]: 33: Hoare triple {11820#(and (= ULTIMATE.start_main_~j~6 10) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11824#(and (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21) (= ULTIMATE.start_main_~j~6 11))} is VALID [2019-01-07 18:50:08,027 INFO L273 TraceCheckUtils]: 34: Hoare triple {11824#(and (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21) (= ULTIMATE.start_main_~j~6 11))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11828#(and (= ULTIMATE.start_main_~j~6 12) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,028 INFO L273 TraceCheckUtils]: 35: Hoare triple {11828#(and (= ULTIMATE.start_main_~j~6 12) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11832#(and (= ULTIMATE.start_main_~j~6 13) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,029 INFO L273 TraceCheckUtils]: 36: Hoare triple {11832#(and (= ULTIMATE.start_main_~j~6 13) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11836#(and (= ULTIMATE.start_main_~j~6 14) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,030 INFO L273 TraceCheckUtils]: 37: Hoare triple {11836#(and (= ULTIMATE.start_main_~j~6 14) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11840#(and (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21) (= ULTIMATE.start_main_~j~6 15))} is VALID [2019-01-07 18:50:08,052 INFO L273 TraceCheckUtils]: 38: Hoare triple {11840#(and (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21) (= ULTIMATE.start_main_~j~6 15))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11844#(and (= ULTIMATE.start_main_~j~6 16) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,067 INFO L273 TraceCheckUtils]: 39: Hoare triple {11844#(and (= ULTIMATE.start_main_~j~6 16) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11848#(and (= ULTIMATE.start_main_~j~6 17) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,080 INFO L273 TraceCheckUtils]: 40: Hoare triple {11848#(and (= ULTIMATE.start_main_~j~6 17) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11852#(and (= ULTIMATE.start_main_~j~6 18) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,080 INFO L273 TraceCheckUtils]: 41: Hoare triple {11852#(and (= ULTIMATE.start_main_~j~6 18) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11856#(and (= ULTIMATE.start_main_~j~6 19) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,081 INFO L273 TraceCheckUtils]: 42: Hoare triple {11856#(and (= ULTIMATE.start_main_~j~6 19) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11860#(and (= ULTIMATE.start_main_~j~6 20) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,082 INFO L273 TraceCheckUtils]: 43: Hoare triple {11860#(and (= ULTIMATE.start_main_~j~6 20) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11864#(and (= (select ULTIMATE.start_main_~str2~6 20) (select ULTIMATE.start_main_~str1~6 0)) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} is VALID [2019-01-07 18:50:08,082 INFO L273 TraceCheckUtils]: 44: Hoare triple {11864#(and (= (select ULTIMATE.start_main_~str2~6 20) (select ULTIMATE.start_main_~str1~6 0)) (<= 21 ULTIMATE.start_main_~MAX~6) (<= ULTIMATE.start_main_~MAX~6 21))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {11664#false} is VALID [2019-01-07 18:50:08,083 INFO L273 TraceCheckUtils]: 45: Hoare triple {11664#false} assume !false; {11664#false} is VALID [2019-01-07 18:50:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:50:08,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 18:50:08,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-07 18:50:08,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 18:50:08,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 18:50:08,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-07 18:50:08,136 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-07 18:50:08,136 WARN L385 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~str2~6, ULTIMATE.start_main_~str1~6]. (let ((.cse0 (select ULTIMATE.start_main_~str1~6 0))) (= .cse0 (select (store ULTIMATE.start_main_~str2~6 ULTIMATE.start_main_~j~6 .cse0) (+ ULTIMATE.start_main_~MAX~6 (- 1))))) [2019-01-07 18:50:08,136 WARN L386 uantifierElimination]: ElimStorePlain result: ∀ []. (= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6) [2019-01-07 18:50:08,757 INFO L273 TraceCheckUtils]: 45: Hoare triple {11664#false} assume !false; {11664#false} is VALID [2019-01-07 18:50:08,758 INFO L273 TraceCheckUtils]: 44: Hoare triple {11708#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} assume !(main_~i~6 >= 0);main_~j~6 := main_~MAX~6 - 1;main_~i~6 := 0;assume !!(main_~i~6 < main_~MAX~6);__VERIFIER_assert_#in~cond := (if main_~str1~6[main_~i~6] == main_~str2~6[main_~j~6] then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {11664#false} is VALID [2019-01-07 18:50:08,759 INFO L273 TraceCheckUtils]: 43: Hoare triple {11707#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11708#(= (select ULTIMATE.start_main_~str1~6 0) (select ULTIMATE.start_main_~str2~6 (+ ULTIMATE.start_main_~MAX~6 (- 1))))} is VALID [2019-01-07 18:50:08,760 INFO L273 TraceCheckUtils]: 42: Hoare triple {11706#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11707#(= (+ ULTIMATE.start_main_~j~6 1) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,761 INFO L273 TraceCheckUtils]: 41: Hoare triple {11705#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11706#(= (+ ULTIMATE.start_main_~j~6 2) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,762 INFO L273 TraceCheckUtils]: 40: Hoare triple {11704#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11705#(= (+ ULTIMATE.start_main_~j~6 3) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,763 INFO L273 TraceCheckUtils]: 39: Hoare triple {11703#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11704#(= (+ ULTIMATE.start_main_~j~6 4) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,764 INFO L273 TraceCheckUtils]: 38: Hoare triple {11702#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11703#(= (+ ULTIMATE.start_main_~j~6 5) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,765 INFO L273 TraceCheckUtils]: 37: Hoare triple {11701#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11702#(= (+ ULTIMATE.start_main_~j~6 6) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,766 INFO L273 TraceCheckUtils]: 36: Hoare triple {11700#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11701#(= (+ ULTIMATE.start_main_~j~6 7) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,767 INFO L273 TraceCheckUtils]: 35: Hoare triple {11699#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11700#(= (+ ULTIMATE.start_main_~j~6 8) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,768 INFO L273 TraceCheckUtils]: 34: Hoare triple {11698#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11699#(= (+ ULTIMATE.start_main_~j~6 9) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,769 INFO L273 TraceCheckUtils]: 33: Hoare triple {11697#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11698#(= (+ ULTIMATE.start_main_~j~6 10) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,771 INFO L273 TraceCheckUtils]: 32: Hoare triple {11696#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11697#(= (+ ULTIMATE.start_main_~j~6 11) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,772 INFO L273 TraceCheckUtils]: 31: Hoare triple {11695#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11696#(= (+ ULTIMATE.start_main_~j~6 12) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,773 INFO L273 TraceCheckUtils]: 30: Hoare triple {11694#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11695#(= (+ ULTIMATE.start_main_~j~6 13) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,774 INFO L273 TraceCheckUtils]: 29: Hoare triple {11693#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11694#(= (+ ULTIMATE.start_main_~j~6 14) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,775 INFO L273 TraceCheckUtils]: 28: Hoare triple {11692#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11693#(= (+ ULTIMATE.start_main_~j~6 15) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,776 INFO L273 TraceCheckUtils]: 27: Hoare triple {11691#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11692#(= (+ ULTIMATE.start_main_~j~6 16) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,777 INFO L273 TraceCheckUtils]: 26: Hoare triple {11690#(= (+ ULTIMATE.start_main_~j~6 18) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11691#(= (+ ULTIMATE.start_main_~j~6 17) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,778 INFO L273 TraceCheckUtils]: 25: Hoare triple {11689#(= (+ ULTIMATE.start_main_~j~6 19) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11690#(= (+ ULTIMATE.start_main_~j~6 18) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,779 INFO L273 TraceCheckUtils]: 24: Hoare triple {11688#(= (+ ULTIMATE.start_main_~j~6 20) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11689#(= (+ ULTIMATE.start_main_~j~6 19) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {11687#(= (+ ULTIMATE.start_main_~j~6 21) ULTIMATE.start_main_~MAX~6)} assume !!(main_~i~6 >= 0);main_~str2~6 := main_~str2~6[main_~j~6 := main_~str1~6[0]];main_#t~post4 := main_~j~6;main_~j~6 := main_#t~post4 + 1;havoc main_#t~post4;main_#t~post3 := main_~i~6;main_~i~6 := main_#t~post3 - 1;havoc main_#t~post3; {11688#(= (+ ULTIMATE.start_main_~j~6 20) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,781 INFO L273 TraceCheckUtils]: 22: Hoare triple {11686#(or (= 21 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} assume !(main_~i~6 < main_~MAX~6);main_~str1~6 := main_~str1~6[main_~MAX~6 - 1 := 0];main_~j~6 := 0;main_~i~6 := main_~MAX~6 - 1; {11687#(= (+ ULTIMATE.start_main_~j~6 21) ULTIMATE.start_main_~MAX~6)} is VALID [2019-01-07 18:50:08,782 INFO L273 TraceCheckUtils]: 21: Hoare triple {11772#(and (<= ULTIMATE.start_main_~i~6 20) (<= 20 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11686#(or (= 21 ULTIMATE.start_main_~MAX~6) (<= (+ ULTIMATE.start_main_~i~6 1) ULTIMATE.start_main_~MAX~6))} is VALID [2019-01-07 18:50:08,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {11684#(and (<= ULTIMATE.start_main_~i~6 19) (<= 19 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11772#(and (<= ULTIMATE.start_main_~i~6 20) (<= 20 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,784 INFO L273 TraceCheckUtils]: 19: Hoare triple {11683#(and (<= ULTIMATE.start_main_~i~6 18) (<= 18 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11684#(and (<= ULTIMATE.start_main_~i~6 19) (<= 19 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,785 INFO L273 TraceCheckUtils]: 18: Hoare triple {11682#(and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11683#(and (<= ULTIMATE.start_main_~i~6 18) (<= 18 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,786 INFO L273 TraceCheckUtils]: 17: Hoare triple {11681#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11682#(and (<= ULTIMATE.start_main_~i~6 17) (<= 17 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,787 INFO L273 TraceCheckUtils]: 16: Hoare triple {11680#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11681#(and (<= 16 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 16))} is VALID [2019-01-07 18:50:08,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {11679#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11680#(and (<= 15 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 15))} is VALID [2019-01-07 18:50:08,790 INFO L273 TraceCheckUtils]: 14: Hoare triple {11678#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11679#(and (<= ULTIMATE.start_main_~i~6 14) (<= 14 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {11677#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11678#(and (<= ULTIMATE.start_main_~i~6 13) (<= 13 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {11676#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11677#(and (<= ULTIMATE.start_main_~i~6 12) (<= 12 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {11675#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11676#(and (<= 11 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 11))} is VALID [2019-01-07 18:50:08,794 INFO L273 TraceCheckUtils]: 10: Hoare triple {11674#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11675#(and (<= ULTIMATE.start_main_~i~6 10) (<= 10 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,795 INFO L273 TraceCheckUtils]: 9: Hoare triple {11673#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11674#(and (<= ULTIMATE.start_main_~i~6 9) (<= 9 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,796 INFO L273 TraceCheckUtils]: 8: Hoare triple {11672#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11673#(and (<= ULTIMATE.start_main_~i~6 8) (<= 8 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,797 INFO L273 TraceCheckUtils]: 7: Hoare triple {11671#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11672#(and (<= 7 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 7))} is VALID [2019-01-07 18:50:08,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {11670#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11671#(and (<= ULTIMATE.start_main_~i~6 6) (<= 6 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {11669#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11670#(and (<= 5 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 5))} is VALID [2019-01-07 18:50:08,801 INFO L273 TraceCheckUtils]: 4: Hoare triple {11668#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11669#(and (<= ULTIMATE.start_main_~i~6 4) (<= 4 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,802 INFO L273 TraceCheckUtils]: 3: Hoare triple {11667#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11668#(and (<= 3 ULTIMATE.start_main_~i~6) (<= ULTIMATE.start_main_~i~6 3))} is VALID [2019-01-07 18:50:08,803 INFO L273 TraceCheckUtils]: 2: Hoare triple {11666#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11667#(and (<= ULTIMATE.start_main_~i~6 2) (<= 2 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,804 INFO L273 TraceCheckUtils]: 1: Hoare triple {11665#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} assume !!(main_~i~6 < main_~MAX~6);assume -128 <= main_#t~nondet2 && main_#t~nondet2 <= 127;main_~str1~6 := main_~str1~6[main_~i~6 := main_#t~nondet2];havoc main_#t~nondet2;main_#t~post1 := main_~i~6;main_~i~6 := main_#t~post1 + 1;havoc main_#t~post1; {11666#(and (<= ULTIMATE.start_main_~i~6 1) (<= 1 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,805 INFO L273 TraceCheckUtils]: 0: Hoare triple {11663#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~post4, main_#t~post3, main_#t~post6, main_#t~post5, main_~MAX~6, main_~str1~6, main_~str2~6, main_~cont~6, main_~i~6, main_~j~6;main_~MAX~6 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;havoc main_~str1~6;havoc main_~str2~6;havoc main_~cont~6;havoc main_~i~6;havoc main_~j~6;main_~cont~6 := 0;main_~i~6 := 0; {11665#(and (<= ULTIMATE.start_main_~i~6 0) (<= 0 ULTIMATE.start_main_~i~6))} is VALID [2019-01-07 18:50:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 18:50:08,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 18:50:08,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2019-01-07 18:50:08,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 18:50:08,830 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 46 [2019-01-07 18:50:08,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 18:50:08,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states. [2019-01-07 18:50:08,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 18:50:08,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-07 18:50:08,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-07 18:50:08,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2019-01-07 18:50:08,903 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 70 states.