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_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1377b90 [2019-01-07 14:12:06,416 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 14:12:06,418 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 14:12:06,432 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 14:12:06,433 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 14:12:06,434 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 14:12:06,436 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 14:12:06,438 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 14:12:06,441 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 14:12:06,442 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 14:12:06,444 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 14:12:06,444 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 14:12:06,445 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 14:12:06,447 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 14:12:06,448 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 14:12:06,457 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 14:12:06,458 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 14:12:06,459 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 14:12:06,464 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 14:12:06,467 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 14:12:06,468 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 14:12:06,469 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 14:12:06,471 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 14:12:06,471 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 14:12:06,472 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 14:12:06,472 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 14:12:06,473 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 14:12:06,474 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 14:12:06,475 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 14:12:06,476 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 14:12:06,476 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 14:12:06,477 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 14:12:06,477 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 14:12:06,477 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 14:12:06,478 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 14:12:06,479 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 14:12:06,479 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-07 14:12:06,491 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 14:12:06,491 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 14:12:06,492 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 14:12:06,492 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 14:12:06,493 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 14:12:06,493 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 14:12:06,493 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 14:12:06,493 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 14:12:06,493 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 14:12:06,493 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 14:12:06,494 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 14:12:06,494 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 14:12:06,494 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 14:12:06,494 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 14:12:06,495 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 14:12:06,495 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 14:12:06,495 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 14:12:06,495 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 14:12:06,496 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 14:12:06,496 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 14:12:06,496 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 14:12:06,496 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 14:12:06,496 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 14:12:06,496 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 14:12:06,497 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 14:12:06,497 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 14:12:06,497 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 14:12:06,497 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 14:12:06,497 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 14:12:06,498 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 14:12:06,498 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 14:12:06,498 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:12:06,498 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 14:12:06,498 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 14:12:06,499 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 14:12:06,499 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 14:12:06,499 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 14:12:06,499 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 14:12:06,499 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 14:12:06,499 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 14:12:06,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 14:12:06,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 14:12:06,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 14:12:06,553 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 14:12:06,554 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 14:12:06,554 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl [2019-01-07 14:12:06,555 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/string.i_3.bpl' [2019-01-07 14:12:06,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 14:12:06,629 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 14:12:06,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 14:12:06,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 14:12:06,630 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 14:12:06,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:12:06" (1/1) ... [2019-01-07 14:12:06,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:12:06" (1/1) ... [2019-01-07 14:12:06,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 14:12:06,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 14:12:06,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 14:12:06,678 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 14:12:06,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:12:06" (1/1) ... [2019-01-07 14:12:06,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:12:06" (1/1) ... [2019-01-07 14:12:06,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:12:06" (1/1) ... [2019-01-07 14:12:06,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:12:06" (1/1) ... [2019-01-07 14:12:06,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:12:06" (1/1) ... [2019-01-07 14:12:06,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:12:06" (1/1) ... [2019-01-07 14:12:06,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:12:06" (1/1) ... [2019-01-07 14:12:06,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 14:12:06,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 14:12:06,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 14:12:06,708 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 14:12:06,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:12:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:12:06,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 14:12:06,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 14:12:07,191 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 14:12:07,192 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-07 14:12:07,193 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:12:07 BoogieIcfgContainer [2019-01-07 14:12:07,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 14:12:07,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 14:12:07,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 14:12:07,198 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 14:12:07,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:12:06" (1/2) ... [2019-01-07 14:12:07,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e886d66 and model type string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:12:07, skipping insertion in model container [2019-01-07 14:12:07,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:12:07" (2/2) ... [2019-01-07 14:12:07,202 INFO L112 eAbstractionObserver]: Analyzing ICFG string.i_3.bpl [2019-01-07 14:12:07,213 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 14:12:07,224 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 14:12:07,243 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 14:12:07,288 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 14:12:07,289 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 14:12:07,289 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 14:12:07,289 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 14:12:07,289 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 14:12:07,289 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 14:12:07,290 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 14:12:07,290 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 14:12:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-07 14:12:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 14:12:07,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:12:07,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 14:12:07,329 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:12:07,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:07,336 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-07 14:12:07,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:12:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:07,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:12:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:07,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:12:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:07,545 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;havoc main_~string_A~5;havoc main_~string_B~5;havoc main_~i~5;havoc main_~j~5;havoc main_~nc_A~5;havoc main_~nc_B~5;main_~found~5 := 0;main_~i~5 := 0; {12#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-01-07 14:12:07,551 INFO L273 TraceCheckUtils]: 1: Hoare triple {12#(<= ULTIMATE.start_main_~i~5 0)} assume !(main_~i~5 < 5);assume !!(main_~string_A~5[4] == 0);main_~i~5 := 0; {11#false} is VALID [2019-01-07 14:12:07,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {11#false} assume !(main_~i~5 < 5);assume !!(main_~string_B~5[4] == 0);main_~nc_A~5 := 0;assume !(main_~string_A~5[main_~nc_A~5] != 0);main_~nc_B~5 := 0;assume !(main_~string_B~5[main_~nc_B~5] != 0);assume !!(main_~nc_B~5 >= main_~nc_A~5);main_~j~5 := 0;main_~i~5 := main_~j~5;assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);__VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 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 14:12:07,552 INFO L273 TraceCheckUtils]: 3: Hoare triple {11#false} assume !false; {11#false} is VALID [2019-01-07 14:12:07,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:12:07,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:12:07,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 14:12:07,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:12:07,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-07 14:12:07,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:07,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 14:12:07,610 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 14:12:07,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 14:12:07,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 14:12:07,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:12:07,623 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-07 14:12:07,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:07,789 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-07 14:12:07,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 14:12:07,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-07 14:12:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:07,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:12:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-07 14:12:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:12:07,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-07 14:12:07,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2019-01-07 14:12:07,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:07,923 INFO L225 Difference]: With dead ends: 12 [2019-01-07 14:12:07,923 INFO L226 Difference]: Without dead ends: 7 [2019-01-07 14:12:07,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:12:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-07 14:12:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-07 14:12:07,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:07,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-01-07 14:12:07,991 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-07 14:12:07,991 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-07 14:12:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:07,993 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-01-07 14:12:07,993 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-07 14:12:07,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:07,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:07,994 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-01-07 14:12:07,994 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-01-07 14:12:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:07,996 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-01-07 14:12:07,996 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-07 14:12:07,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:07,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:07,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:07,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 14:12:07,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-07 14:12:08,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-07 14:12:08,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:08,001 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-07 14:12:08,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 14:12:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-07 14:12:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 14:12:08,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:12:08,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-07 14:12:08,003 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:12:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:08,004 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-07 14:12:08,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:12:08,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:08,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:12:08,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:08,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:12:08,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:08,119 INFO L273 TraceCheckUtils]: 0: Hoare triple {60#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;havoc main_~string_A~5;havoc main_~string_B~5;havoc main_~i~5;havoc main_~j~5;havoc main_~nc_A~5;havoc main_~nc_B~5;main_~found~5 := 0;main_~i~5 := 0; {62#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-01-07 14:12:08,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {62#(<= ULTIMATE.start_main_~i~5 0)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {63#(<= ULTIMATE.start_main_~i~5 1)} is VALID [2019-01-07 14:12:08,125 INFO L273 TraceCheckUtils]: 2: Hoare triple {63#(<= ULTIMATE.start_main_~i~5 1)} assume !(main_~i~5 < 5);assume !!(main_~string_A~5[4] == 0);main_~i~5 := 0; {61#false} is VALID [2019-01-07 14:12:08,125 INFO L273 TraceCheckUtils]: 3: Hoare triple {61#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {61#false} is VALID [2019-01-07 14:12:08,125 INFO L273 TraceCheckUtils]: 4: Hoare triple {61#false} assume !(main_~i~5 < 5);assume !!(main_~string_B~5[4] == 0);main_~nc_A~5 := 0;assume !(main_~string_A~5[main_~nc_A~5] != 0);main_~nc_B~5 := 0;assume !(main_~string_B~5[main_~nc_B~5] != 0);assume !!(main_~nc_B~5 >= main_~nc_A~5);main_~j~5 := 0;main_~i~5 := main_~j~5;assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);__VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {61#false} is VALID [2019-01-07 14:12:08,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {61#false} assume !false; {61#false} is VALID [2019-01-07 14:12:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 14:12:08,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:08,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:12:08,128 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-07 14:12:08,130 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-07 14:12:08,170 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 14:12:08,171 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:12:08,678 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 14:12:08,679 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 2 different actions 6 times. Never widened. Performed 206 root evaluator evaluations with a maximum evaluation depth of 5. Performed 206 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-07 14:12:08,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:08,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 14:12:08,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:08,687 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 14:12:08,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:12:08,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 14:12:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:08,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:12:09,002 INFO L273 TraceCheckUtils]: 0: Hoare triple {60#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;havoc main_~string_A~5;havoc main_~string_B~5;havoc main_~i~5;havoc main_~j~5;havoc main_~nc_A~5;havoc main_~nc_B~5;main_~found~5 := 0;main_~i~5 := 0; {62#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-01-07 14:12:09,007 INFO L273 TraceCheckUtils]: 1: Hoare triple {62#(<= ULTIMATE.start_main_~i~5 0)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {63#(<= ULTIMATE.start_main_~i~5 1)} is VALID [2019-01-07 14:12:09,012 INFO L273 TraceCheckUtils]: 2: Hoare triple {63#(<= ULTIMATE.start_main_~i~5 1)} assume !(main_~i~5 < 5);assume !!(main_~string_A~5[4] == 0);main_~i~5 := 0; {61#false} is VALID [2019-01-07 14:12:09,013 INFO L273 TraceCheckUtils]: 3: Hoare triple {61#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {61#false} is VALID [2019-01-07 14:12:09,013 INFO L273 TraceCheckUtils]: 4: Hoare triple {61#false} assume !(main_~i~5 < 5);assume !!(main_~string_B~5[4] == 0);main_~nc_A~5 := 0;assume !(main_~string_A~5[main_~nc_A~5] != 0);main_~nc_B~5 := 0;assume !(main_~string_B~5[main_~nc_B~5] != 0);assume !!(main_~nc_B~5 >= main_~nc_A~5);main_~j~5 := 0;main_~i~5 := main_~j~5;assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);__VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {61#false} is VALID [2019-01-07 14:12:09,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {61#false} assume !false; {61#false} is VALID [2019-01-07 14:12:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 14:12:09,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:12:09,196 INFO L273 TraceCheckUtils]: 5: Hoare triple {61#false} assume !false; {61#false} is VALID [2019-01-07 14:12:09,198 INFO L273 TraceCheckUtils]: 4: Hoare triple {61#false} assume !(main_~i~5 < 5);assume !!(main_~string_B~5[4] == 0);main_~nc_A~5 := 0;assume !(main_~string_A~5[main_~nc_A~5] != 0);main_~nc_B~5 := 0;assume !(main_~string_B~5[main_~nc_B~5] != 0);assume !!(main_~nc_B~5 >= main_~nc_A~5);main_~j~5 := 0;main_~i~5 := main_~j~5;assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);__VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {61#false} is VALID [2019-01-07 14:12:09,198 INFO L273 TraceCheckUtils]: 3: Hoare triple {61#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {61#false} is VALID [2019-01-07 14:12:09,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {91#(< ULTIMATE.start_main_~i~5 5)} assume !(main_~i~5 < 5);assume !!(main_~string_A~5[4] == 0);main_~i~5 := 0; {61#false} is VALID [2019-01-07 14:12:09,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {95#(< ULTIMATE.start_main_~i~5 4)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {91#(< ULTIMATE.start_main_~i~5 5)} is VALID [2019-01-07 14:12:09,222 INFO L273 TraceCheckUtils]: 0: Hoare triple {60#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;havoc main_~string_A~5;havoc main_~string_B~5;havoc main_~i~5;havoc main_~j~5;havoc main_~nc_A~5;havoc main_~nc_B~5;main_~found~5 := 0;main_~i~5 := 0; {95#(< ULTIMATE.start_main_~i~5 4)} is VALID [2019-01-07 14:12:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-07 14:12:09,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:12:09,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-07 14:12:09,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:12:09,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-07 14:12:09,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:09,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-07 14:12:09,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:09,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 14:12:09,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 14:12:09,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-07 14:12:09,329 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-01-07 14:12:09,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:09,526 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-07 14:12:09,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 14:12:09,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-07 14:12:09,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:09,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:12:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-07 14:12:09,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-07 14:12:09,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-07 14:12:09,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2019-01-07 14:12:09,607 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 14:12:09,608 INFO L225 Difference]: With dead ends: 13 [2019-01-07 14:12:09,609 INFO L226 Difference]: Without dead ends: 9 [2019-01-07 14:12:09,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-07 14:12:09,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-07 14:12:09,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-07 14:12:09,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:09,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2019-01-07 14:12:09,630 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-01-07 14:12:09,630 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-01-07 14:12:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:09,631 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-07 14:12:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-07 14:12:09,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:09,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:09,632 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2019-01-07 14:12:09,633 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2019-01-07 14:12:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:09,634 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-07 14:12:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-07 14:12:09,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:09,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:09,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:09,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:09,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-07 14:12:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-07 14:12:09,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-01-07 14:12:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:09,637 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-07 14:12:09,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 14:12:09,638 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-07 14:12:09,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 14:12:09,638 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:12:09,638 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-07 14:12:09,639 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:12:09,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:09,639 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-01-07 14:12:09,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:12:09,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:09,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:12:09,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:09,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:12:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:09,809 INFO L273 TraceCheckUtils]: 0: Hoare triple {155#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;havoc main_~string_A~5;havoc main_~string_B~5;havoc main_~i~5;havoc main_~j~5;havoc main_~nc_A~5;havoc main_~nc_B~5;main_~found~5 := 0;main_~i~5 := 0; {157#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-01-07 14:12:09,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {157#(<= ULTIMATE.start_main_~i~5 0)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {158#(<= ULTIMATE.start_main_~i~5 1)} is VALID [2019-01-07 14:12:09,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {158#(<= ULTIMATE.start_main_~i~5 1)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {159#(<= ULTIMATE.start_main_~i~5 2)} is VALID [2019-01-07 14:12:09,826 INFO L273 TraceCheckUtils]: 3: Hoare triple {159#(<= ULTIMATE.start_main_~i~5 2)} assume !(main_~i~5 < 5);assume !!(main_~string_A~5[4] == 0);main_~i~5 := 0; {156#false} is VALID [2019-01-07 14:12:09,827 INFO L273 TraceCheckUtils]: 4: Hoare triple {156#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {156#false} is VALID [2019-01-07 14:12:09,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {156#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {156#false} is VALID [2019-01-07 14:12:09,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {156#false} assume !(main_~i~5 < 5);assume !!(main_~string_B~5[4] == 0);main_~nc_A~5 := 0;assume !(main_~string_A~5[main_~nc_A~5] != 0);main_~nc_B~5 := 0;assume !(main_~string_B~5[main_~nc_B~5] != 0);assume !!(main_~nc_B~5 >= main_~nc_A~5);main_~j~5 := 0;main_~i~5 := main_~j~5;assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);__VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {156#false} is VALID [2019-01-07 14:12:09,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {156#false} assume !false; {156#false} is VALID [2019-01-07 14:12:09,828 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 14:12:09,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:09,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:12:09,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:12:09,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:12:09,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:09,829 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 14:12:09,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 14:12:09,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 14:12:09,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 14:12:09,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 14:12:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:09,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:12:10,258 INFO L273 TraceCheckUtils]: 0: Hoare triple {155#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;havoc main_~string_A~5;havoc main_~string_B~5;havoc main_~i~5;havoc main_~j~5;havoc main_~nc_A~5;havoc main_~nc_B~5;main_~found~5 := 0;main_~i~5 := 0; {157#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-01-07 14:12:10,277 INFO L273 TraceCheckUtils]: 1: Hoare triple {157#(<= ULTIMATE.start_main_~i~5 0)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {158#(<= ULTIMATE.start_main_~i~5 1)} is VALID [2019-01-07 14:12:10,287 INFO L273 TraceCheckUtils]: 2: Hoare triple {158#(<= ULTIMATE.start_main_~i~5 1)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {159#(<= ULTIMATE.start_main_~i~5 2)} is VALID [2019-01-07 14:12:10,290 INFO L273 TraceCheckUtils]: 3: Hoare triple {159#(<= ULTIMATE.start_main_~i~5 2)} assume !(main_~i~5 < 5);assume !!(main_~string_A~5[4] == 0);main_~i~5 := 0; {156#false} is VALID [2019-01-07 14:12:10,290 INFO L273 TraceCheckUtils]: 4: Hoare triple {156#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {156#false} is VALID [2019-01-07 14:12:10,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {156#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {156#false} is VALID [2019-01-07 14:12:10,291 INFO L273 TraceCheckUtils]: 6: Hoare triple {156#false} assume !(main_~i~5 < 5);assume !!(main_~string_B~5[4] == 0);main_~nc_A~5 := 0;assume !(main_~string_A~5[main_~nc_A~5] != 0);main_~nc_B~5 := 0;assume !(main_~string_B~5[main_~nc_B~5] != 0);assume !!(main_~nc_B~5 >= main_~nc_A~5);main_~j~5 := 0;main_~i~5 := main_~j~5;assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);__VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {156#false} is VALID [2019-01-07 14:12:10,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {156#false} assume !false; {156#false} is VALID [2019-01-07 14:12:10,292 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 14:12:10,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:12:10,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {156#false} assume !false; {156#false} is VALID [2019-01-07 14:12:10,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {156#false} assume !(main_~i~5 < 5);assume !!(main_~string_B~5[4] == 0);main_~nc_A~5 := 0;assume !(main_~string_A~5[main_~nc_A~5] != 0);main_~nc_B~5 := 0;assume !(main_~string_B~5[main_~nc_B~5] != 0);assume !!(main_~nc_B~5 >= main_~nc_A~5);main_~j~5 := 0;main_~i~5 := main_~j~5;assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);__VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {156#false} is VALID [2019-01-07 14:12:10,371 INFO L273 TraceCheckUtils]: 5: Hoare triple {156#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {156#false} is VALID [2019-01-07 14:12:10,372 INFO L273 TraceCheckUtils]: 4: Hoare triple {156#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {156#false} is VALID [2019-01-07 14:12:10,373 INFO L273 TraceCheckUtils]: 3: Hoare triple {196#(< ULTIMATE.start_main_~i~5 5)} assume !(main_~i~5 < 5);assume !!(main_~string_A~5[4] == 0);main_~i~5 := 0; {156#false} is VALID [2019-01-07 14:12:10,374 INFO L273 TraceCheckUtils]: 2: Hoare triple {200#(< ULTIMATE.start_main_~i~5 4)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {196#(< ULTIMATE.start_main_~i~5 5)} is VALID [2019-01-07 14:12:10,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {159#(<= ULTIMATE.start_main_~i~5 2)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {200#(< ULTIMATE.start_main_~i~5 4)} is VALID [2019-01-07 14:12:10,398 INFO L273 TraceCheckUtils]: 0: Hoare triple {155#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;havoc main_~string_A~5;havoc main_~string_B~5;havoc main_~i~5;havoc main_~j~5;havoc main_~nc_A~5;havoc main_~nc_B~5;main_~found~5 := 0;main_~i~5 := 0; {159#(<= ULTIMATE.start_main_~i~5 2)} is VALID [2019-01-07 14:12:10,399 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 14:12:10,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:12:10,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-01-07 14:12:10,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:12:10,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-07 14:12:10,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:10,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-01-07 14:12:10,430 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 14:12:10,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-07 14:12:10,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-07 14:12:10,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-07 14:12:10,432 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-07 14:12:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:10,536 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-07 14:12:10,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 14:12:10,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-07 14:12:10,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:12:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-01-07 14:12:10,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:12:10,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-01-07 14:12:10,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 17 transitions. [2019-01-07 14:12:10,580 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 14:12:10,581 INFO L225 Difference]: With dead ends: 16 [2019-01-07 14:12:10,581 INFO L226 Difference]: Without dead ends: 11 [2019-01-07 14:12:10,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-07 14:12:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-07 14:12:10,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-07 14:12:10,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:10,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2019-01-07 14:12:10,615 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-01-07 14:12:10,616 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-01-07 14:12:10,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:10,617 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-01-07 14:12:10,617 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-07 14:12:10,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:10,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:10,618 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2019-01-07 14:12:10,618 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-01-07 14:12:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:10,620 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-01-07 14:12:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-07 14:12:10,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:10,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:10,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:10,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:10,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 14:12:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-07 14:12:10,622 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-07 14:12:10,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:10,623 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-07 14:12:10,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-07 14:12:10,623 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-07 14:12:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 14:12:10,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:12:10,624 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-07 14:12:10,624 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:12:10,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:10,625 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-01-07 14:12:10,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:12:10,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:10,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 14:12:10,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:10,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:12:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:10,942 INFO L273 TraceCheckUtils]: 0: Hoare triple {277#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;havoc main_~string_A~5;havoc main_~string_B~5;havoc main_~i~5;havoc main_~j~5;havoc main_~nc_A~5;havoc main_~nc_B~5;main_~found~5 := 0;main_~i~5 := 0; {279#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-01-07 14:12:10,943 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#(<= ULTIMATE.start_main_~i~5 0)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {280#(<= ULTIMATE.start_main_~i~5 1)} is VALID [2019-01-07 14:12:10,943 INFO L273 TraceCheckUtils]: 2: Hoare triple {280#(<= ULTIMATE.start_main_~i~5 1)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {281#(<= ULTIMATE.start_main_~i~5 2)} is VALID [2019-01-07 14:12:10,944 INFO L273 TraceCheckUtils]: 3: Hoare triple {281#(<= ULTIMATE.start_main_~i~5 2)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {282#(<= ULTIMATE.start_main_~i~5 3)} is VALID [2019-01-07 14:12:10,945 INFO L273 TraceCheckUtils]: 4: Hoare triple {282#(<= ULTIMATE.start_main_~i~5 3)} assume !(main_~i~5 < 5);assume !!(main_~string_A~5[4] == 0);main_~i~5 := 0; {278#false} is VALID [2019-01-07 14:12:10,945 INFO L273 TraceCheckUtils]: 5: Hoare triple {278#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {278#false} is VALID [2019-01-07 14:12:10,945 INFO L273 TraceCheckUtils]: 6: Hoare triple {278#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {278#false} is VALID [2019-01-07 14:12:10,946 INFO L273 TraceCheckUtils]: 7: Hoare triple {278#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {278#false} is VALID [2019-01-07 14:12:10,946 INFO L273 TraceCheckUtils]: 8: Hoare triple {278#false} assume !(main_~i~5 < 5);assume !!(main_~string_B~5[4] == 0);main_~nc_A~5 := 0;assume !(main_~string_A~5[main_~nc_A~5] != 0);main_~nc_B~5 := 0;assume !(main_~string_B~5[main_~nc_B~5] != 0);assume !!(main_~nc_B~5 >= main_~nc_A~5);main_~j~5 := 0;main_~i~5 := main_~j~5;assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);__VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {278#false} is VALID [2019-01-07 14:12:10,946 INFO L273 TraceCheckUtils]: 9: Hoare triple {278#false} assume !false; {278#false} is VALID [2019-01-07 14:12:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-07 14:12:10,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:10,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:12:10,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:12:10,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:12:10,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:10,949 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 14:12:10,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 14:12:10,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 14:12:10,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 14:12:10,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 14:12:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:10,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:12:11,074 INFO L273 TraceCheckUtils]: 0: Hoare triple {277#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;havoc main_~string_A~5;havoc main_~string_B~5;havoc main_~i~5;havoc main_~j~5;havoc main_~nc_A~5;havoc main_~nc_B~5;main_~found~5 := 0;main_~i~5 := 0; {279#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-01-07 14:12:11,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#(<= ULTIMATE.start_main_~i~5 0)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {280#(<= ULTIMATE.start_main_~i~5 1)} is VALID [2019-01-07 14:12:11,077 INFO L273 TraceCheckUtils]: 2: Hoare triple {280#(<= ULTIMATE.start_main_~i~5 1)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {281#(<= ULTIMATE.start_main_~i~5 2)} is VALID [2019-01-07 14:12:11,081 INFO L273 TraceCheckUtils]: 3: Hoare triple {281#(<= ULTIMATE.start_main_~i~5 2)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {282#(<= ULTIMATE.start_main_~i~5 3)} is VALID [2019-01-07 14:12:11,082 INFO L273 TraceCheckUtils]: 4: Hoare triple {282#(<= ULTIMATE.start_main_~i~5 3)} assume !(main_~i~5 < 5);assume !!(main_~string_A~5[4] == 0);main_~i~5 := 0; {278#false} is VALID [2019-01-07 14:12:11,082 INFO L273 TraceCheckUtils]: 5: Hoare triple {278#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {278#false} is VALID [2019-01-07 14:12:11,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {278#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {278#false} is VALID [2019-01-07 14:12:11,083 INFO L273 TraceCheckUtils]: 7: Hoare triple {278#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {278#false} is VALID [2019-01-07 14:12:11,083 INFO L273 TraceCheckUtils]: 8: Hoare triple {278#false} assume !(main_~i~5 < 5);assume !!(main_~string_B~5[4] == 0);main_~nc_A~5 := 0;assume !(main_~string_A~5[main_~nc_A~5] != 0);main_~nc_B~5 := 0;assume !(main_~string_B~5[main_~nc_B~5] != 0);assume !!(main_~nc_B~5 >= main_~nc_A~5);main_~j~5 := 0;main_~i~5 := main_~j~5;assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);__VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {278#false} is VALID [2019-01-07 14:12:11,084 INFO L273 TraceCheckUtils]: 9: Hoare triple {278#false} assume !false; {278#false} is VALID [2019-01-07 14:12:11,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-07 14:12:11,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:12:11,196 INFO L273 TraceCheckUtils]: 9: Hoare triple {278#false} assume !false; {278#false} is VALID [2019-01-07 14:12:11,197 INFO L273 TraceCheckUtils]: 8: Hoare triple {278#false} assume !(main_~i~5 < 5);assume !!(main_~string_B~5[4] == 0);main_~nc_A~5 := 0;assume !(main_~string_A~5[main_~nc_A~5] != 0);main_~nc_B~5 := 0;assume !(main_~string_B~5[main_~nc_B~5] != 0);assume !!(main_~nc_B~5 >= main_~nc_A~5);main_~j~5 := 0;main_~i~5 := main_~j~5;assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);__VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {278#false} is VALID [2019-01-07 14:12:11,197 INFO L273 TraceCheckUtils]: 7: Hoare triple {278#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {278#false} is VALID [2019-01-07 14:12:11,197 INFO L273 TraceCheckUtils]: 6: Hoare triple {278#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {278#false} is VALID [2019-01-07 14:12:11,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {278#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {278#false} is VALID [2019-01-07 14:12:11,198 INFO L273 TraceCheckUtils]: 4: Hoare triple {328#(< ULTIMATE.start_main_~i~5 5)} assume !(main_~i~5 < 5);assume !!(main_~string_A~5[4] == 0);main_~i~5 := 0; {278#false} is VALID [2019-01-07 14:12:11,202 INFO L273 TraceCheckUtils]: 3: Hoare triple {282#(<= ULTIMATE.start_main_~i~5 3)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {328#(< ULTIMATE.start_main_~i~5 5)} is VALID [2019-01-07 14:12:11,203 INFO L273 TraceCheckUtils]: 2: Hoare triple {281#(<= ULTIMATE.start_main_~i~5 2)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {282#(<= ULTIMATE.start_main_~i~5 3)} is VALID [2019-01-07 14:12:11,204 INFO L273 TraceCheckUtils]: 1: Hoare triple {280#(<= ULTIMATE.start_main_~i~5 1)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {281#(<= ULTIMATE.start_main_~i~5 2)} is VALID [2019-01-07 14:12:11,204 INFO L273 TraceCheckUtils]: 0: Hoare triple {277#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;havoc main_~string_A~5;havoc main_~string_B~5;havoc main_~i~5;havoc main_~j~5;havoc main_~nc_A~5;havoc main_~nc_B~5;main_~found~5 := 0;main_~i~5 := 0; {280#(<= ULTIMATE.start_main_~i~5 1)} is VALID [2019-01-07 14:12:11,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-07 14:12:11,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:12:11,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2019-01-07 14:12:11,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:12:11,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-07 14:12:11,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:11,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-07 14:12:11,233 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:11,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 14:12:11,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 14:12:11,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-07 14:12:11,235 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-01-07 14:12:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:11,329 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-07 14:12:11,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 14:12:11,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-07 14:12:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 14:12:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2019-01-07 14:12:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 14:12:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2019-01-07 14:12:11,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 19 transitions. [2019-01-07 14:12:11,378 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 14:12:11,379 INFO L225 Difference]: With dead ends: 19 [2019-01-07 14:12:11,379 INFO L226 Difference]: Without dead ends: 13 [2019-01-07 14:12:11,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-07 14:12:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-07 14:12:11,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-07 14:12:11,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:11,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2019-01-07 14:12:11,396 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-01-07 14:12:11,396 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-01-07 14:12:11,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:11,397 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-01-07 14:12:11,397 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-07 14:12:11,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:11,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:11,397 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2019-01-07 14:12:11,398 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2019-01-07 14:12:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:11,399 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-01-07 14:12:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-07 14:12:11,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:11,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:11,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:11,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-07 14:12:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-07 14:12:11,401 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-07 14:12:11,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:11,402 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-07 14:12:11,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 14:12:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-07 14:12:11,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-07 14:12:11,402 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:12:11,402 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-07 14:12:11,403 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:12:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:11,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-01-07 14:12:11,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:12:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:11,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 14:12:11,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:11,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:12:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:11,532 INFO L273 TraceCheckUtils]: 0: Hoare triple {425#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;havoc main_~string_A~5;havoc main_~string_B~5;havoc main_~i~5;havoc main_~j~5;havoc main_~nc_A~5;havoc main_~nc_B~5;main_~found~5 := 0;main_~i~5 := 0; {427#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-01-07 14:12:11,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {427#(<= ULTIMATE.start_main_~i~5 0)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {428#(<= ULTIMATE.start_main_~i~5 1)} is VALID [2019-01-07 14:12:11,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {428#(<= ULTIMATE.start_main_~i~5 1)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {429#(<= ULTIMATE.start_main_~i~5 2)} is VALID [2019-01-07 14:12:11,538 INFO L273 TraceCheckUtils]: 3: Hoare triple {429#(<= ULTIMATE.start_main_~i~5 2)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {430#(<= ULTIMATE.start_main_~i~5 3)} is VALID [2019-01-07 14:12:11,539 INFO L273 TraceCheckUtils]: 4: Hoare triple {430#(<= ULTIMATE.start_main_~i~5 3)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {431#(<= ULTIMATE.start_main_~i~5 4)} is VALID [2019-01-07 14:12:11,540 INFO L273 TraceCheckUtils]: 5: Hoare triple {431#(<= ULTIMATE.start_main_~i~5 4)} assume !(main_~i~5 < 5);assume !!(main_~string_A~5[4] == 0);main_~i~5 := 0; {426#false} is VALID [2019-01-07 14:12:11,540 INFO L273 TraceCheckUtils]: 6: Hoare triple {426#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {426#false} is VALID [2019-01-07 14:12:11,540 INFO L273 TraceCheckUtils]: 7: Hoare triple {426#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {426#false} is VALID [2019-01-07 14:12:11,540 INFO L273 TraceCheckUtils]: 8: Hoare triple {426#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {426#false} is VALID [2019-01-07 14:12:11,541 INFO L273 TraceCheckUtils]: 9: Hoare triple {426#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {426#false} is VALID [2019-01-07 14:12:11,541 INFO L273 TraceCheckUtils]: 10: Hoare triple {426#false} assume !(main_~i~5 < 5);assume !!(main_~string_B~5[4] == 0);main_~nc_A~5 := 0;assume !(main_~string_A~5[main_~nc_A~5] != 0);main_~nc_B~5 := 0;assume !(main_~string_B~5[main_~nc_B~5] != 0);assume !!(main_~nc_B~5 >= main_~nc_A~5);main_~j~5 := 0;main_~i~5 := main_~j~5;assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);__VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {426#false} is VALID [2019-01-07 14:12:11,541 INFO L273 TraceCheckUtils]: 11: Hoare triple {426#false} assume !false; {426#false} is VALID [2019-01-07 14:12:11,542 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 14:12:11,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:11,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:12:11,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 14:12:11,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 14:12:11,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:12:11,543 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 14:12:11,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:12:11,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 14:12:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:12:11,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 14:12:11,668 INFO L273 TraceCheckUtils]: 0: Hoare triple {425#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;havoc main_~string_A~5;havoc main_~string_B~5;havoc main_~i~5;havoc main_~j~5;havoc main_~nc_A~5;havoc main_~nc_B~5;main_~found~5 := 0;main_~i~5 := 0; {427#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-01-07 14:12:11,669 INFO L273 TraceCheckUtils]: 1: Hoare triple {427#(<= ULTIMATE.start_main_~i~5 0)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {428#(<= ULTIMATE.start_main_~i~5 1)} is VALID [2019-01-07 14:12:11,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {428#(<= ULTIMATE.start_main_~i~5 1)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {429#(<= ULTIMATE.start_main_~i~5 2)} is VALID [2019-01-07 14:12:11,671 INFO L273 TraceCheckUtils]: 3: Hoare triple {429#(<= ULTIMATE.start_main_~i~5 2)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {430#(<= ULTIMATE.start_main_~i~5 3)} is VALID [2019-01-07 14:12:11,672 INFO L273 TraceCheckUtils]: 4: Hoare triple {430#(<= ULTIMATE.start_main_~i~5 3)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {431#(<= ULTIMATE.start_main_~i~5 4)} is VALID [2019-01-07 14:12:11,673 INFO L273 TraceCheckUtils]: 5: Hoare triple {431#(<= ULTIMATE.start_main_~i~5 4)} assume !(main_~i~5 < 5);assume !!(main_~string_A~5[4] == 0);main_~i~5 := 0; {426#false} is VALID [2019-01-07 14:12:11,674 INFO L273 TraceCheckUtils]: 6: Hoare triple {426#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {426#false} is VALID [2019-01-07 14:12:11,674 INFO L273 TraceCheckUtils]: 7: Hoare triple {426#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {426#false} is VALID [2019-01-07 14:12:11,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {426#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {426#false} is VALID [2019-01-07 14:12:11,675 INFO L273 TraceCheckUtils]: 9: Hoare triple {426#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {426#false} is VALID [2019-01-07 14:12:11,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {426#false} assume !(main_~i~5 < 5);assume !!(main_~string_B~5[4] == 0);main_~nc_A~5 := 0;assume !(main_~string_A~5[main_~nc_A~5] != 0);main_~nc_B~5 := 0;assume !(main_~string_B~5[main_~nc_B~5] != 0);assume !!(main_~nc_B~5 >= main_~nc_A~5);main_~j~5 := 0;main_~i~5 := main_~j~5;assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);__VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {426#false} is VALID [2019-01-07 14:12:11,675 INFO L273 TraceCheckUtils]: 11: Hoare triple {426#false} assume !false; {426#false} is VALID [2019-01-07 14:12:11,676 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 14:12:11,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 14:12:11,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {426#false} assume !false; {426#false} is VALID [2019-01-07 14:12:11,748 INFO L273 TraceCheckUtils]: 10: Hoare triple {426#false} assume !(main_~i~5 < 5);assume !!(main_~string_B~5[4] == 0);main_~nc_A~5 := 0;assume !(main_~string_A~5[main_~nc_A~5] != 0);main_~nc_B~5 := 0;assume !(main_~string_B~5[main_~nc_B~5] != 0);assume !!(main_~nc_B~5 >= main_~nc_A~5);main_~j~5 := 0;main_~i~5 := main_~j~5;assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5);main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5);__VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {426#false} is VALID [2019-01-07 14:12:11,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {426#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {426#false} is VALID [2019-01-07 14:12:11,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {426#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {426#false} is VALID [2019-01-07 14:12:11,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {426#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {426#false} is VALID [2019-01-07 14:12:11,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {426#false} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127;main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3];havoc main_#t~nondet3;main_#t~post2 := main_~i~5;main_~i~5 := main_#t~post2 + 1;havoc main_#t~post2; {426#false} is VALID [2019-01-07 14:12:11,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {431#(<= ULTIMATE.start_main_~i~5 4)} assume !(main_~i~5 < 5);assume !!(main_~string_A~5[4] == 0);main_~i~5 := 0; {426#false} is VALID [2019-01-07 14:12:11,755 INFO L273 TraceCheckUtils]: 4: Hoare triple {430#(<= ULTIMATE.start_main_~i~5 3)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {431#(<= ULTIMATE.start_main_~i~5 4)} is VALID [2019-01-07 14:12:11,757 INFO L273 TraceCheckUtils]: 3: Hoare triple {429#(<= ULTIMATE.start_main_~i~5 2)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {430#(<= ULTIMATE.start_main_~i~5 3)} is VALID [2019-01-07 14:12:11,758 INFO L273 TraceCheckUtils]: 2: Hoare triple {428#(<= ULTIMATE.start_main_~i~5 1)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {429#(<= ULTIMATE.start_main_~i~5 2)} is VALID [2019-01-07 14:12:11,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {427#(<= ULTIMATE.start_main_~i~5 0)} assume !!(main_~i~5 < 5);assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127;main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1];havoc main_#t~nondet1;main_#t~post0 := main_~i~5;main_~i~5 := main_#t~post0 + 1;havoc main_#t~post0; {428#(<= ULTIMATE.start_main_~i~5 1)} is VALID [2019-01-07 14:12:11,763 INFO L273 TraceCheckUtils]: 0: Hoare triple {425#true} havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5;havoc main_~string_A~5;havoc main_~string_B~5;havoc main_~i~5;havoc main_~j~5;havoc main_~nc_A~5;havoc main_~nc_B~5;main_~found~5 := 0;main_~i~5 := 0; {427#(<= ULTIMATE.start_main_~i~5 0)} is VALID [2019-01-07 14:12:11,763 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 14:12:11,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 14:12:11,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-01-07 14:12:11,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 14:12:11,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-07 14:12:11,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:12:11,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-01-07 14:12:11,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:11,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 14:12:11,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 14:12:11,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-07 14:12:11,797 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-07 14:12:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:11,905 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-07 14:12:11,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 14:12:11,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-07 14:12:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:12:11,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 14:12:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2019-01-07 14:12:11,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 14:12:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2019-01-07 14:12:11,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2019-01-07 14:12:11,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:12:11,949 INFO L225 Difference]: With dead ends: 22 [2019-01-07 14:12:11,949 INFO L226 Difference]: Without dead ends: 15 [2019-01-07 14:12:11,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-07 14:12:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-07 14:12:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-07 14:12:11,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:12:11,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2019-01-07 14:12:11,962 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2019-01-07 14:12:11,962 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2019-01-07 14:12:11,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:11,963 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-07 14:12:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-07 14:12:11,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:11,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:11,964 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2019-01-07 14:12:11,964 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2019-01-07 14:12:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:12:11,966 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-07 14:12:11,966 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-07 14:12:11,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:12:11,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:12:11,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:12:11,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:12:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-07 14:12:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-07 14:12:11,968 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-07 14:12:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:12:11,968 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-07 14:12:11,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 14:12:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-07 14:12:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-07 14:12:11,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:12:11,969 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-07 14:12:11,969 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:12:11,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:12:11,970 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-01-07 14:12:11,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:12:11,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:11,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:12:11,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:12:11,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:12:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-07 14:12:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-07 14:12:12,152 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-07 14:12:12,180 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-01-07 14:12:12,181 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2019-01-07 14:12:12,181 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2019-01-07 14:12:12,181 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2019-01-07 14:12:12,181 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2019-01-07 14:12:12,181 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2019-01-07 14:12:12,181 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2019-01-07 14:12:12,181 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2019-01-07 14:12:12,181 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-01-07 14:12:12,187 INFO L202 PluginConnector]: Adding new model string.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.01 02:12:12 BoogieIcfgContainer [2019-01-07 14:12:12,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-07 14:12:12,188 INFO L168 Benchmark]: Toolchain (without parser) took 5560.26 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 702.5 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -588.3 MB). Peak memory consumption was 114.2 MB. Max. memory is 7.1 GB. [2019-01-07 14:12:12,190 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 14:12:12,191 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 14:12:12,191 INFO L168 Benchmark]: Boogie Preprocessor took 29.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 14:12:12,192 INFO L168 Benchmark]: RCFGBuilder took 485.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-01-07 14:12:12,193 INFO L168 Benchmark]: TraceAbstraction took 4992.66 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 702.5 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -609.5 MB). Peak memory consumption was 93.1 MB. Max. memory is 7.1 GB. [2019-01-07 14:12:12,196 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.47 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.53 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 485.76 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4992.66 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 702.5 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -609.5 MB). Peak memory consumption was 93.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 89]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: overapproximation of shiftLeft at line 72. Possible FailurePath: [L23] havoc main_#res; [L24] havoc main_#t~nondet1, main_#t~post0, main_#t~nondet3, main_#t~post2, main_#t~post4, main_#t~post5, main_#t~post6, main_#t~post7, main_~string_A~5, main_~string_B~5, main_~i~5, main_~j~5, main_~nc_A~5, main_~nc_B~5, main_~found~5; [L25] havoc main_~string_A~5; [L26] havoc main_~string_B~5; [L27] havoc main_~i~5; [L28] havoc main_~j~5; [L29] havoc main_~nc_A~5; [L30] havoc main_~nc_B~5; [L31] main_~found~5 := 0; [L32] main_~i~5 := 0; VAL [main_~found~5=0, main_~i~5=0] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=1] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=2] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=3] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=4] [L45] assume !!(main_~i~5 < 5); [L46] assume -128 <= main_#t~nondet1 && main_#t~nondet1 <= 127; [L47] main_~string_A~5 := main_~string_A~5[main_~i~5 := main_#t~nondet1]; [L48] havoc main_#t~nondet1; [L49] main_#t~post0 := main_~i~5; [L50] main_~i~5 := main_#t~post0 + 1; [L51] havoc main_#t~post0; VAL [main_~found~5=0, main_~i~5=5] [L40] assume !(main_~i~5 < 5); [L41] assume !!(main_~string_A~5[4] == 0); [L42] main_~i~5 := 0; VAL [main_~found~5=0, main_~i~5=0] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=1] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=2] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=3] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=4] [L80] assume !!(main_~i~5 < 5); [L81] assume -128 <= main_#t~nondet3 && main_#t~nondet3 <= 127; [L82] main_~string_B~5 := main_~string_B~5[main_~i~5 := main_#t~nondet3]; [L83] havoc main_#t~nondet3; [L84] main_#t~post2 := main_~i~5; [L85] main_~i~5 := main_#t~post2 + 1; [L86] havoc main_#t~post2; VAL [main_~found~5=0, main_~i~5=5] [L59] assume !(main_~i~5 < 5); [L60] assume !!(main_~string_B~5[4] == 0); [L61] main_~nc_A~5 := 0; [L63] assume !(main_~string_A~5[main_~nc_A~5] != 0); [L64] main_~nc_B~5 := 0; [L66] assume !(main_~string_B~5[main_~nc_B~5] != 0); [L67] assume !!(main_~nc_B~5 >= main_~nc_A~5); [L68] main_~j~5 := 0; [L69] main_~i~5 := main_~j~5; [L71] assume !(main_~i~5 < main_~nc_A~5 && main_~j~5 < main_~nc_B~5); [L72] main_~found~5 := ~shiftLeft((if main_~j~5 > main_~nc_B~5 - 1 then 1 else 0), main_~i~5); [L73] __VERIFIER_assert_#in~cond := (if main_~found~5 == 0 || main_~found~5 == 1 then 1 else 0); [L74] havoc __VERIFIER_assert_~cond; [L75] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L76] assume __VERIFIER_assert_~cond == 0; [L77] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~found~5=5, main_~i~5=0, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0] [L89] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~found~5=5, main_~i~5=0, main_~j~5=0, main_~nc_A~5=0, main_~nc_B~5=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. UNSAFE Result, 4.9s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20 SDtfs, 5 SDslu, 0 SDs, 0 SdLazy, 40 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 55 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 1575 SizeOfPredicates, 0 NumberOfNonLiveVariables, 260 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 60/120 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...