java -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/toy/tooDifficultLoopInvariant/PointerIncrement.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 16:54:25,954 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 16:54:25,960 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 16:54:25,976 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 16:54:25,976 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 16:54:25,977 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 16:54:25,980 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 16:54:25,983 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 16:54:25,986 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 16:54:25,988 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 16:54:25,989 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 16:54:25,989 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 16:54:25,991 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 16:54:25,992 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 16:54:25,995 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 16:54:25,995 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 16:54:26,003 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 16:54:26,006 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 16:54:26,008 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 16:54:26,009 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 16:54:26,014 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 16:54:26,015 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 16:54:26,017 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 16:54:26,018 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 16:54:26,018 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 16:54:26,019 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 16:54:26,021 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 16:54:26,023 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 16:54:26,024 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 16:54:26,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 16:54:26,026 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 16:54:26,026 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 16:54:26,027 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 16:54:26,027 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 16:54:26,029 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 16:54:26,030 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 16:54:26,030 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-31 16:54:26,053 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 16:54:26,057 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 16:54:26,058 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 16:54:26,058 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 16:54:26,058 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 16:54:26,058 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 16:54:26,059 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 16:54:26,059 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 16:54:26,062 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 16:54:26,062 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 16:54:26,062 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 16:54:26,062 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 16:54:26,063 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 16:54:26,063 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 16:54:26,063 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 16:54:26,064 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 16:54:26,064 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 16:54:26,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 16:54:26,064 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 16:54:26,064 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 16:54:26,066 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 16:54:26,066 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 16:54:26,066 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 16:54:26,067 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 16:54:26,067 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 16:54:26,067 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 16:54:26,067 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 16:54:26,067 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 16:54:26,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 16:54:26,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 16:54:26,068 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 16:54:26,068 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 16:54:26,068 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 16:54:26,069 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 16:54:26,069 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 16:54:26,069 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 16:54:26,069 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 16:54:26,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 16:54:26,069 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 16:54:26,070 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 16:54:26,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 16:54:26,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 16:54:26,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 16:54:26,125 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 16:54:26,126 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 16:54:26,127 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2019-01-31 16:54:26,127 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2019-01-31 16:54:26,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 16:54:26,195 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 16:54:26,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 16:54:26,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 16:54:26,196 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 16:54:26,213 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:26" (1/1) ... [2019-01-31 16:54:26,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:26" (1/1) ... [2019-01-31 16:54:26,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 16:54:26,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 16:54:26,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 16:54:26,258 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 16:54:26,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:26" (1/1) ... [2019-01-31 16:54:26,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:26" (1/1) ... [2019-01-31 16:54:26,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:26" (1/1) ... [2019-01-31 16:54:26,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:26" (1/1) ... [2019-01-31 16:54:26,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:26" (1/1) ... [2019-01-31 16:54:26,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:26" (1/1) ... [2019-01-31 16:54:26,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:26" (1/1) ... [2019-01-31 16:54:26,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 16:54:26,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 16:54:26,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 16:54:26,290 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 16:54:26,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:26" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 16:54:26,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 16:54:26,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 16:54:26,615 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 16:54:26,615 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-31 16:54:26,617 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:54:26 BoogieIcfgContainer [2019-01-31 16:54:26,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 16:54:26,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 16:54:26,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 16:54:26,623 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 16:54:26,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 04:54:26" (1/2) ... [2019-01-31 16:54:26,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455ddb30 and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 04:54:26, skipping insertion in model container [2019-01-31 16:54:26,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 04:54:26" (2/2) ... [2019-01-31 16:54:26,626 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2019-01-31 16:54:26,636 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 16:54:26,644 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-31 16:54:26,661 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-31 16:54:26,693 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 16:54:26,693 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 16:54:26,693 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 16:54:26,694 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 16:54:26,694 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 16:54:26,694 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 16:54:26,694 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 16:54:26,694 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 16:54:26,709 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-31 16:54:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 16:54:26,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:26,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 16:54:26,719 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:26,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:26,726 INFO L82 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2019-01-31 16:54:26,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:26,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:26,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:26,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:26,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:27,033 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-31 16:54:27,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 16:54:27,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 16:54:27,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 16:54:27,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 16:54:27,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 16:54:27,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 16:54:27,056 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2019-01-31 16:54:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:27,217 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-31 16:54:27,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 16:54:27,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 16:54:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:27,230 INFO L225 Difference]: With dead ends: 24 [2019-01-31 16:54:27,231 INFO L226 Difference]: Without dead ends: 11 [2019-01-31 16:54:27,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-31 16:54:27,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-31 16:54:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2019-01-31 16:54:27,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-31 16:54:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-31 16:54:27,268 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-01-31 16:54:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:27,268 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-31 16:54:27,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 16:54:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-31 16:54:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 16:54:27,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:27,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 16:54:27,270 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:27,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:27,270 INFO L82 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2019-01-31 16:54:27,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:27,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:27,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:27,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:27,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:27,574 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-31 16:54:27,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 16:54:27,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 16:54:27,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 16:54:27,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 16:54:27,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 16:54:27,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 16:54:27,580 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-01-31 16:54:27,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:27,909 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-31 16:54:27,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 16:54:27,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-31 16:54:27,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:27,911 INFO L225 Difference]: With dead ends: 18 [2019-01-31 16:54:27,911 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 16:54:27,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-31 16:54:27,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 16:54:27,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-01-31 16:54:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 16:54:27,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-31 16:54:27,917 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2019-01-31 16:54:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:27,917 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-31 16:54:27,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 16:54:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-31 16:54:27,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 16:54:27,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:27,918 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 16:54:27,918 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:27,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:27,919 INFO L82 PathProgramCache]: Analyzing trace with hash 473213613, now seen corresponding path program 1 times [2019-01-31 16:54:27,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:27,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:27,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:27,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:27,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:27,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 16:54:27,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 16:54:27,970 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 16:54:27,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 16:54:27,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 16:54:27,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 16:54:27,972 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2019-01-31 16:54:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:27,990 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-31 16:54:27,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 16:54:27,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-31 16:54:27,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:27,992 INFO L225 Difference]: With dead ends: 19 [2019-01-31 16:54:27,992 INFO L226 Difference]: Without dead ends: 12 [2019-01-31 16:54:27,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 16:54:27,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-31 16:54:27,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-31 16:54:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 16:54:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-31 16:54:27,996 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-01-31 16:54:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:27,996 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-31 16:54:27,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 16:54:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-31 16:54:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-31 16:54:27,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:27,997 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-01-31 16:54:27,998 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:27,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:27,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1846021201, now seen corresponding path program 1 times [2019-01-31 16:54:27,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:28,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:28,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:28,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:28,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:28,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:28,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:28,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:28,165 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-01-31 16:54:28,167 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [9], [11], [12], [13], [21] [2019-01-31 16:54:28,206 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 16:54:28,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 16:54:28,373 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 16:54:28,377 INFO L272 AbstractInterpreter]: Visited 8 different actions 26 times. Merged at 6 different actions 18 times. Never widened. Performed 252 root evaluator evaluations with a maximum evaluation depth of 3. Performed 252 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 16:54:28,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:28,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 16:54:28,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:28,385 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-31 16:54:28,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:28,402 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:28,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:28,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:28,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:28,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:28,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:28,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:28,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:28,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-31 16:54:28,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:28,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 16:54:28,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 16:54:28,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-31 16:54:28,972 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2019-01-31 16:54:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:29,172 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-31 16:54:29,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 16:54:29,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-01-31 16:54:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:29,175 INFO L225 Difference]: With dead ends: 21 [2019-01-31 16:54:29,175 INFO L226 Difference]: Without dead ends: 20 [2019-01-31 16:54:29,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-31 16:54:29,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-31 16:54:29,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-31 16:54:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 16:54:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-31 16:54:29,184 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2019-01-31 16:54:29,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:29,184 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-31 16:54:29,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 16:54:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-31 16:54:29,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-31 16:54:29,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:29,186 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2019-01-31 16:54:29,186 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:29,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:29,186 INFO L82 PathProgramCache]: Analyzing trace with hash 506962407, now seen corresponding path program 2 times [2019-01-31 16:54:29,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:29,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:29,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:29,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:29,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:29,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:29,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:29,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:29,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:29,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:29,381 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-31 16:54:29,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:29,392 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:29,414 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 16:54:29,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:29,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:29,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:29,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:29,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:29,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:29,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:29,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:29,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2019-01-31 16:54:29,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:29,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 16:54:29,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 16:54:29,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-31 16:54:29,973 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-01-31 16:54:30,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:30,110 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-31 16:54:30,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 16:54:30,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-01-31 16:54:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:30,111 INFO L225 Difference]: With dead ends: 26 [2019-01-31 16:54:30,112 INFO L226 Difference]: Without dead ends: 25 [2019-01-31 16:54:30,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-31 16:54:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-31 16:54:30,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-01-31 16:54:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-31 16:54:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-31 16:54:30,117 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2019-01-31 16:54:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:30,118 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-31 16:54:30,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 16:54:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-31 16:54:30,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-31 16:54:30,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:30,119 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1] [2019-01-31 16:54:30,119 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:30,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:30,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1970543121, now seen corresponding path program 3 times [2019-01-31 16:54:30,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:30,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:30,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:30,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:30,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:30,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:30,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:30,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:30,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:30,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:30,348 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-31 16:54:30,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:30,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:30,382 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:30,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:30,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:30,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:30,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:30,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:30,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:30,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:30,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:30,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2019-01-31 16:54:30,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:30,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 16:54:30,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 16:54:30,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-31 16:54:30,663 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-01-31 16:54:30,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:30,922 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-31 16:54:30,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 16:54:30,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-01-31 16:54:30,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:30,925 INFO L225 Difference]: With dead ends: 31 [2019-01-31 16:54:30,925 INFO L226 Difference]: Without dead ends: 30 [2019-01-31 16:54:30,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2019-01-31 16:54:30,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-31 16:54:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-01-31 16:54:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-31 16:54:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-31 16:54:30,931 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2019-01-31 16:54:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:30,931 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-31 16:54:30,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 16:54:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-31 16:54:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-31 16:54:30,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:30,932 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2019-01-31 16:54:30,933 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:30,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:30,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1357786151, now seen corresponding path program 4 times [2019-01-31 16:54:30,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:30,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:30,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:30,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:30,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:31,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:31,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:31,048 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:31,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:31,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:31,048 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-31 16:54:31,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:31,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:31,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:31,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:31,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:31,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:31,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:31,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:31,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:31,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2019-01-31 16:54:31,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:31,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 16:54:31,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 16:54:31,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2019-01-31 16:54:31,372 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2019-01-31 16:54:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:31,604 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-31 16:54:31,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 16:54:31,607 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-01-31 16:54:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:31,608 INFO L225 Difference]: With dead ends: 36 [2019-01-31 16:54:31,608 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 16:54:31,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=371, Unknown=0, NotChecked=0, Total=600 [2019-01-31 16:54:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 16:54:31,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-31 16:54:31,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 16:54:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-31 16:54:31,615 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2019-01-31 16:54:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:31,616 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-31 16:54:31,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 16:54:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-31 16:54:31,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-31 16:54:31,617 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:31,617 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1] [2019-01-31 16:54:31,617 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:31,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:31,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1853487057, now seen corresponding path program 5 times [2019-01-31 16:54:31,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:31,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:31,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:31,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:31,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:31,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:31,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:31,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:31,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:31,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:31,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:31,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:31,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:31,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-31 16:54:31,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:31,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:31,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:31,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:31,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:31,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:32,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:32,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:32,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2019-01-31 16:54:32,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:32,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-31 16:54:32,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-31 16:54:32,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2019-01-31 16:54:32,160 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 16 states. [2019-01-31 16:54:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:32,650 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-31 16:54:32,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 16:54:32,650 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-01-31 16:54:32,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:32,652 INFO L225 Difference]: With dead ends: 41 [2019-01-31 16:54:32,652 INFO L226 Difference]: Without dead ends: 40 [2019-01-31 16:54:32,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=312, Invalid=500, Unknown=0, NotChecked=0, Total=812 [2019-01-31 16:54:32,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-31 16:54:32,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-01-31 16:54:32,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-31 16:54:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-31 16:54:32,659 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2019-01-31 16:54:32,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:32,660 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-31 16:54:32,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-31 16:54:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-31 16:54:32,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-31 16:54:32,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:32,661 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2019-01-31 16:54:32,661 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:32,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:32,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1716722073, now seen corresponding path program 6 times [2019-01-31 16:54:32,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:32,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:32,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:32,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:32,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:33,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:33,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:33,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:33,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:33,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:33,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:33,027 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:33,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:33,059 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:33,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:33,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:33,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:33,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:33,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:33,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:33,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:33,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:33,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2019-01-31 16:54:33,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:33,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-31 16:54:33,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-31 16:54:33,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2019-01-31 16:54:33,649 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2019-01-31 16:54:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:34,074 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-31 16:54:34,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 16:54:34,075 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2019-01-31 16:54:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:34,076 INFO L225 Difference]: With dead ends: 46 [2019-01-31 16:54:34,076 INFO L226 Difference]: Without dead ends: 45 [2019-01-31 16:54:34,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-01-31 16:54:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-31 16:54:34,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-01-31 16:54:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-31 16:54:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-31 16:54:34,083 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2019-01-31 16:54:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:34,084 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-31 16:54:34,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-31 16:54:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-31 16:54:34,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-31 16:54:34,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:34,085 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1] [2019-01-31 16:54:34,085 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:34,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:34,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1089100399, now seen corresponding path program 7 times [2019-01-31 16:54:34,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:34,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:34,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:34,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:34,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:34,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:34,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:34,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:34,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:34,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:34,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:34,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:34,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:34,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:34,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:34,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:34,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:34,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:34,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:34,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:34,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2019-01-31 16:54:34,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:34,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-31 16:54:34,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-31 16:54:34,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=499, Unknown=0, NotChecked=0, Total=812 [2019-01-31 16:54:34,728 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 20 states. [2019-01-31 16:54:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:34,963 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-31 16:54:34,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 16:54:34,969 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-01-31 16:54:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:34,970 INFO L225 Difference]: With dead ends: 51 [2019-01-31 16:54:34,971 INFO L226 Difference]: Without dead ends: 50 [2019-01-31 16:54:34,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=517, Invalid=815, Unknown=0, NotChecked=0, Total=1332 [2019-01-31 16:54:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-31 16:54:34,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-01-31 16:54:34,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 16:54:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-31 16:54:34,984 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2019-01-31 16:54:34,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:34,984 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-31 16:54:34,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-31 16:54:34,984 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-31 16:54:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-31 16:54:34,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:34,986 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1] [2019-01-31 16:54:34,986 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:34,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:34,986 INFO L82 PathProgramCache]: Analyzing trace with hash -268971865, now seen corresponding path program 8 times [2019-01-31 16:54:34,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:34,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:34,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:34,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:34,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:35,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:35,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:35,607 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:35,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:35,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:35,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:35,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:35,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:35,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-31 16:54:35,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:35,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:35,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:35,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:35,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:35,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:35,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:36,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:36,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2019-01-31 16:54:36,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:36,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-31 16:54:36,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-31 16:54:36,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=605, Unknown=0, NotChecked=0, Total=992 [2019-01-31 16:54:36,125 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2019-01-31 16:54:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:36,494 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-31 16:54:36,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-31 16:54:36,494 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-01-31 16:54:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:36,495 INFO L225 Difference]: With dead ends: 56 [2019-01-31 16:54:36,495 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 16:54:36,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=639, Invalid=1001, Unknown=0, NotChecked=0, Total=1640 [2019-01-31 16:54:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 16:54:36,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-31 16:54:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-31 16:54:36,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-31 16:54:36,504 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2019-01-31 16:54:36,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:36,504 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-31 16:54:36,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-31 16:54:36,505 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-31 16:54:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-31 16:54:36,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:36,506 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1] [2019-01-31 16:54:36,506 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:36,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:36,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2109529263, now seen corresponding path program 9 times [2019-01-31 16:54:36,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:36,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:36,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:36,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:36,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:36,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:36,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:36,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:36,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:36,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:36,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:36,848 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:36,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:36,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:36,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:36,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:36,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:36,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:36,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:36,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:37,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:37,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:37,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2019-01-31 16:54:37,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:37,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-31 16:54:37,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-31 16:54:37,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=721, Unknown=0, NotChecked=0, Total=1190 [2019-01-31 16:54:37,319 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 24 states. [2019-01-31 16:54:37,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:37,724 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-31 16:54:37,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-31 16:54:37,724 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2019-01-31 16:54:37,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:37,725 INFO L225 Difference]: With dead ends: 61 [2019-01-31 16:54:37,725 INFO L226 Difference]: Without dead ends: 60 [2019-01-31 16:54:37,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=774, Invalid=1206, Unknown=0, NotChecked=0, Total=1980 [2019-01-31 16:54:37,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-31 16:54:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-01-31 16:54:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-31 16:54:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-31 16:54:37,743 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2019-01-31 16:54:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:37,743 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-31 16:54:37,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-31 16:54:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-31 16:54:37,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-31 16:54:37,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:37,747 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1] [2019-01-31 16:54:37,747 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:37,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:37,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1236079897, now seen corresponding path program 10 times [2019-01-31 16:54:37,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:37,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:37,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:37,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:37,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:38,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:38,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:38,093 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:38,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:38,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:38,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:38,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:38,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:38,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:38,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:38,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:38,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:38,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:38,402 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:38,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:38,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:38,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2019-01-31 16:54:38,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:38,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-31 16:54:38,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-31 16:54:38,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=847, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 16:54:38,748 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2019-01-31 16:54:39,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:39,087 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-31 16:54:39,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-31 16:54:39,088 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-01-31 16:54:39,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:39,088 INFO L225 Difference]: With dead ends: 66 [2019-01-31 16:54:39,089 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 16:54:39,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=922, Invalid=1430, Unknown=0, NotChecked=0, Total=2352 [2019-01-31 16:54:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 16:54:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-01-31 16:54:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-31 16:54:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-31 16:54:39,099 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2019-01-31 16:54:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:39,100 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-31 16:54:39,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-31 16:54:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-31 16:54:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-31 16:54:39,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:39,101 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1] [2019-01-31 16:54:39,101 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:39,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1207857425, now seen corresponding path program 11 times [2019-01-31 16:54:39,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:39,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:39,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:39,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:39,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:39,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:39,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:39,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:39,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:39,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:39,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:39,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:39,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-31 16:54:39,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:39,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:39,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:39,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:39,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:39,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:39,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:40,164 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:40,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:40,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2019-01-31 16:54:40,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:40,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-31 16:54:40,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-31 16:54:40,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=983, Unknown=0, NotChecked=0, Total=1640 [2019-01-31 16:54:40,184 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 28 states. [2019-01-31 16:54:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:40,574 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-31 16:54:40,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-31 16:54:40,575 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2019-01-31 16:54:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:40,576 INFO L225 Difference]: With dead ends: 71 [2019-01-31 16:54:40,577 INFO L226 Difference]: Without dead ends: 70 [2019-01-31 16:54:40,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1083, Invalid=1673, Unknown=0, NotChecked=0, Total=2756 [2019-01-31 16:54:40,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-31 16:54:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-01-31 16:54:40,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-31 16:54:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-31 16:54:40,589 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2019-01-31 16:54:40,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:40,589 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-31 16:54:40,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-31 16:54:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-31 16:54:40,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-31 16:54:40,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:40,591 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1] [2019-01-31 16:54:40,591 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:40,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:40,591 INFO L82 PathProgramCache]: Analyzing trace with hash -96324313, now seen corresponding path program 12 times [2019-01-31 16:54:40,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:40,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:40,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:40,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:40,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:40,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:40,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:40,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:40,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:40,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:40,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:40,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:40,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:41,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:41,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:41,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:41,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:41,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:41,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:41,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:41,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:41,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:41,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2019-01-31 16:54:41,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:41,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-31 16:54:41,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-31 16:54:41,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=1129, Unknown=0, NotChecked=0, Total=1892 [2019-01-31 16:54:41,922 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 30 states. [2019-01-31 16:54:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:42,480 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-31 16:54:42,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-31 16:54:42,481 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2019-01-31 16:54:42,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:42,482 INFO L225 Difference]: With dead ends: 76 [2019-01-31 16:54:42,482 INFO L226 Difference]: Without dead ends: 75 [2019-01-31 16:54:42,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1257, Invalid=1935, Unknown=0, NotChecked=0, Total=3192 [2019-01-31 16:54:42,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-31 16:54:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-01-31 16:54:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-31 16:54:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-31 16:54:42,496 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 66 [2019-01-31 16:54:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:42,496 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-31 16:54:42,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-31 16:54:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-31 16:54:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-31 16:54:42,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:42,497 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1] [2019-01-31 16:54:42,498 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:42,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:42,498 INFO L82 PathProgramCache]: Analyzing trace with hash -716992815, now seen corresponding path program 13 times [2019-01-31 16:54:42,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:42,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:42,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:42,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:42,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:43,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:43,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:43,362 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:43,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:43,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:43,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:43,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:43,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:43,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:43,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:43,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:43,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:43,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:43,659 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:43,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:44,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:44,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2019-01-31 16:54:44,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:44,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-31 16:54:44,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-31 16:54:44,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2019-01-31 16:54:44,037 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 32 states. [2019-01-31 16:54:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:44,579 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-31 16:54:44,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-31 16:54:44,579 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2019-01-31 16:54:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:44,580 INFO L225 Difference]: With dead ends: 81 [2019-01-31 16:54:44,580 INFO L226 Difference]: Without dead ends: 80 [2019-01-31 16:54:44,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1444, Invalid=2216, Unknown=0, NotChecked=0, Total=3660 [2019-01-31 16:54:44,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-31 16:54:44,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-01-31 16:54:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-31 16:54:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-31 16:54:44,592 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 71 [2019-01-31 16:54:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:44,593 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-31 16:54:44,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-31 16:54:44,593 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-31 16:54:44,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-31 16:54:44,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:44,594 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2019-01-31 16:54:44,594 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:44,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:44,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1270239385, now seen corresponding path program 14 times [2019-01-31 16:54:44,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:44,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:44,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:44,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:44,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:44,888 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:44,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:44,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:44,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:44,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:44,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:44,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:44,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:44,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:44,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-31 16:54:44,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:44,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:44,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:44,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:45,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:45,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:45,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:46,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:46,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 49 [2019-01-31 16:54:46,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:46,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-31 16:54:46,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-31 16:54:46,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=999, Invalid=1451, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 16:54:46,648 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 34 states. [2019-01-31 16:54:47,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:47,108 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-31 16:54:47,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-31 16:54:47,108 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2019-01-31 16:54:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:47,109 INFO L225 Difference]: With dead ends: 86 [2019-01-31 16:54:47,109 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 16:54:47,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1644, Invalid=2516, Unknown=0, NotChecked=0, Total=4160 [2019-01-31 16:54:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 16:54:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-01-31 16:54:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-31 16:54:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-31 16:54:47,122 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 76 [2019-01-31 16:54:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:47,122 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-31 16:54:47,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-31 16:54:47,123 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-31 16:54:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-31 16:54:47,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:47,123 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1] [2019-01-31 16:54:47,124 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:47,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:47,124 INFO L82 PathProgramCache]: Analyzing trace with hash -468812655, now seen corresponding path program 15 times [2019-01-31 16:54:47,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:47,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:47,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:47,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:47,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:47,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:47,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:47,376 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:47,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:47,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:47,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:47,385 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:47,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:47,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:47,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:47,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:47,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:47,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:47,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:47,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:47,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:48,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:48,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2019-01-31 16:54:48,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:48,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-31 16:54:48,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-31 16:54:48,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1129, Invalid=1627, Unknown=0, NotChecked=0, Total=2756 [2019-01-31 16:54:48,426 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 36 states. [2019-01-31 16:54:48,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:48,999 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-31 16:54:49,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-31 16:54:49,000 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2019-01-31 16:54:49,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:49,001 INFO L225 Difference]: With dead ends: 91 [2019-01-31 16:54:49,001 INFO L226 Difference]: Without dead ends: 90 [2019-01-31 16:54:49,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1857, Invalid=2835, Unknown=0, NotChecked=0, Total=4692 [2019-01-31 16:54:49,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-31 16:54:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-01-31 16:54:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-31 16:54:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-31 16:54:49,014 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 81 [2019-01-31 16:54:49,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:49,014 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-31 16:54:49,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-31 16:54:49,014 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-31 16:54:49,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-31 16:54:49,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:49,015 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1] [2019-01-31 16:54:49,015 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:49,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:49,016 INFO L82 PathProgramCache]: Analyzing trace with hash 132995495, now seen corresponding path program 16 times [2019-01-31 16:54:49,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:49,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:49,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:49,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:49,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:49,389 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:49,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:49,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:49,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:49,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:49,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:49,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:49,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:49,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:49,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:49,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:49,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:49,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:49,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:49,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:50,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:50,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 55 [2019-01-31 16:54:50,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:50,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-31 16:54:50,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-31 16:54:50,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1267, Invalid=1813, Unknown=0, NotChecked=0, Total=3080 [2019-01-31 16:54:50,301 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 38 states. [2019-01-31 16:54:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:50,881 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-31 16:54:50,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-31 16:54:50,882 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2019-01-31 16:54:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:50,883 INFO L225 Difference]: With dead ends: 96 [2019-01-31 16:54:50,883 INFO L226 Difference]: Without dead ends: 95 [2019-01-31 16:54:50,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2083, Invalid=3173, Unknown=0, NotChecked=0, Total=5256 [2019-01-31 16:54:50,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-31 16:54:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-01-31 16:54:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-31 16:54:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-31 16:54:50,893 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 86 [2019-01-31 16:54:50,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:50,894 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-31 16:54:50,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-31 16:54:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-31 16:54:50,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-31 16:54:50,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:50,895 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1] [2019-01-31 16:54:50,895 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:50,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:50,895 INFO L82 PathProgramCache]: Analyzing trace with hash -480560559, now seen corresponding path program 17 times [2019-01-31 16:54:50,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:50,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:50,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:50,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:50,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:51,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:51,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:51,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:51,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:51,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:51,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:51,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:51,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:51,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-31 16:54:51,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:51,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:51,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:51,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:51,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:51,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:51,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:52,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:52,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 58 [2019-01-31 16:54:52,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:52,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-31 16:54:52,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-31 16:54:52,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1413, Invalid=2009, Unknown=0, NotChecked=0, Total=3422 [2019-01-31 16:54:52,346 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 40 states. [2019-01-31 16:54:52,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:52,923 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-31 16:54:52,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-31 16:54:52,924 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 91 [2019-01-31 16:54:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:52,925 INFO L225 Difference]: With dead ends: 101 [2019-01-31 16:54:52,925 INFO L226 Difference]: Without dead ends: 100 [2019-01-31 16:54:52,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1706 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2322, Invalid=3530, Unknown=0, NotChecked=0, Total=5852 [2019-01-31 16:54:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-31 16:54:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-01-31 16:54:52,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-31 16:54:52,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-31 16:54:52,935 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 91 [2019-01-31 16:54:52,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:52,936 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-31 16:54:52,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-31 16:54:52,936 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-31 16:54:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-31 16:54:52,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:52,937 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1] [2019-01-31 16:54:52,937 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:52,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:52,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2085538841, now seen corresponding path program 18 times [2019-01-31 16:54:52,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:52,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:52,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:52,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:52,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:53,455 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:53,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:53,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:53,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:53,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:53,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:53,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:53,464 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:54:53,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:54:53,544 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:54:53,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:53,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:53,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:53,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:53,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:53,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:53,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:54,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:54,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 61 [2019-01-31 16:54:54,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:54,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-31 16:54:54,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-31 16:54:54,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1567, Invalid=2215, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 16:54:54,617 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 42 states. [2019-01-31 16:54:55,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:55,274 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-31 16:54:55,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-31 16:54:55,275 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2019-01-31 16:54:55,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:55,276 INFO L225 Difference]: With dead ends: 106 [2019-01-31 16:54:55,276 INFO L226 Difference]: Without dead ends: 105 [2019-01-31 16:54:55,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1896 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2574, Invalid=3906, Unknown=0, NotChecked=0, Total=6480 [2019-01-31 16:54:55,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-31 16:54:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2019-01-31 16:54:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-31 16:54:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-31 16:54:55,288 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 96 [2019-01-31 16:54:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:55,288 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-31 16:54:55,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-31 16:54:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-31 16:54:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-31 16:54:55,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:55,289 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1] [2019-01-31 16:54:55,289 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:55,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:55,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1222260719, now seen corresponding path program 19 times [2019-01-31 16:54:55,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:55,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:55,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:54:55,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:55,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:56,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:56,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:56,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:56,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:56,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:56,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:56,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:56,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:54:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:56,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:56,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:56,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:56,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:56,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:56,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:54:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:57,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:54:57,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 64 [2019-01-31 16:54:57,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:54:57,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-31 16:54:57,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-31 16:54:57,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1729, Invalid=2431, Unknown=0, NotChecked=0, Total=4160 [2019-01-31 16:54:57,564 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 44 states. [2019-01-31 16:54:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:54:58,370 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-31 16:54:58,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-31 16:54:58,373 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 101 [2019-01-31 16:54:58,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:54:58,374 INFO L225 Difference]: With dead ends: 111 [2019-01-31 16:54:58,374 INFO L226 Difference]: Without dead ends: 110 [2019-01-31 16:54:58,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2096 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2839, Invalid=4301, Unknown=0, NotChecked=0, Total=7140 [2019-01-31 16:54:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-31 16:54:58,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-01-31 16:54:58,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-31 16:54:58,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-31 16:54:58,387 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 101 [2019-01-31 16:54:58,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:54:58,387 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-31 16:54:58,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-31 16:54:58,387 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-31 16:54:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-31 16:54:58,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:54:58,388 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1] [2019-01-31 16:54:58,388 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:54:58,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:54:58,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1629044263, now seen corresponding path program 20 times [2019-01-31 16:54:58,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:54:58,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:58,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:54:58,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:54:58,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:54:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:54:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:58,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:58,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:54:58,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:54:58,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:54:58,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:54:58,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:54:58,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:54:58,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:54:59,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-31 16:54:59,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:54:59,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:54:59,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:54:59,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:54:59,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:54:59,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:54:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:54:59,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:00,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:00,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:00,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2019-01-31 16:55:00,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:00,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-31 16:55:00,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-31 16:55:00,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1899, Invalid=2657, Unknown=0, NotChecked=0, Total=4556 [2019-01-31 16:55:00,285 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 46 states. [2019-01-31 16:55:01,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:01,090 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-31 16:55:01,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-31 16:55:01,090 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 106 [2019-01-31 16:55:01,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:01,091 INFO L225 Difference]: With dead ends: 116 [2019-01-31 16:55:01,091 INFO L226 Difference]: Without dead ends: 115 [2019-01-31 16:55:01,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2306 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3117, Invalid=4715, Unknown=0, NotChecked=0, Total=7832 [2019-01-31 16:55:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-31 16:55:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2019-01-31 16:55:01,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-31 16:55:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-31 16:55:01,105 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 106 [2019-01-31 16:55:01,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:01,105 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-31 16:55:01,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-31 16:55:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-31 16:55:01,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-31 16:55:01,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:01,107 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1] [2019-01-31 16:55:01,107 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:01,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:01,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2020222417, now seen corresponding path program 21 times [2019-01-31 16:55:01,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:01,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:01,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:01,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:01,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:01,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:01,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:01,574 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:01,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:01,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:01,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:01,585 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:01,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:01,655 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:01,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:01,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:01,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:01,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:01,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:01,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:02,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:02,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:02,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:02,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2019-01-31 16:55:02,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:02,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-31 16:55:02,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-31 16:55:02,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2077, Invalid=2893, Unknown=0, NotChecked=0, Total=4970 [2019-01-31 16:55:02,939 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 48 states. [2019-01-31 16:55:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:03,958 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-01-31 16:55:03,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-31 16:55:03,959 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2019-01-31 16:55:03,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:03,960 INFO L225 Difference]: With dead ends: 121 [2019-01-31 16:55:03,960 INFO L226 Difference]: Without dead ends: 120 [2019-01-31 16:55:03,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2526 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3408, Invalid=5148, Unknown=0, NotChecked=0, Total=8556 [2019-01-31 16:55:03,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-31 16:55:03,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2019-01-31 16:55:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-31 16:55:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-01-31 16:55:03,980 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 111 [2019-01-31 16:55:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:03,980 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-01-31 16:55:03,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-31 16:55:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-01-31 16:55:03,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-31 16:55:03,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:03,981 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1] [2019-01-31 16:55:03,981 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:03,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:03,982 INFO L82 PathProgramCache]: Analyzing trace with hash -995526553, now seen corresponding path program 22 times [2019-01-31 16:55:03,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:03,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:03,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:03,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:03,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:04,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:04,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:04,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:04,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:04,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:04,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:04,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:04,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:04,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:04,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:04,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:04,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:04,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:04,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:05,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:05,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 73 [2019-01-31 16:55:05,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:05,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-31 16:55:05,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-31 16:55:05,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2263, Invalid=3139, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 16:55:05,799 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 50 states. [2019-01-31 16:55:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:06,815 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-01-31 16:55:06,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-31 16:55:06,816 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 116 [2019-01-31 16:55:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:06,817 INFO L225 Difference]: With dead ends: 126 [2019-01-31 16:55:06,817 INFO L226 Difference]: Without dead ends: 125 [2019-01-31 16:55:06,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2756 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3712, Invalid=5600, Unknown=0, NotChecked=0, Total=9312 [2019-01-31 16:55:06,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-31 16:55:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2019-01-31 16:55:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-31 16:55:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-01-31 16:55:06,832 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 116 [2019-01-31 16:55:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:06,832 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-01-31 16:55:06,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-31 16:55:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-01-31 16:55:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-31 16:55:06,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:06,833 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1] [2019-01-31 16:55:06,833 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:06,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:06,833 INFO L82 PathProgramCache]: Analyzing trace with hash 891573137, now seen corresponding path program 23 times [2019-01-31 16:55:06,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:06,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:06,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:06,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:06,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:07,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:07,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:07,334 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:07,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:07,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:07,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:07,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:07,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:07,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-31 16:55:07,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:07,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:07,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:07,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:07,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:07,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:07,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:09,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:09,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 76 [2019-01-31 16:55:09,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:09,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-31 16:55:09,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-31 16:55:09,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2457, Invalid=3395, Unknown=0, NotChecked=0, Total=5852 [2019-01-31 16:55:09,135 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 52 states. [2019-01-31 16:55:10,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:10,003 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-01-31 16:55:10,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-31 16:55:10,003 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 121 [2019-01-31 16:55:10,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:10,004 INFO L225 Difference]: With dead ends: 131 [2019-01-31 16:55:10,004 INFO L226 Difference]: Without dead ends: 130 [2019-01-31 16:55:10,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4029, Invalid=6071, Unknown=0, NotChecked=0, Total=10100 [2019-01-31 16:55:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-31 16:55:10,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-01-31 16:55:10,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-31 16:55:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-01-31 16:55:10,020 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 121 [2019-01-31 16:55:10,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:10,020 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-01-31 16:55:10,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-31 16:55:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-01-31 16:55:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-31 16:55:10,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:10,021 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1] [2019-01-31 16:55:10,021 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:10,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:10,021 INFO L82 PathProgramCache]: Analyzing trace with hash -35265881, now seen corresponding path program 24 times [2019-01-31 16:55:10,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:10,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:10,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:10,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:10,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:10,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:10,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:10,559 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:10,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:10,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:10,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:10,568 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:10,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:10,645 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:10,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:10,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:10,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:10,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:10,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:10,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:11,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:12,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:12,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 79 [2019-01-31 16:55:12,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:12,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-31 16:55:12,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-31 16:55:12,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2659, Invalid=3661, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 16:55:12,225 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 54 states. [2019-01-31 16:55:13,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:13,239 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-01-31 16:55:13,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-31 16:55:13,240 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 126 [2019-01-31 16:55:13,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:13,241 INFO L225 Difference]: With dead ends: 136 [2019-01-31 16:55:13,241 INFO L226 Difference]: Without dead ends: 135 [2019-01-31 16:55:13,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3246 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4359, Invalid=6561, Unknown=0, NotChecked=0, Total=10920 [2019-01-31 16:55:13,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-31 16:55:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2019-01-31 16:55:13,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-31 16:55:13,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-01-31 16:55:13,261 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 126 [2019-01-31 16:55:13,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:13,261 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-01-31 16:55:13,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-31 16:55:13,261 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-01-31 16:55:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-31 16:55:13,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:13,262 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1] [2019-01-31 16:55:13,262 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:13,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:13,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1336913583, now seen corresponding path program 25 times [2019-01-31 16:55:13,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:13,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:13,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:13,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:13,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:14,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:14,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:14,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:14,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:14,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:14,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:14,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:14,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:14,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:14,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:14,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:14,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:14,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:14,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:15,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:15,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:15,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 82 [2019-01-31 16:55:15,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:15,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-31 16:55:15,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-31 16:55:15,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2869, Invalid=3937, Unknown=0, NotChecked=0, Total=6806 [2019-01-31 16:55:15,882 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 56 states. [2019-01-31 16:55:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:16,861 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-01-31 16:55:16,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-31 16:55:16,861 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 131 [2019-01-31 16:55:16,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:16,862 INFO L225 Difference]: With dead ends: 141 [2019-01-31 16:55:16,862 INFO L226 Difference]: Without dead ends: 140 [2019-01-31 16:55:16,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3506 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4702, Invalid=7070, Unknown=0, NotChecked=0, Total=11772 [2019-01-31 16:55:16,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-31 16:55:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-01-31 16:55:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-31 16:55:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-01-31 16:55:16,878 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 131 [2019-01-31 16:55:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:16,878 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-01-31 16:55:16,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-31 16:55:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-01-31 16:55:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-31 16:55:16,879 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:16,879 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1] [2019-01-31 16:55:16,879 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:16,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:16,880 INFO L82 PathProgramCache]: Analyzing trace with hash -950895385, now seen corresponding path program 26 times [2019-01-31 16:55:16,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:16,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:16,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:16,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:16,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:17,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:17,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:17,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:17,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:17,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:17,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:18,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:18,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:18,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-31 16:55:18,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:18,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:18,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:18,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:18,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:18,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:19,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:20,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:20,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2019-01-31 16:55:20,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:20,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-31 16:55:20,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-31 16:55:20,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3087, Invalid=4223, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 16:55:20,842 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 58 states. [2019-01-31 16:55:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:21,931 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-01-31 16:55:21,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-31 16:55:21,931 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2019-01-31 16:55:21,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:21,932 INFO L225 Difference]: With dead ends: 146 [2019-01-31 16:55:21,932 INFO L226 Difference]: Without dead ends: 145 [2019-01-31 16:55:21,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3776 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5058, Invalid=7598, Unknown=0, NotChecked=0, Total=12656 [2019-01-31 16:55:21,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-31 16:55:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2019-01-31 16:55:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-31 16:55:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-01-31 16:55:21,951 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 136 [2019-01-31 16:55:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:21,952 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-01-31 16:55:21,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-31 16:55:21,952 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-01-31 16:55:21,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-31 16:55:21,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:21,952 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1] [2019-01-31 16:55:21,952 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:21,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:21,953 INFO L82 PathProgramCache]: Analyzing trace with hash 568991505, now seen corresponding path program 27 times [2019-01-31 16:55:21,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:21,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:21,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:21,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:21,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:22,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:22,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:22,570 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:22,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:22,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:22,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:22,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:22,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:22,667 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:22,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:22,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:22,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:22,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:22,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:22,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:23,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:24,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:24,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 88 [2019-01-31 16:55:24,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:24,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-31 16:55:24,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-31 16:55:24,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3313, Invalid=4519, Unknown=0, NotChecked=0, Total=7832 [2019-01-31 16:55:24,831 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 60 states. [2019-01-31 16:55:25,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:25,989 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-01-31 16:55:25,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-31 16:55:25,990 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 141 [2019-01-31 16:55:25,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:25,991 INFO L225 Difference]: With dead ends: 151 [2019-01-31 16:55:25,991 INFO L226 Difference]: Without dead ends: 150 [2019-01-31 16:55:25,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4056 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5427, Invalid=8145, Unknown=0, NotChecked=0, Total=13572 [2019-01-31 16:55:25,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-31 16:55:26,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-01-31 16:55:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-31 16:55:26,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-01-31 16:55:26,011 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 141 [2019-01-31 16:55:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:26,012 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-01-31 16:55:26,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-31 16:55:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-01-31 16:55:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-31 16:55:26,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:26,013 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1] [2019-01-31 16:55:26,013 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:26,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:26,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2039265497, now seen corresponding path program 28 times [2019-01-31 16:55:26,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:26,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:26,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:26,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:26,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:26,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:26,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:26,685 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:26,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:26,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:26,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:26,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:26,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:26,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:26,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:26,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:26,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:26,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:27,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:28,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:28,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 91 [2019-01-31 16:55:28,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:28,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-31 16:55:28,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-31 16:55:28,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3547, Invalid=4825, Unknown=0, NotChecked=0, Total=8372 [2019-01-31 16:55:28,868 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 62 states. [2019-01-31 16:55:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:30,241 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-01-31 16:55:30,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-31 16:55:30,241 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 146 [2019-01-31 16:55:30,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:30,243 INFO L225 Difference]: With dead ends: 156 [2019-01-31 16:55:30,243 INFO L226 Difference]: Without dead ends: 155 [2019-01-31 16:55:30,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4346 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5809, Invalid=8711, Unknown=0, NotChecked=0, Total=14520 [2019-01-31 16:55:30,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-31 16:55:30,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2019-01-31 16:55:30,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-31 16:55:30,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-01-31 16:55:30,263 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 146 [2019-01-31 16:55:30,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:30,263 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-01-31 16:55:30,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-31 16:55:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-01-31 16:55:30,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-01-31 16:55:30,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:30,264 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1] [2019-01-31 16:55:30,265 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:30,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:30,265 INFO L82 PathProgramCache]: Analyzing trace with hash -152191791, now seen corresponding path program 29 times [2019-01-31 16:55:30,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:30,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:30,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:30,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:30,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:31,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:31,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:31,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:31,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:31,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:31,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:31,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:31,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:31,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:31,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-31 16:55:31,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:31,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:31,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:31,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:31,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:31,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:32,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:33,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:33,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 94 [2019-01-31 16:55:33,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:33,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-31 16:55:33,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-31 16:55:34,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3789, Invalid=5141, Unknown=0, NotChecked=0, Total=8930 [2019-01-31 16:55:34,000 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 64 states. [2019-01-31 16:55:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:35,392 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-01-31 16:55:35,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-31 16:55:35,393 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 151 [2019-01-31 16:55:35,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:35,394 INFO L225 Difference]: With dead ends: 161 [2019-01-31 16:55:35,394 INFO L226 Difference]: Without dead ends: 160 [2019-01-31 16:55:35,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4646 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6204, Invalid=9296, Unknown=0, NotChecked=0, Total=15500 [2019-01-31 16:55:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-31 16:55:35,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2019-01-31 16:55:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-31 16:55:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-01-31 16:55:35,418 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 151 [2019-01-31 16:55:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:35,418 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-01-31 16:55:35,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-31 16:55:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-01-31 16:55:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-31 16:55:35,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:35,419 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1] [2019-01-31 16:55:35,419 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:35,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:35,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1949548185, now seen corresponding path program 30 times [2019-01-31 16:55:35,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:35,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:35,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:35,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:35,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:36,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:36,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:36,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:36,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:36,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:36,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:36,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:36,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:36,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:36,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:36,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:36,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:36,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:36,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:36,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:37,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:38,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:38,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:38,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 97 [2019-01-31 16:55:38,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:38,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-31 16:55:38,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-31 16:55:38,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4039, Invalid=5467, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 16:55:38,738 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 66 states. [2019-01-31 16:55:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:40,267 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2019-01-31 16:55:40,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-31 16:55:40,267 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 156 [2019-01-31 16:55:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:40,268 INFO L225 Difference]: With dead ends: 166 [2019-01-31 16:55:40,269 INFO L226 Difference]: Without dead ends: 165 [2019-01-31 16:55:40,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4956 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6612, Invalid=9900, Unknown=0, NotChecked=0, Total=16512 [2019-01-31 16:55:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-31 16:55:40,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2019-01-31 16:55:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-31 16:55:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-01-31 16:55:40,301 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 156 [2019-01-31 16:55:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:40,302 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-01-31 16:55:40,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-31 16:55:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-01-31 16:55:40,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-01-31 16:55:40,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:40,303 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1] [2019-01-31 16:55:40,303 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:40,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:40,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1856558447, now seen corresponding path program 31 times [2019-01-31 16:55:40,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:40,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:40,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:40,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:40,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:41,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:41,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:41,576 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:41,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:41,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:41,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:41,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:41,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:41,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:41,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:41,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:41,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:41,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:42,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:44,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:44,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 100 [2019-01-31 16:55:44,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:44,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-31 16:55:44,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-31 16:55:44,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4297, Invalid=5803, Unknown=0, NotChecked=0, Total=10100 [2019-01-31 16:55:44,039 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 68 states. [2019-01-31 16:55:45,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:45,610 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-01-31 16:55:45,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-31 16:55:45,611 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 161 [2019-01-31 16:55:45,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:45,615 INFO L225 Difference]: With dead ends: 171 [2019-01-31 16:55:45,615 INFO L226 Difference]: Without dead ends: 170 [2019-01-31 16:55:45,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5276 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7033, Invalid=10523, Unknown=0, NotChecked=0, Total=17556 [2019-01-31 16:55:45,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-31 16:55:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2019-01-31 16:55:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-31 16:55:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-01-31 16:55:45,641 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 161 [2019-01-31 16:55:45,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:45,641 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-01-31 16:55:45,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-31 16:55:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-01-31 16:55:45,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-31 16:55:45,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:45,642 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1] [2019-01-31 16:55:45,642 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:45,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:45,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1390504871, now seen corresponding path program 32 times [2019-01-31 16:55:45,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:45,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:45,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:45,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:45,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:46,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:46,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:46,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:46,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:46,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:46,434 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:46,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:55:46,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:55:46,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-31 16:55:46,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:46,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:46,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:46,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:46,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:46,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:47,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:49,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:49,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 103 [2019-01-31 16:55:49,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:49,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-31 16:55:49,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-31 16:55:49,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=6149, Unknown=0, NotChecked=0, Total=10712 [2019-01-31 16:55:49,092 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 70 states. [2019-01-31 16:55:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:50,647 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2019-01-31 16:55:50,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-31 16:55:50,648 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2019-01-31 16:55:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:50,649 INFO L225 Difference]: With dead ends: 176 [2019-01-31 16:55:50,649 INFO L226 Difference]: Without dead ends: 175 [2019-01-31 16:55:50,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5606 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7467, Invalid=11165, Unknown=0, NotChecked=0, Total=18632 [2019-01-31 16:55:50,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-31 16:55:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2019-01-31 16:55:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-31 16:55:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-01-31 16:55:50,702 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 166 [2019-01-31 16:55:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:50,702 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-01-31 16:55:50,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-31 16:55:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-01-31 16:55:50,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-01-31 16:55:50,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:50,704 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1] [2019-01-31 16:55:50,704 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:50,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:50,704 INFO L82 PathProgramCache]: Analyzing trace with hash 136472657, now seen corresponding path program 33 times [2019-01-31 16:55:50,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:50,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:50,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:50,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:50,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:51,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:51,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:51,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:51,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:51,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:51,580 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:51,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:55:51,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:55:51,697 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:55:51,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:55:51,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:51,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:51,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:51,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:51,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:52,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:54,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:54,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 106 [2019-01-31 16:55:54,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:54,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-31 16:55:54,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-31 16:55:54,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4837, Invalid=6505, Unknown=0, NotChecked=0, Total=11342 [2019-01-31 16:55:54,288 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 72 states. [2019-01-31 16:55:55,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:55:55,937 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-01-31 16:55:55,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-31 16:55:55,937 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2019-01-31 16:55:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:55:55,938 INFO L225 Difference]: With dead ends: 181 [2019-01-31 16:55:55,938 INFO L226 Difference]: Without dead ends: 180 [2019-01-31 16:55:55,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5946 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7914, Invalid=11826, Unknown=0, NotChecked=0, Total=19740 [2019-01-31 16:55:55,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-31 16:55:55,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2019-01-31 16:55:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-31 16:55:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-01-31 16:55:55,972 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 171 [2019-01-31 16:55:55,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:55:55,972 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-01-31 16:55:55,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-31 16:55:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-01-31 16:55:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-31 16:55:55,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:55:55,974 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1] [2019-01-31 16:55:55,974 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:55:55,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:55:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1036597785, now seen corresponding path program 34 times [2019-01-31 16:55:55,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:55:55,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:55,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:55:55,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:55:55,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:55:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:56,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:56,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:56,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:55:56,859 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:55:56,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:55:56,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:55:56,859 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:55:56,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:55:56,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:55:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:55:56,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:55:57,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:55:57,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:55:57,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:55:57,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:55:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:57,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:55:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:55:59,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:55:59,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 109 [2019-01-31 16:55:59,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:55:59,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-31 16:55:59,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-31 16:55:59,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5119, Invalid=6871, Unknown=0, NotChecked=0, Total=11990 [2019-01-31 16:55:59,798 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 74 states. [2019-01-31 16:56:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:01,557 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-01-31 16:56:01,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-31 16:56:01,558 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 176 [2019-01-31 16:56:01,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:01,559 INFO L225 Difference]: With dead ends: 186 [2019-01-31 16:56:01,559 INFO L226 Difference]: Without dead ends: 185 [2019-01-31 16:56:01,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6296 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=8374, Invalid=12506, Unknown=0, NotChecked=0, Total=20880 [2019-01-31 16:56:01,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-31 16:56:01,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2019-01-31 16:56:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-31 16:56:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-01-31 16:56:01,599 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 176 [2019-01-31 16:56:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:01,599 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-01-31 16:56:01,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-31 16:56:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-01-31 16:56:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-31 16:56:01,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:01,601 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1] [2019-01-31 16:56:01,601 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash -414484975, now seen corresponding path program 35 times [2019-01-31 16:56:01,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:01,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:01,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:01,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:01,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:02,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:02,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:02,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:02,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:02,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:02,767 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:02,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:02,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:03,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-31 16:56:03,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:03,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:03,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:03,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:03,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:03,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:04,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:04,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:06,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:06,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 112 [2019-01-31 16:56:06,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:06,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-31 16:56:06,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-31 16:56:06,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5409, Invalid=7247, Unknown=0, NotChecked=0, Total=12656 [2019-01-31 16:56:06,187 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 76 states. [2019-01-31 16:56:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:07,799 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-01-31 16:56:07,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-31 16:56:07,800 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 181 [2019-01-31 16:56:07,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:07,801 INFO L225 Difference]: With dead ends: 191 [2019-01-31 16:56:07,801 INFO L226 Difference]: Without dead ends: 190 [2019-01-31 16:56:07,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6656 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8847, Invalid=13205, Unknown=0, NotChecked=0, Total=22052 [2019-01-31 16:56:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-31 16:56:07,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2019-01-31 16:56:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-31 16:56:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-01-31 16:56:07,845 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 181 [2019-01-31 16:56:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:07,845 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-01-31 16:56:07,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-31 16:56:07,845 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-01-31 16:56:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-31 16:56:07,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:07,846 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1] [2019-01-31 16:56:07,846 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1800425511, now seen corresponding path program 36 times [2019-01-31 16:56:07,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:07,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:07,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:07,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:07,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:09,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:09,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:09,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:09,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:09,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:09,446 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:09,454 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:09,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:09,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:09,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:09,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:09,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:09,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:09,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:09,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:11,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:13,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:13,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:13,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 115 [2019-01-31 16:56:13,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:13,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-31 16:56:13,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-31 16:56:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5707, Invalid=7633, Unknown=0, NotChecked=0, Total=13340 [2019-01-31 16:56:13,202 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 78 states. [2019-01-31 16:56:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:14,961 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2019-01-31 16:56:14,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-31 16:56:14,961 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 186 [2019-01-31 16:56:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:14,962 INFO L225 Difference]: With dead ends: 196 [2019-01-31 16:56:14,963 INFO L226 Difference]: Without dead ends: 195 [2019-01-31 16:56:14,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7026 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9333, Invalid=13923, Unknown=0, NotChecked=0, Total=23256 [2019-01-31 16:56:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-31 16:56:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2019-01-31 16:56:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-31 16:56:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-01-31 16:56:14,992 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 186 [2019-01-31 16:56:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:14,993 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-01-31 16:56:14,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-31 16:56:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-01-31 16:56:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-31 16:56:14,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:14,994 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1] [2019-01-31 16:56:14,994 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:14,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:14,994 INFO L82 PathProgramCache]: Analyzing trace with hash -271690799, now seen corresponding path program 37 times [2019-01-31 16:56:14,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:14,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:14,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:14,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:14,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:15,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:16,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:16,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:16,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:16,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:16,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:16,056 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:16,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:16,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:16,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:16,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:16,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:16,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:16,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:17,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:19,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:19,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 118 [2019-01-31 16:56:19,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:19,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-31 16:56:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-31 16:56:19,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6013, Invalid=8029, Unknown=0, NotChecked=0, Total=14042 [2019-01-31 16:56:19,238 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 80 states. [2019-01-31 16:56:21,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:21,154 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-01-31 16:56:21,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-31 16:56:21,155 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 191 [2019-01-31 16:56:21,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:21,156 INFO L225 Difference]: With dead ends: 201 [2019-01-31 16:56:21,156 INFO L226 Difference]: Without dead ends: 200 [2019-01-31 16:56:21,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7406 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=9832, Invalid=14660, Unknown=0, NotChecked=0, Total=24492 [2019-01-31 16:56:21,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-01-31 16:56:21,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2019-01-31 16:56:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-31 16:56:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-01-31 16:56:21,196 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 191 [2019-01-31 16:56:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:21,196 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-01-31 16:56:21,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-31 16:56:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-01-31 16:56:21,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-31 16:56:21,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:21,197 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1] [2019-01-31 16:56:21,197 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:21,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:21,197 INFO L82 PathProgramCache]: Analyzing trace with hash -894301593, now seen corresponding path program 38 times [2019-01-31 16:56:21,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:21,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:21,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:21,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:21,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:22,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:22,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:22,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:22,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:22,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:22,418 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:22,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:22,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:22,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-31 16:56:22,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:22,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:22,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:22,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:22,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:22,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:23,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:23,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:26,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:26,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:26,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 121 [2019-01-31 16:56:26,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:26,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-31 16:56:26,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-31 16:56:26,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6327, Invalid=8435, Unknown=0, NotChecked=0, Total=14762 [2019-01-31 16:56:26,114 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 82 states. [2019-01-31 16:56:27,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:27,853 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-01-31 16:56:27,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-31 16:56:27,853 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 196 [2019-01-31 16:56:27,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:27,854 INFO L225 Difference]: With dead ends: 206 [2019-01-31 16:56:27,854 INFO L226 Difference]: Without dead ends: 205 [2019-01-31 16:56:27,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7796 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=10344, Invalid=15416, Unknown=0, NotChecked=0, Total=25760 [2019-01-31 16:56:27,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-31 16:56:27,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2019-01-31 16:56:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-31 16:56:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-01-31 16:56:27,892 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 196 [2019-01-31 16:56:27,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:27,892 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-01-31 16:56:27,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-31 16:56:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-01-31 16:56:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-01-31 16:56:27,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:27,893 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1] [2019-01-31 16:56:27,894 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:27,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:27,894 INFO L82 PathProgramCache]: Analyzing trace with hash -676920943, now seen corresponding path program 39 times [2019-01-31 16:56:27,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:27,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:27,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:27,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:27,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:28,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:28,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:28,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:28,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:28,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:28,926 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:28,934 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:28,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:29,066 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:29,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:29,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:29,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:29,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:29,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:29,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:30,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:32,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:32,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 124 [2019-01-31 16:56:32,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:32,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-31 16:56:32,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-31 16:56:32,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6649, Invalid=8851, Unknown=0, NotChecked=0, Total=15500 [2019-01-31 16:56:32,736 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 84 states. [2019-01-31 16:56:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:34,528 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-01-31 16:56:34,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-31 16:56:34,528 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 201 [2019-01-31 16:56:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:34,530 INFO L225 Difference]: With dead ends: 211 [2019-01-31 16:56:34,530 INFO L226 Difference]: Without dead ends: 210 [2019-01-31 16:56:34,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8196 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=10869, Invalid=16191, Unknown=0, NotChecked=0, Total=27060 [2019-01-31 16:56:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-31 16:56:34,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2019-01-31 16:56:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-31 16:56:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-01-31 16:56:34,583 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 201 [2019-01-31 16:56:34,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:34,583 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2019-01-31 16:56:34,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-31 16:56:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2019-01-31 16:56:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-31 16:56:34,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:34,584 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1] [2019-01-31 16:56:34,584 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:34,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:34,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2015365977, now seen corresponding path program 40 times [2019-01-31 16:56:34,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:34,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:34,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:34,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:34,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:35,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:35,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:35,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:35,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:35,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:35,778 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:35,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:35,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:35,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:35,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:35,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:36,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:36,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:37,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:39,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:39,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 127 [2019-01-31 16:56:39,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:39,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-31 16:56:39,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-31 16:56:39,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6979, Invalid=9277, Unknown=0, NotChecked=0, Total=16256 [2019-01-31 16:56:39,559 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 86 states. [2019-01-31 16:56:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:41,655 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-01-31 16:56:41,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-31 16:56:41,655 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 206 [2019-01-31 16:56:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:41,656 INFO L225 Difference]: With dead ends: 216 [2019-01-31 16:56:41,656 INFO L226 Difference]: Without dead ends: 215 [2019-01-31 16:56:41,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8606 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=11407, Invalid=16985, Unknown=0, NotChecked=0, Total=28392 [2019-01-31 16:56:41,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-31 16:56:41,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-01-31 16:56:41,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-31 16:56:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-01-31 16:56:41,689 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 206 [2019-01-31 16:56:41,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:41,690 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-01-31 16:56:41,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-31 16:56:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-01-31 16:56:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-01-31 16:56:41,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:41,691 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1] [2019-01-31 16:56:41,691 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:41,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:41,691 INFO L82 PathProgramCache]: Analyzing trace with hash 164724561, now seen corresponding path program 41 times [2019-01-31 16:56:41,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:41,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:41,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:41,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:41,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:42,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:42,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:42,934 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:42,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:42,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:42,934 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:42,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:56:42,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:56:43,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-31 16:56:43,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:43,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:43,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:43,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:43,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:43,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:44,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:44,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:47,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:47,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 130 [2019-01-31 16:56:47,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:47,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-31 16:56:47,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-31 16:56:47,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7317, Invalid=9713, Unknown=0, NotChecked=0, Total=17030 [2019-01-31 16:56:47,113 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 88 states. [2019-01-31 16:56:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:49,147 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-01-31 16:56:49,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-31 16:56:49,147 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 211 [2019-01-31 16:56:49,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:49,148 INFO L225 Difference]: With dead ends: 221 [2019-01-31 16:56:49,148 INFO L226 Difference]: Without dead ends: 220 [2019-01-31 16:56:49,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9026 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=11958, Invalid=17798, Unknown=0, NotChecked=0, Total=29756 [2019-01-31 16:56:49,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-01-31 16:56:49,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2019-01-31 16:56:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-31 16:56:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-01-31 16:56:49,187 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 211 [2019-01-31 16:56:49,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:49,187 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-01-31 16:56:49,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-31 16:56:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-01-31 16:56:49,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-31 16:56:49,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:49,189 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1] [2019-01-31 16:56:49,189 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:49,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:49,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1252127001, now seen corresponding path program 42 times [2019-01-31 16:56:49,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:49,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:49,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:49,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:49,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:50,325 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:50,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:50,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:50,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:50,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:50,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:50,326 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:50,336 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:56:50,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:56:50,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:56:50,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:56:50,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:50,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:50,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:50,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:50,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:56:52,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:52,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:56:54,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:54,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:56:54,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 133 [2019-01-31 16:56:54,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:56:54,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-31 16:56:54,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-31 16:56:54,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7663, Invalid=10159, Unknown=0, NotChecked=0, Total=17822 [2019-01-31 16:56:54,822 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 90 states. [2019-01-31 16:56:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:56:57,207 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2019-01-31 16:56:57,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-31 16:56:57,207 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 216 [2019-01-31 16:56:57,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:56:57,208 INFO L225 Difference]: With dead ends: 226 [2019-01-31 16:56:57,208 INFO L226 Difference]: Without dead ends: 225 [2019-01-31 16:56:57,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9456 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=12522, Invalid=18630, Unknown=0, NotChecked=0, Total=31152 [2019-01-31 16:56:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-01-31 16:56:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2019-01-31 16:56:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-31 16:56:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2019-01-31 16:56:57,246 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 216 [2019-01-31 16:56:57,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:56:57,247 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2019-01-31 16:56:57,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-31 16:56:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2019-01-31 16:56:57,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-01-31 16:56:57,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:56:57,248 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1] [2019-01-31 16:56:57,249 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:56:57,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:56:57,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1716112657, now seen corresponding path program 43 times [2019-01-31 16:56:57,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:56:57,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:57,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:56:57,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:56:57,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:56:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:56:58,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:58,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:56:58,554 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:56:58,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:56:58,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:56:58,555 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:56:58,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:56:58,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:56:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:56:58,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:56:58,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:56:58,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:56:58,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:56:58,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:57:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:00,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:02,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:03,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:03,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 136 [2019-01-31 16:57:03,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:03,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-31 16:57:03,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-31 16:57:03,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8017, Invalid=10615, Unknown=0, NotChecked=0, Total=18632 [2019-01-31 16:57:03,010 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 92 states. [2019-01-31 16:57:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:05,286 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-01-31 16:57:05,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-31 16:57:05,286 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 221 [2019-01-31 16:57:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:05,287 INFO L225 Difference]: With dead ends: 231 [2019-01-31 16:57:05,288 INFO L226 Difference]: Without dead ends: 230 [2019-01-31 16:57:05,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9896 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=13099, Invalid=19481, Unknown=0, NotChecked=0, Total=32580 [2019-01-31 16:57:05,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-31 16:57:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-31 16:57:05,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-31 16:57:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-01-31 16:57:05,343 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 221 [2019-01-31 16:57:05,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:05,344 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2019-01-31 16:57:05,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-31 16:57:05,344 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2019-01-31 16:57:05,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-31 16:57:05,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:05,345 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1] [2019-01-31 16:57:05,345 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:57:05,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:05,346 INFO L82 PathProgramCache]: Analyzing trace with hash 279992615, now seen corresponding path program 44 times [2019-01-31 16:57:05,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:05,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:05,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:05,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:05,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:06,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:06,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:06,938 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:06,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:06,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:06,939 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:06,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:57:06,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:57:07,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-31 16:57:07,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:07,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:07,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:57:07,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:07,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:07,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:57:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:08,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:11,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:11,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 139 [2019-01-31 16:57:11,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:11,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-31 16:57:11,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-31 16:57:11,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8379, Invalid=11081, Unknown=0, NotChecked=0, Total=19460 [2019-01-31 16:57:11,691 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 94 states. [2019-01-31 16:57:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:13,948 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2019-01-31 16:57:13,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-31 16:57:13,949 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 226 [2019-01-31 16:57:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:13,950 INFO L225 Difference]: With dead ends: 236 [2019-01-31 16:57:13,950 INFO L226 Difference]: Without dead ends: 235 [2019-01-31 16:57:13,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10346 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=13689, Invalid=20351, Unknown=0, NotChecked=0, Total=34040 [2019-01-31 16:57:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-31 16:57:13,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2019-01-31 16:57:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-31 16:57:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-01-31 16:57:13,999 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 226 [2019-01-31 16:57:13,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:13,999 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-01-31 16:57:13,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-31 16:57:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-01-31 16:57:14,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-01-31 16:57:14,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:14,000 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1] [2019-01-31 16:57:14,001 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:57:14,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:14,001 INFO L82 PathProgramCache]: Analyzing trace with hash 34335441, now seen corresponding path program 45 times [2019-01-31 16:57:14,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:14,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:14,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:14,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:14,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:15,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:15,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:15,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:15,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:15,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:15,379 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:15,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:57:15,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:57:15,532 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:57:15,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:15,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:15,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:57:15,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:15,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:15,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:57:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:17,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:20,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:20,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 142 [2019-01-31 16:57:20,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:20,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-31 16:57:20,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-31 16:57:20,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8749, Invalid=11557, Unknown=0, NotChecked=0, Total=20306 [2019-01-31 16:57:20,124 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 96 states. [2019-01-31 16:57:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:22,733 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2019-01-31 16:57:22,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-31 16:57:22,733 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2019-01-31 16:57:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:22,734 INFO L225 Difference]: With dead ends: 241 [2019-01-31 16:57:22,734 INFO L226 Difference]: Without dead ends: 240 [2019-01-31 16:57:22,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10806 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=14292, Invalid=21240, Unknown=0, NotChecked=0, Total=35532 [2019-01-31 16:57:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-01-31 16:57:22,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2019-01-31 16:57:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-01-31 16:57:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-01-31 16:57:22,787 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 231 [2019-01-31 16:57:22,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:22,788 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-01-31 16:57:22,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-31 16:57:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-01-31 16:57:22,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-01-31 16:57:22,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:22,789 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1] [2019-01-31 16:57:22,790 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:57:22,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:22,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1113248615, now seen corresponding path program 46 times [2019-01-31 16:57:22,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:22,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:22,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:22,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:22,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:24,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:24,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:24,165 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:24,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:24,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:24,165 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:24,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:24,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:57:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:24,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:24,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:57:24,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:24,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:24,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:57:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:25,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:29,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:29,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 145 [2019-01-31 16:57:29,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:29,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-31 16:57:29,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-31 16:57:29,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9127, Invalid=12043, Unknown=0, NotChecked=0, Total=21170 [2019-01-31 16:57:29,178 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 98 states. [2019-01-31 16:57:31,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:31,518 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-01-31 16:57:31,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-31 16:57:31,519 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 236 [2019-01-31 16:57:31,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:31,520 INFO L225 Difference]: With dead ends: 246 [2019-01-31 16:57:31,520 INFO L226 Difference]: Without dead ends: 245 [2019-01-31 16:57:31,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11276 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=14908, Invalid=22148, Unknown=0, NotChecked=0, Total=37056 [2019-01-31 16:57:31,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-01-31 16:57:31,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2019-01-31 16:57:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-31 16:57:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2019-01-31 16:57:31,563 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 236 [2019-01-31 16:57:31,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:31,563 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2019-01-31 16:57:31,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-31 16:57:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2019-01-31 16:57:31,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-01-31 16:57:31,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:31,564 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1] [2019-01-31 16:57:31,564 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:57:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:31,564 INFO L82 PathProgramCache]: Analyzing trace with hash -418129775, now seen corresponding path program 47 times [2019-01-31 16:57:31,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:31,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:31,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:31,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:31,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:33,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:33,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:33,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:33,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:33,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:33,144 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:33,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:57:33,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:57:33,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-31 16:57:33,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:33,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:33,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:57:33,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:33,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:33,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:57:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:35,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:38,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:38,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 148 [2019-01-31 16:57:38,447 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:38,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-31 16:57:38,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-31 16:57:38,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9513, Invalid=12539, Unknown=0, NotChecked=0, Total=22052 [2019-01-31 16:57:38,449 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 100 states. [2019-01-31 16:57:40,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:40,872 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-01-31 16:57:40,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-31 16:57:40,872 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 241 [2019-01-31 16:57:40,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:40,873 INFO L225 Difference]: With dead ends: 251 [2019-01-31 16:57:40,873 INFO L226 Difference]: Without dead ends: 250 [2019-01-31 16:57:40,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11756 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=15537, Invalid=23075, Unknown=0, NotChecked=0, Total=38612 [2019-01-31 16:57:40,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-31 16:57:40,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2019-01-31 16:57:40,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-31 16:57:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-01-31 16:57:40,924 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 241 [2019-01-31 16:57:40,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:40,925 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-01-31 16:57:40,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-31 16:57:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-01-31 16:57:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-01-31 16:57:40,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:40,926 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1] [2019-01-31 16:57:40,926 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:57:40,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:40,926 INFO L82 PathProgramCache]: Analyzing trace with hash 501317031, now seen corresponding path program 48 times [2019-01-31 16:57:40,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:40,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:40,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:40,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:40,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:42,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:42,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:42,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:42,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:42,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:42,753 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:42,761 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:57:42,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:57:42,927 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:57:42,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:57:42,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:42,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:57:42,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:42,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:42,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:57:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:44,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:48,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:48,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-01-31 16:57:48,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:48,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-31 16:57:48,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-31 16:57:48,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9907, Invalid=13045, Unknown=0, NotChecked=0, Total=22952 [2019-01-31 16:57:48,166 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 102 states. [2019-01-31 16:57:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:57:50,682 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2019-01-31 16:57:50,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-31 16:57:50,683 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 246 [2019-01-31 16:57:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:57:50,684 INFO L225 Difference]: With dead ends: 256 [2019-01-31 16:57:50,684 INFO L226 Difference]: Without dead ends: 255 [2019-01-31 16:57:50,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12246 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=16179, Invalid=24021, Unknown=0, NotChecked=0, Total=40200 [2019-01-31 16:57:50,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-01-31 16:57:50,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2019-01-31 16:57:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-31 16:57:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2019-01-31 16:57:50,741 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 246 [2019-01-31 16:57:50,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:57:50,741 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2019-01-31 16:57:50,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-31 16:57:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2019-01-31 16:57:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-01-31 16:57:50,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:57:50,743 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1] [2019-01-31 16:57:50,743 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:57:50,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:57:50,744 INFO L82 PathProgramCache]: Analyzing trace with hash -732064175, now seen corresponding path program 49 times [2019-01-31 16:57:50,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:57:50,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:50,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:57:50,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:57:50,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:57:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:52,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:52,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:57:52,150 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:57:52,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:57:52,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:57:52,150 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:57:52,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:57:52,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:57:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:57:52,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:57:52,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:57:52,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:57:52,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:57:52,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:57:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:54,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:57:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:57:57,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:57:57,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-01-31 16:57:57,739 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:57:57,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-31 16:57:57,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-31 16:57:57,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10309, Invalid=13561, Unknown=0, NotChecked=0, Total=23870 [2019-01-31 16:57:57,741 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 104 states. [2019-01-31 16:58:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:00,442 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-01-31 16:58:00,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-31 16:58:00,443 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 251 [2019-01-31 16:58:00,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:00,444 INFO L225 Difference]: With dead ends: 261 [2019-01-31 16:58:00,444 INFO L226 Difference]: Without dead ends: 260 [2019-01-31 16:58:00,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12746 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=16834, Invalid=24986, Unknown=0, NotChecked=0, Total=41820 [2019-01-31 16:58:00,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-01-31 16:58:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2019-01-31 16:58:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-01-31 16:58:00,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-01-31 16:58:00,517 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 251 [2019-01-31 16:58:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:00,517 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-01-31 16:58:00,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-31 16:58:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-01-31 16:58:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-01-31 16:58:00,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:00,519 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1] [2019-01-31 16:58:00,519 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:58:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:00,520 INFO L82 PathProgramCache]: Analyzing trace with hash -506963993, now seen corresponding path program 50 times [2019-01-31 16:58:00,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:00,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:00,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:00,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:00,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:00,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:02,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:02,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:02,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:02,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:02,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:02,055 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:02,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:58:02,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:58:02,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-31 16:58:02,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:02,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:02,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:58:02,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:02,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:02,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:58:04,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:04,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:08,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:08,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-01-31 16:58:08,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:08,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-31 16:58:08,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-31 16:58:08,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10412, Invalid=13768, Unknown=0, NotChecked=0, Total=24180 [2019-01-31 16:58:08,185 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 106 states. [2019-01-31 16:58:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:11,162 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2019-01-31 16:58:11,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-31 16:58:11,163 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 256 [2019-01-31 16:58:11,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:11,164 INFO L225 Difference]: With dead ends: 266 [2019-01-31 16:58:11,164 INFO L226 Difference]: Without dead ends: 265 [2019-01-31 16:58:11,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13347 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=17093, Invalid=25549, Unknown=0, NotChecked=0, Total=42642 [2019-01-31 16:58:11,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-31 16:58:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2019-01-31 16:58:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-31 16:58:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-01-31 16:58:11,214 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 256 [2019-01-31 16:58:11,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:11,214 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2019-01-31 16:58:11,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-31 16:58:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2019-01-31 16:58:11,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-31 16:58:11,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:11,215 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1] [2019-01-31 16:58:11,215 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:58:11,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:11,216 INFO L82 PathProgramCache]: Analyzing trace with hash -35314671, now seen corresponding path program 51 times [2019-01-31 16:58:11,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:11,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:11,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:11,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:11,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:12,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:12,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:12,704 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:12,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:12,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:12,705 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:12,713 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:58:12,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:58:12,871 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:58:12,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:12,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:12,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:58:12,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:12,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:12,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:58:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:14,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:18,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:18,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-01-31 16:58:18,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:18,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-31 16:58:18,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-31 16:58:18,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10515, Invalid=13977, Unknown=0, NotChecked=0, Total=24492 [2019-01-31 16:58:18,732 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 108 states. [2019-01-31 16:58:21,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:21,643 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-01-31 16:58:21,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-31 16:58:21,643 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 261 [2019-01-31 16:58:21,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:21,644 INFO L225 Difference]: With dead ends: 271 [2019-01-31 16:58:21,644 INFO L226 Difference]: Without dead ends: 270 [2019-01-31 16:58:21,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 415 SyntacticMatches, 4 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13950 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=17353, Invalid=26119, Unknown=0, NotChecked=0, Total=43472 [2019-01-31 16:58:21,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-31 16:58:21,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-01-31 16:58:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-01-31 16:58:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2019-01-31 16:58:21,699 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 261 [2019-01-31 16:58:21,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:21,699 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2019-01-31 16:58:21,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-31 16:58:21,699 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2019-01-31 16:58:21,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-01-31 16:58:21,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:21,700 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1] [2019-01-31 16:58:21,701 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:58:21,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:21,701 INFO L82 PathProgramCache]: Analyzing trace with hash 2006147623, now seen corresponding path program 52 times [2019-01-31 16:58:21,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:21,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:21,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:21,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:21,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:23,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:23,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:23,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:23,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:23,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:23,561 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:23,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:23,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:58:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:23,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:23,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:58:23,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:23,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:23,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:58:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:25,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:29,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:29,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-01-31 16:58:29,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:29,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-31 16:58:29,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-31 16:58:29,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10618, Invalid=14188, Unknown=0, NotChecked=0, Total=24806 [2019-01-31 16:58:29,470 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 110 states. [2019-01-31 16:58:32,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:32,418 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2019-01-31 16:58:32,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-31 16:58:32,419 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 266 [2019-01-31 16:58:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:32,420 INFO L225 Difference]: With dead ends: 276 [2019-01-31 16:58:32,420 INFO L226 Difference]: Without dead ends: 275 [2019-01-31 16:58:32,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 423 SyntacticMatches, 6 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14555 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=17614, Invalid=26696, Unknown=0, NotChecked=0, Total=44310 [2019-01-31 16:58:32,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-31 16:58:32,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2019-01-31 16:58:32,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-01-31 16:58:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2019-01-31 16:58:32,498 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 266 [2019-01-31 16:58:32,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:32,498 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2019-01-31 16:58:32,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-31 16:58:32,499 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2019-01-31 16:58:32,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-01-31 16:58:32,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:32,500 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1] [2019-01-31 16:58:32,500 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:58:32,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:32,500 INFO L82 PathProgramCache]: Analyzing trace with hash -861503023, now seen corresponding path program 53 times [2019-01-31 16:58:32,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:32,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:32,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:32,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:32,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:34,407 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:34,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:34,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:34,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:34,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:34,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:34,408 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:34,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:58:34,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:58:34,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-31 16:58:34,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:34,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:34,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:58:34,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:34,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:34,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:58:36,738 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:36,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:40,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:40,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-01-31 16:58:40,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:40,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-31 16:58:40,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-31 16:58:40,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10721, Invalid=14401, Unknown=0, NotChecked=0, Total=25122 [2019-01-31 16:58:40,489 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 112 states. [2019-01-31 16:58:43,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:43,590 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2019-01-31 16:58:43,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-31 16:58:43,591 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 271 [2019-01-31 16:58:43,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:43,592 INFO L225 Difference]: With dead ends: 281 [2019-01-31 16:58:43,592 INFO L226 Difference]: Without dead ends: 280 [2019-01-31 16:58:43,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 431 SyntacticMatches, 8 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15162 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=17876, Invalid=27280, Unknown=0, NotChecked=0, Total=45156 [2019-01-31 16:58:43,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-01-31 16:58:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2019-01-31 16:58:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-31 16:58:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-01-31 16:58:43,657 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 271 [2019-01-31 16:58:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:43,658 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-01-31 16:58:43,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-31 16:58:43,658 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-01-31 16:58:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-01-31 16:58:43,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:43,659 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1] [2019-01-31 16:58:43,659 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:58:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:43,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1278829465, now seen corresponding path program 54 times [2019-01-31 16:58:43,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:43,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:43,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:43,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:43,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:45,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:45,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:45,341 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:45,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:45,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:45,341 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:45,351 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:58:45,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:58:45,530 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:58:45,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:58:45,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:45,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:58:45,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:45,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:45,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:58:47,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:47,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:58:51,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:51,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:58:51,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-01-31 16:58:51,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:58:51,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-31 16:58:51,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-31 16:58:51,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10824, Invalid=14616, Unknown=0, NotChecked=0, Total=25440 [2019-01-31 16:58:51,483 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 114 states. [2019-01-31 16:58:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:58:54,793 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2019-01-31 16:58:54,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-31 16:58:54,794 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 276 [2019-01-31 16:58:54,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:58:54,795 INFO L225 Difference]: With dead ends: 286 [2019-01-31 16:58:54,795 INFO L226 Difference]: Without dead ends: 285 [2019-01-31 16:58:54,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 439 SyntacticMatches, 10 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15771 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=18139, Invalid=27871, Unknown=0, NotChecked=0, Total=46010 [2019-01-31 16:58:54,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-01-31 16:58:54,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2019-01-31 16:58:54,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-31 16:58:54,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2019-01-31 16:58:54,850 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 276 [2019-01-31 16:58:54,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:58:54,851 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2019-01-31 16:58:54,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-31 16:58:54,851 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2019-01-31 16:58:54,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-01-31 16:58:54,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:58:54,852 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1] [2019-01-31 16:58:54,852 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:58:54,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:58:54,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1633833071, now seen corresponding path program 55 times [2019-01-31 16:58:54,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:58:54,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:54,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:58:54,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:58:54,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:58:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:56,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:56,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:58:56,516 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:58:56,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:58:56,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:58:56,516 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:58:56,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:58:56,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:58:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:58:56,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:58:56,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:58:56,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:58:56,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:58:56,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:58:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:58:58,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:02,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:02,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-01-31 16:59:02,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:02,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-31 16:59:02,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-31 16:59:02,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10927, Invalid=14833, Unknown=0, NotChecked=0, Total=25760 [2019-01-31 16:59:02,897 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 116 states. [2019-01-31 16:59:06,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:06,208 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-01-31 16:59:06,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-31 16:59:06,208 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 281 [2019-01-31 16:59:06,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:06,209 INFO L225 Difference]: With dead ends: 291 [2019-01-31 16:59:06,209 INFO L226 Difference]: Without dead ends: 290 [2019-01-31 16:59:06,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 447 SyntacticMatches, 12 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16382 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=18403, Invalid=28469, Unknown=0, NotChecked=0, Total=46872 [2019-01-31 16:59:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-01-31 16:59:06,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2019-01-31 16:59:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-01-31 16:59:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2019-01-31 16:59:06,269 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 281 [2019-01-31 16:59:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:06,269 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2019-01-31 16:59:06,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-31 16:59:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2019-01-31 16:59:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-01-31 16:59:06,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:06,270 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1] [2019-01-31 16:59:06,270 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:59:06,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:06,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1780087129, now seen corresponding path program 56 times [2019-01-31 16:59:06,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:06,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:06,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:06,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:06,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:08,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:08,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:08,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:08,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:08,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:08,034 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:59:08,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:59:08,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:59:08,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-31 16:59:08,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:08,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:08,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:59:08,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:08,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:08,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:59:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:10,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:14,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:14,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-01-31 16:59:14,847 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:14,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-31 16:59:14,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-31 16:59:14,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11030, Invalid=15052, Unknown=0, NotChecked=0, Total=26082 [2019-01-31 16:59:14,849 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 118 states. [2019-01-31 16:59:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:18,194 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2019-01-31 16:59:18,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-31 16:59:18,194 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 286 [2019-01-31 16:59:18,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:18,195 INFO L225 Difference]: With dead ends: 296 [2019-01-31 16:59:18,195 INFO L226 Difference]: Without dead ends: 295 [2019-01-31 16:59:18,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 455 SyntacticMatches, 14 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16995 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=18668, Invalid=29074, Unknown=0, NotChecked=0, Total=47742 [2019-01-31 16:59:18,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-01-31 16:59:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2019-01-31 16:59:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-01-31 16:59:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2019-01-31 16:59:18,274 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 286 [2019-01-31 16:59:18,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:18,274 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2019-01-31 16:59:18,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-31 16:59:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2019-01-31 16:59:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-01-31 16:59:18,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:18,275 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1, 1] [2019-01-31 16:59:18,275 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:59:18,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:18,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2033799855, now seen corresponding path program 57 times [2019-01-31 16:59:18,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:18,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:18,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:18,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:18,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:20,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:20,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:20,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:20,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:20,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:20,377 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:59:20,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:59:20,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:59:20,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:59:20,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:20,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:20,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:59:20,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:20,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:20,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:59:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:22,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:26,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:26,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-01-31 16:59:26,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:26,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-31 16:59:26,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-31 16:59:26,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11133, Invalid=15273, Unknown=0, NotChecked=0, Total=26406 [2019-01-31 16:59:26,880 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 120 states. [2019-01-31 16:59:30,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:30,425 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2019-01-31 16:59:30,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-31 16:59:30,426 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 291 [2019-01-31 16:59:30,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:30,427 INFO L225 Difference]: With dead ends: 301 [2019-01-31 16:59:30,427 INFO L226 Difference]: Without dead ends: 300 [2019-01-31 16:59:30,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 463 SyntacticMatches, 16 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17610 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=18934, Invalid=29686, Unknown=0, NotChecked=0, Total=48620 [2019-01-31 16:59:30,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-31 16:59:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2019-01-31 16:59:30,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-01-31 16:59:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-01-31 16:59:30,503 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 291 [2019-01-31 16:59:30,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:30,503 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-01-31 16:59:30,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-31 16:59:30,503 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-01-31 16:59:30,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-01-31 16:59:30,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:30,505 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1, 1] [2019-01-31 16:59:30,505 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:59:30,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:30,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2005557017, now seen corresponding path program 58 times [2019-01-31 16:59:30,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:30,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:30,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:30,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:30,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:32,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:32,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:32,384 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:32,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:32,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:32,384 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:59:32,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:32,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 16:59:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:32,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:32,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:59:32,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:32,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:32,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:59:34,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:34,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:38,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:38,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-01-31 16:59:38,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:38,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-31 16:59:38,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-31 16:59:38,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11236, Invalid=15496, Unknown=0, NotChecked=0, Total=26732 [2019-01-31 16:59:38,840 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 122 states. [2019-01-31 16:59:42,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:42,323 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-01-31 16:59:42,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-31 16:59:42,323 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 296 [2019-01-31 16:59:42,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:42,325 INFO L225 Difference]: With dead ends: 306 [2019-01-31 16:59:42,325 INFO L226 Difference]: Without dead ends: 305 [2019-01-31 16:59:42,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 471 SyntacticMatches, 18 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18227 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=19201, Invalid=30305, Unknown=0, NotChecked=0, Total=49506 [2019-01-31 16:59:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-01-31 16:59:42,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2019-01-31 16:59:42,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-01-31 16:59:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2019-01-31 16:59:42,399 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 296 [2019-01-31 16:59:42,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:42,399 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2019-01-31 16:59:42,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-31 16:59:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2019-01-31 16:59:42,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-01-31 16:59:42,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:42,401 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1, 1] [2019-01-31 16:59:42,401 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:59:42,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:42,401 INFO L82 PathProgramCache]: Analyzing trace with hash 220035857, now seen corresponding path program 59 times [2019-01-31 16:59:42,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:42,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:42,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 16:59:42,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:42,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:44,334 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:44,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:44,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:44,335 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:44,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:44,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:44,335 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:59:44,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 16:59:44,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 16:59:44,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-31 16:59:44,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:44,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:44,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:59:44,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:44,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:44,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:59:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:47,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 16:59:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:51,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 16:59:51,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-01-31 16:59:51,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 16:59:51,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-31 16:59:51,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-31 16:59:51,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11339, Invalid=15721, Unknown=0, NotChecked=0, Total=27060 [2019-01-31 16:59:51,412 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 124 states. [2019-01-31 16:59:55,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 16:59:55,006 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-01-31 16:59:55,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-31 16:59:55,007 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 301 [2019-01-31 16:59:55,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 16:59:55,008 INFO L225 Difference]: With dead ends: 311 [2019-01-31 16:59:55,009 INFO L226 Difference]: Without dead ends: 310 [2019-01-31 16:59:55,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 479 SyntacticMatches, 20 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=19469, Invalid=30931, Unknown=0, NotChecked=0, Total=50400 [2019-01-31 16:59:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-01-31 16:59:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2019-01-31 16:59:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-01-31 16:59:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2019-01-31 16:59:55,079 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 301 [2019-01-31 16:59:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 16:59:55,079 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2019-01-31 16:59:55,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-31 16:59:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2019-01-31 16:59:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-01-31 16:59:55,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 16:59:55,080 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1, 1] [2019-01-31 16:59:55,081 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 16:59:55,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 16:59:55,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1594266841, now seen corresponding path program 60 times [2019-01-31 16:59:55,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 16:59:55,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:55,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 16:59:55,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 16:59:55,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 16:59:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 16:59:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:57,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:57,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 16:59:57,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 16:59:57,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 16:59:57,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 16:59:57,226 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 16:59:57,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 16:59:57,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 16:59:57,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 16:59:57,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 16:59:57,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 16:59:57,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 16:59:57,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 16:59:57,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 16:59:57,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 16:59:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 16:59:59,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:03,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:03,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-01-31 17:00:03,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:03,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-31 17:00:03,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-31 17:00:03,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11442, Invalid=15948, Unknown=0, NotChecked=0, Total=27390 [2019-01-31 17:00:03,907 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 126 states. [2019-01-31 17:00:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:07,743 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2019-01-31 17:00:07,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-31 17:00:07,743 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 306 [2019-01-31 17:00:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:07,745 INFO L225 Difference]: With dead ends: 316 [2019-01-31 17:00:07,745 INFO L226 Difference]: Without dead ends: 315 [2019-01-31 17:00:07,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 487 SyntacticMatches, 22 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19467 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=19738, Invalid=31564, Unknown=0, NotChecked=0, Total=51302 [2019-01-31 17:00:07,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-31 17:00:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 312. [2019-01-31 17:00:07,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-31 17:00:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 312 transitions. [2019-01-31 17:00:07,825 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 312 transitions. Word has length 306 [2019-01-31 17:00:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:07,825 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 312 transitions. [2019-01-31 17:00:07,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-31 17:00:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 312 transitions. [2019-01-31 17:00:07,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-01-31 17:00:07,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:07,827 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1, 1] [2019-01-31 17:00:07,827 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:00:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:07,828 INFO L82 PathProgramCache]: Analyzing trace with hash -291628847, now seen corresponding path program 61 times [2019-01-31 17:00:07,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:07,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:07,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:07,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:07,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:09,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:09,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:09,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:09,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:00:09,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:09,943 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:00:09,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:09,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:00:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:10,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:10,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:00:10,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:00:10,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:00:10,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:00:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:12,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:17,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:17,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-01-31 17:00:17,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:17,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-31 17:00:17,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-31 17:00:17,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11545, Invalid=16177, Unknown=0, NotChecked=0, Total=27722 [2019-01-31 17:00:17,190 INFO L87 Difference]: Start difference. First operand 312 states and 312 transitions. Second operand 128 states. [2019-01-31 17:00:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:21,251 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2019-01-31 17:00:21,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-31 17:00:21,251 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 311 [2019-01-31 17:00:21,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:21,253 INFO L225 Difference]: With dead ends: 321 [2019-01-31 17:00:21,253 INFO L226 Difference]: Without dead ends: 320 [2019-01-31 17:00:21,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 495 SyntacticMatches, 24 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20090 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=20008, Invalid=32204, Unknown=0, NotChecked=0, Total=52212 [2019-01-31 17:00:21,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-01-31 17:00:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2019-01-31 17:00:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-01-31 17:00:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-01-31 17:00:21,326 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 311 [2019-01-31 17:00:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:21,326 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-01-31 17:00:21,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-31 17:00:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-01-31 17:00:21,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-01-31 17:00:21,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:21,328 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1, 1] [2019-01-31 17:00:21,329 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:00:21,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:21,329 INFO L82 PathProgramCache]: Analyzing trace with hash -537565849, now seen corresponding path program 62 times [2019-01-31 17:00:21,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:21,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:21,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:21,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:21,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:23,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:23,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:23,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:23,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:00:23,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:23,413 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:00:23,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:00:23,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:00:23,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-31 17:00:23,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:00:23,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:23,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:00:23,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:00:23,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:00:23,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:00:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:26,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:30,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:30,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-01-31 17:00:30,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:30,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-31 17:00:30,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-31 17:00:30,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11648, Invalid=16408, Unknown=0, NotChecked=0, Total=28056 [2019-01-31 17:00:30,654 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 130 states. [2019-01-31 17:00:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:34,731 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2019-01-31 17:00:34,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-31 17:00:34,732 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 316 [2019-01-31 17:00:34,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:34,733 INFO L225 Difference]: With dead ends: 326 [2019-01-31 17:00:34,733 INFO L226 Difference]: Without dead ends: 325 [2019-01-31 17:00:34,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 503 SyntacticMatches, 26 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20715 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=20279, Invalid=32851, Unknown=0, NotChecked=0, Total=53130 [2019-01-31 17:00:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-31 17:00:34,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 322. [2019-01-31 17:00:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-01-31 17:00:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 322 transitions. [2019-01-31 17:00:34,817 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 322 transitions. Word has length 316 [2019-01-31 17:00:34,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:34,818 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 322 transitions. [2019-01-31 17:00:34,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-31 17:00:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 322 transitions. [2019-01-31 17:00:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-01-31 17:00:34,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:34,819 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1, 1] [2019-01-31 17:00:34,819 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:00:34,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:34,820 INFO L82 PathProgramCache]: Analyzing trace with hash -582711663, now seen corresponding path program 63 times [2019-01-31 17:00:34,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:34,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:34,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:34,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:34,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:37,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:37,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:37,316 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:37,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:00:37,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:37,317 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:00:37,325 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:00:37,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:00:37,534 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:00:37,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:00:37,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:37,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:00:37,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:00:37,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:00:37,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:00:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:40,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:44,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:44,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-01-31 17:00:44,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:44,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-31 17:00:44,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-31 17:00:44,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11751, Invalid=16641, Unknown=0, NotChecked=0, Total=28392 [2019-01-31 17:00:44,326 INFO L87 Difference]: Start difference. First operand 322 states and 322 transitions. Second operand 132 states. [2019-01-31 17:00:48,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:00:48,437 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-01-31 17:00:48,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-31 17:00:48,437 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 321 [2019-01-31 17:00:48,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:00:48,439 INFO L225 Difference]: With dead ends: 331 [2019-01-31 17:00:48,439 INFO L226 Difference]: Without dead ends: 330 [2019-01-31 17:00:48,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 511 SyntacticMatches, 28 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21342 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=20551, Invalid=33505, Unknown=0, NotChecked=0, Total=54056 [2019-01-31 17:00:48,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-01-31 17:00:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2019-01-31 17:00:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-01-31 17:00:48,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2019-01-31 17:00:48,516 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 321 [2019-01-31 17:00:48,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:00:48,516 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2019-01-31 17:00:48,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-31 17:00:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2019-01-31 17:00:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-01-31 17:00:48,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:00:48,517 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1, 1] [2019-01-31 17:00:48,517 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:00:48,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:00:48,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1894616999, now seen corresponding path program 64 times [2019-01-31 17:00:48,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:00:48,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:48,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:00:48,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:00:48,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:00:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:50,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:50,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:00:50,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:00:50,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:00:50,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:00:50,787 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:00:50,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:00:50,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:00:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:00:51,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:00:51,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:00:51,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:00:51,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:00:51,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:00:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:53,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:00:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:00:57,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:00:57,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-01-31 17:00:57,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:00:57,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-31 17:00:57,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-31 17:00:57,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11854, Invalid=16876, Unknown=0, NotChecked=0, Total=28730 [2019-01-31 17:00:57,983 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 134 states. [2019-01-31 17:01:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:02,352 INFO L93 Difference]: Finished difference Result 336 states and 336 transitions. [2019-01-31 17:01:02,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-31 17:01:02,352 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 326 [2019-01-31 17:01:02,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:02,353 INFO L225 Difference]: With dead ends: 336 [2019-01-31 17:01:02,353 INFO L226 Difference]: Without dead ends: 335 [2019-01-31 17:01:02,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 519 SyntacticMatches, 30 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21971 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=20824, Invalid=34166, Unknown=0, NotChecked=0, Total=54990 [2019-01-31 17:01:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-01-31 17:01:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2019-01-31 17:01:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-01-31 17:01:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2019-01-31 17:01:02,431 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 326 [2019-01-31 17:01:02,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:02,431 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2019-01-31 17:01:02,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-31 17:01:02,432 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2019-01-31 17:01:02,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-01-31 17:01:02,433 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:02,433 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1, 1] [2019-01-31 17:01:02,433 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:01:02,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:02,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1074578513, now seen corresponding path program 65 times [2019-01-31 17:01:02,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:02,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:02,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:01:02,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:02,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:04,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:04,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:04,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:04,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:04,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:01:04,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:04,681 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:01:04,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:01:04,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:01:05,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-31 17:01:05,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:01:05,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:05,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:01:05,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:01:05,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:01:05,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:01:08,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:08,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:12,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:12,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-01-31 17:01:12,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:12,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-31 17:01:12,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-31 17:01:12,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11957, Invalid=17113, Unknown=0, NotChecked=0, Total=29070 [2019-01-31 17:01:12,493 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 136 states. [2019-01-31 17:01:16,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:16,892 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2019-01-31 17:01:16,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-31 17:01:16,893 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 331 [2019-01-31 17:01:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:16,894 INFO L225 Difference]: With dead ends: 341 [2019-01-31 17:01:16,894 INFO L226 Difference]: Without dead ends: 340 [2019-01-31 17:01:16,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 527 SyntacticMatches, 32 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22602 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=21098, Invalid=34834, Unknown=0, NotChecked=0, Total=55932 [2019-01-31 17:01:16,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-01-31 17:01:16,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 337. [2019-01-31 17:01:16,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-01-31 17:01:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-01-31 17:01:16,981 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 331 [2019-01-31 17:01:16,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:16,982 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-01-31 17:01:16,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-31 17:01:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-01-31 17:01:16,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-31 17:01:16,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:16,983 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1, 1] [2019-01-31 17:01:16,983 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:01:16,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:16,984 INFO L82 PathProgramCache]: Analyzing trace with hash -362419737, now seen corresponding path program 66 times [2019-01-31 17:01:16,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:16,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:16,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:01:16,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:16,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:19,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:19,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:19,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:19,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:01:19,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:19,666 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:01:19,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:01:19,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:01:19,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:01:19,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:01:19,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:19,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:01:19,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:01:19,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:01:19,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:01:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:22,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:27,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:27,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:27,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-01-31 17:01:27,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:27,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-31 17:01:27,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-31 17:01:27,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12060, Invalid=17352, Unknown=0, NotChecked=0, Total=29412 [2019-01-31 17:01:27,185 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 138 states. [2019-01-31 17:01:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:31,775 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2019-01-31 17:01:31,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-31 17:01:31,775 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 336 [2019-01-31 17:01:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:31,776 INFO L225 Difference]: With dead ends: 346 [2019-01-31 17:01:31,777 INFO L226 Difference]: Without dead ends: 345 [2019-01-31 17:01:31,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 535 SyntacticMatches, 34 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23235 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=21373, Invalid=35509, Unknown=0, NotChecked=0, Total=56882 [2019-01-31 17:01:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-31 17:01:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 342. [2019-01-31 17:01:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-31 17:01:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 342 transitions. [2019-01-31 17:01:31,861 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 342 transitions. Word has length 336 [2019-01-31 17:01:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:31,861 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 342 transitions. [2019-01-31 17:01:31,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-31 17:01:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 342 transitions. [2019-01-31 17:01:31,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-01-31 17:01:31,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:31,863 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1, 1] [2019-01-31 17:01:31,863 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:01:31,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:31,863 INFO L82 PathProgramCache]: Analyzing trace with hash -218967535, now seen corresponding path program 67 times [2019-01-31 17:01:31,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:31,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:31,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:01:31,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:31,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:34,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:34,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:34,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:34,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:01:34,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:34,632 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:01:34,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:01:34,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:01:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:34,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:34,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:01:34,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:01:34,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:01:34,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:01:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:38,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:42,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:42,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-01-31 17:01:42,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:42,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-31 17:01:42,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-31 17:01:42,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12163, Invalid=17593, Unknown=0, NotChecked=0, Total=29756 [2019-01-31 17:01:42,284 INFO L87 Difference]: Start difference. First operand 342 states and 342 transitions. Second operand 140 states. [2019-01-31 17:01:46,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:01:46,843 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-01-31 17:01:46,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-31 17:01:46,843 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 341 [2019-01-31 17:01:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:01:46,845 INFO L225 Difference]: With dead ends: 351 [2019-01-31 17:01:46,845 INFO L226 Difference]: Without dead ends: 350 [2019-01-31 17:01:46,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 818 GetRequests, 543 SyntacticMatches, 36 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23870 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=21649, Invalid=36191, Unknown=0, NotChecked=0, Total=57840 [2019-01-31 17:01:46,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-01-31 17:01:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2019-01-31 17:01:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-01-31 17:01:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2019-01-31 17:01:46,933 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 341 [2019-01-31 17:01:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:01:46,933 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2019-01-31 17:01:46,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-31 17:01:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2019-01-31 17:01:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-01-31 17:01:46,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:01:46,935 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1, 1] [2019-01-31 17:01:46,935 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:01:46,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:01:46,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1914538969, now seen corresponding path program 68 times [2019-01-31 17:01:46,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:01:46,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:46,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:01:46,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:01:46,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:01:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:01:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:49,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:49,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:01:49,652 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:01:49,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:01:49,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:01:49,653 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:01:49,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:01:49,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:01:50,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-31 17:01:50,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:01:50,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:01:50,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:01:50,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:01:50,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:01:50,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:01:53,204 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:53,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:01:57,468 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:01:57,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:01:57,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-01-31 17:01:57,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:01:57,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-31 17:01:57,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-31 17:01:57,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12266, Invalid=17836, Unknown=0, NotChecked=0, Total=30102 [2019-01-31 17:01:57,493 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 142 states. [2019-01-31 17:02:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:02,296 INFO L93 Difference]: Finished difference Result 356 states and 356 transitions. [2019-01-31 17:02:02,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-31 17:02:02,297 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 346 [2019-01-31 17:02:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:02,298 INFO L225 Difference]: With dead ends: 356 [2019-01-31 17:02:02,298 INFO L226 Difference]: Without dead ends: 355 [2019-01-31 17:02:02,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 551 SyntacticMatches, 38 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24507 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=21926, Invalid=36880, Unknown=0, NotChecked=0, Total=58806 [2019-01-31 17:02:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-01-31 17:02:02,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 352. [2019-01-31 17:02:02,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-01-31 17:02:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 352 transitions. [2019-01-31 17:02:02,388 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 352 transitions. Word has length 346 [2019-01-31 17:02:02,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:02,389 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 352 transitions. [2019-01-31 17:02:02,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-31 17:02:02,389 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 352 transitions. [2019-01-31 17:02:02,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-01-31 17:02:02,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:02,390 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1, 1] [2019-01-31 17:02:02,390 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:02:02,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:02,390 INFO L82 PathProgramCache]: Analyzing trace with hash 116568017, now seen corresponding path program 69 times [2019-01-31 17:02:02,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:02,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:02,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:02:02,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:02,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:05,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:05,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:05,159 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:05,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:02:05,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:05,160 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:02:05,168 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:02:05,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:02:05,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:02:05,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:02:05,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:05,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:02:05,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:02:05,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:02:05,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:02:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:08,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:12,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:12,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-01-31 17:02:12,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:12,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-31 17:02:12,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-31 17:02:12,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12369, Invalid=18081, Unknown=0, NotChecked=0, Total=30450 [2019-01-31 17:02:12,858 INFO L87 Difference]: Start difference. First operand 352 states and 352 transitions. Second operand 144 states. [2019-01-31 17:02:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:17,797 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2019-01-31 17:02:17,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-31 17:02:17,797 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 351 [2019-01-31 17:02:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:17,798 INFO L225 Difference]: With dead ends: 361 [2019-01-31 17:02:17,798 INFO L226 Difference]: Without dead ends: 360 [2019-01-31 17:02:17,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 559 SyntacticMatches, 40 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25146 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=22204, Invalid=37576, Unknown=0, NotChecked=0, Total=59780 [2019-01-31 17:02:17,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-01-31 17:02:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 357. [2019-01-31 17:02:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-01-31 17:02:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-01-31 17:02:17,890 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 351 [2019-01-31 17:02:17,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:17,890 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-01-31 17:02:17,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-31 17:02:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-01-31 17:02:17,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-01-31 17:02:17,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:17,892 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1, 1] [2019-01-31 17:02:17,892 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:02:17,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:17,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2014892441, now seen corresponding path program 70 times [2019-01-31 17:02:17,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:17,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:17,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:02:17,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:17,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:20,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:20,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:20,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:20,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:02:20,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:20,777 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:02:20,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:02:20,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:02:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:21,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:21,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:02:21,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:02:21,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:02:21,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:02:24,552 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:24,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:28,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:28,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-01-31 17:02:28,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:28,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-31 17:02:28,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-31 17:02:28,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12472, Invalid=18328, Unknown=0, NotChecked=0, Total=30800 [2019-01-31 17:02:28,712 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 146 states. [2019-01-31 17:02:33,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:33,596 INFO L93 Difference]: Finished difference Result 366 states and 366 transitions. [2019-01-31 17:02:33,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-31 17:02:33,596 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 356 [2019-01-31 17:02:33,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:33,598 INFO L225 Difference]: With dead ends: 366 [2019-01-31 17:02:33,598 INFO L226 Difference]: Without dead ends: 365 [2019-01-31 17:02:33,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 567 SyntacticMatches, 42 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25787 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=22483, Invalid=38279, Unknown=0, NotChecked=0, Total=60762 [2019-01-31 17:02:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-01-31 17:02:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2019-01-31 17:02:33,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-01-31 17:02:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2019-01-31 17:02:33,692 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 356 [2019-01-31 17:02:33,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:33,692 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2019-01-31 17:02:33,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-31 17:02:33,692 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2019-01-31 17:02:33,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-01-31 17:02:33,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:33,694 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1, 1] [2019-01-31 17:02:33,694 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:02:33,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:33,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2113380975, now seen corresponding path program 71 times [2019-01-31 17:02:33,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:33,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:33,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:02:33,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:33,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:36,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:36,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:36,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:36,643 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:36,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:02:36,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:36,644 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:02:36,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:02:36,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:02:37,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-31 17:02:37,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:02:37,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:37,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:02:37,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:02:37,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:02:37,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:02:40,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:40,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:02:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:45,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:02:45,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-01-31 17:02:45,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:02:45,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-31 17:02:45,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-31 17:02:45,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12575, Invalid=18577, Unknown=0, NotChecked=0, Total=31152 [2019-01-31 17:02:45,209 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 148 states. [2019-01-31 17:02:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:02:50,271 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-01-31 17:02:50,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-31 17:02:50,271 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 361 [2019-01-31 17:02:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:02:50,272 INFO L225 Difference]: With dead ends: 371 [2019-01-31 17:02:50,273 INFO L226 Difference]: Without dead ends: 370 [2019-01-31 17:02:50,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 575 SyntacticMatches, 44 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26430 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=22763, Invalid=38989, Unknown=0, NotChecked=0, Total=61752 [2019-01-31 17:02:50,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-01-31 17:02:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2019-01-31 17:02:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-31 17:02:50,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2019-01-31 17:02:50,370 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 361 [2019-01-31 17:02:50,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:02:50,371 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2019-01-31 17:02:50,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-31 17:02:50,371 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2019-01-31 17:02:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-01-31 17:02:50,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:02:50,372 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1, 1] [2019-01-31 17:02:50,372 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:02:50,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:02:50,373 INFO L82 PathProgramCache]: Analyzing trace with hash 804788391, now seen corresponding path program 72 times [2019-01-31 17:02:50,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:02:50,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:50,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:02:50,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:02:50,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:02:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:02:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:53,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:53,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:02:53,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:02:53,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:02:53,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:02:53,161 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:02:53,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:02:53,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:02:53,422 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:02:53,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:02:53,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:02:53,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:02:53,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:02:53,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:02:53,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:02:56,947 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:02:56,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:01,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:01,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-01-31 17:03:01,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:01,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-31 17:03:01,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-31 17:03:01,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12678, Invalid=18828, Unknown=0, NotChecked=0, Total=31506 [2019-01-31 17:03:01,515 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 150 states. [2019-01-31 17:03:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:06,726 INFO L93 Difference]: Finished difference Result 376 states and 376 transitions. [2019-01-31 17:03:06,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-31 17:03:06,726 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 366 [2019-01-31 17:03:06,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:06,727 INFO L225 Difference]: With dead ends: 376 [2019-01-31 17:03:06,727 INFO L226 Difference]: Without dead ends: 375 [2019-01-31 17:03:06,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 583 SyntacticMatches, 46 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27075 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=23044, Invalid=39706, Unknown=0, NotChecked=0, Total=62750 [2019-01-31 17:03:06,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-01-31 17:03:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2019-01-31 17:03:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-01-31 17:03:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 372 transitions. [2019-01-31 17:03:06,830 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 372 transitions. Word has length 366 [2019-01-31 17:03:06,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:06,830 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 372 transitions. [2019-01-31 17:03:06,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-31 17:03:06,830 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 372 transitions. [2019-01-31 17:03:06,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-01-31 17:03:06,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:06,832 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1, 1] [2019-01-31 17:03:06,832 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:03:06,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:06,832 INFO L82 PathProgramCache]: Analyzing trace with hash 523230033, now seen corresponding path program 73 times [2019-01-31 17:03:06,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:06,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:06,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:03:06,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:06,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:09,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:09,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:09,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:09,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:03:09,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:09,749 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:03:09,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:03:09,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:03:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:09,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:09,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:03:09,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:03:10,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:03:10,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:03:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:13,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:17,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:17,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-01-31 17:03:17,973 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:17,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-31 17:03:17,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-31 17:03:17,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12781, Invalid=19081, Unknown=0, NotChecked=0, Total=31862 [2019-01-31 17:03:17,975 INFO L87 Difference]: Start difference. First operand 372 states and 372 transitions. Second operand 152 states. [2019-01-31 17:03:23,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:23,202 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2019-01-31 17:03:23,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-31 17:03:23,202 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 371 [2019-01-31 17:03:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:23,203 INFO L225 Difference]: With dead ends: 381 [2019-01-31 17:03:23,203 INFO L226 Difference]: Without dead ends: 380 [2019-01-31 17:03:23,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 591 SyntacticMatches, 48 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27722 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=23326, Invalid=40430, Unknown=0, NotChecked=0, Total=63756 [2019-01-31 17:03:23,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-01-31 17:03:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2019-01-31 17:03:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-01-31 17:03:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-01-31 17:03:23,307 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 371 [2019-01-31 17:03:23,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:23,307 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-01-31 17:03:23,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-31 17:03:23,307 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-01-31 17:03:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-01-31 17:03:23,309 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:23,309 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1, 1] [2019-01-31 17:03:23,309 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:03:23,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:23,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1217999591, now seen corresponding path program 74 times [2019-01-31 17:03:23,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:23,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:23,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:03:23,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:23,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:26,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:26,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:26,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:26,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:03:26,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:26,593 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:03:26,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:03:26,601 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:03:27,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-31 17:03:27,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:03:27,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:27,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:03:27,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:03:27,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:03:27,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:03:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:31,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:35,341 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:35,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:35,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-01-31 17:03:35,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:35,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-31 17:03:35,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-31 17:03:35,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12884, Invalid=19336, Unknown=0, NotChecked=0, Total=32220 [2019-01-31 17:03:35,364 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 154 states. [2019-01-31 17:03:41,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:41,097 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2019-01-31 17:03:41,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-31 17:03:41,098 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 376 [2019-01-31 17:03:41,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:41,099 INFO L225 Difference]: With dead ends: 386 [2019-01-31 17:03:41,099 INFO L226 Difference]: Without dead ends: 385 [2019-01-31 17:03:41,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 599 SyntacticMatches, 50 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28371 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=23609, Invalid=41161, Unknown=0, NotChecked=0, Total=64770 [2019-01-31 17:03:41,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-01-31 17:03:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 382. [2019-01-31 17:03:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-31 17:03:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 382 transitions. [2019-01-31 17:03:41,207 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 382 transitions. Word has length 376 [2019-01-31 17:03:41,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:41,207 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 382 transitions. [2019-01-31 17:03:41,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-31 17:03:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 382 transitions. [2019-01-31 17:03:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-01-31 17:03:41,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:41,209 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1, 1] [2019-01-31 17:03:41,209 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:03:41,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:41,209 INFO L82 PathProgramCache]: Analyzing trace with hash 241510673, now seen corresponding path program 75 times [2019-01-31 17:03:41,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:41,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:41,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:03:41,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:41,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:03:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:44,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:44,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:03:44,220 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:03:44,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:03:44,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:03:44,220 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:03:44,229 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:03:44,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:03:44,488 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:03:44,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:03:44,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:03:44,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:03:44,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:03:44,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:03:44,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:03:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:48,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:03:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:03:53,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:03:53,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-01-31 17:03:53,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:03:53,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-31 17:03:53,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-31 17:03:53,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12987, Invalid=19593, Unknown=0, NotChecked=0, Total=32580 [2019-01-31 17:03:53,015 INFO L87 Difference]: Start difference. First operand 382 states and 382 transitions. Second operand 156 states. [2019-01-31 17:03:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:03:58,683 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-01-31 17:03:58,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-31 17:03:58,683 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 381 [2019-01-31 17:03:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:03:58,684 INFO L225 Difference]: With dead ends: 391 [2019-01-31 17:03:58,684 INFO L226 Difference]: Without dead ends: 390 [2019-01-31 17:03:58,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 607 SyntacticMatches, 52 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29022 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=23893, Invalid=41899, Unknown=0, NotChecked=0, Total=65792 [2019-01-31 17:03:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-01-31 17:03:58,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2019-01-31 17:03:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-01-31 17:03:58,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2019-01-31 17:03:58,794 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 381 [2019-01-31 17:03:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:03:58,794 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2019-01-31 17:03:58,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-31 17:03:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2019-01-31 17:03:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-01-31 17:03:58,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:03:58,796 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1, 1] [2019-01-31 17:03:58,796 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:03:58,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:03:58,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1062108455, now seen corresponding path program 76 times [2019-01-31 17:03:58,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:03:58,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:58,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:03:58,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:03:58,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:03:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:02,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:02,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:02,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:02,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:04:02,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:02,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:04:02,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:04:02,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:04:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:02,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:02,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:04:02,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:04:02,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:04:02,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:04:05,940 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:05,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:10,685 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:10,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:10,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-01-31 17:04:10,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:10,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-31 17:04:10,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-31 17:04:10,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13090, Invalid=19852, Unknown=0, NotChecked=0, Total=32942 [2019-01-31 17:04:10,708 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 158 states. [2019-01-31 17:04:16,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:04:16,714 INFO L93 Difference]: Finished difference Result 396 states and 396 transitions. [2019-01-31 17:04:16,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-31 17:04:16,715 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 386 [2019-01-31 17:04:16,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:04:16,716 INFO L225 Difference]: With dead ends: 396 [2019-01-31 17:04:16,716 INFO L226 Difference]: Without dead ends: 395 [2019-01-31 17:04:16,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 926 GetRequests, 615 SyntacticMatches, 54 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29675 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=24178, Invalid=42644, Unknown=0, NotChecked=0, Total=66822 [2019-01-31 17:04:16,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-01-31 17:04:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 392. [2019-01-31 17:04:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-01-31 17:04:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 392 transitions. [2019-01-31 17:04:16,831 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 392 transitions. Word has length 386 [2019-01-31 17:04:16,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:04:16,831 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 392 transitions. [2019-01-31 17:04:16,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-31 17:04:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 392 transitions. [2019-01-31 17:04:16,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-01-31 17:04:16,833 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:04:16,833 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1, 1] [2019-01-31 17:04:16,833 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:04:16,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:04:16,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1264302383, now seen corresponding path program 77 times [2019-01-31 17:04:16,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:04:16,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:16,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:04:16,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:16,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:04:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:19,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:19,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:19,974 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:19,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:04:19,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:19,975 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:04:19,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:04:19,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:04:20,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-31 17:04:20,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:04:20,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:20,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:04:20,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:04:20,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:04:20,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:04:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:24,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:29,365 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:29,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:29,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-01-31 17:04:29,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:29,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-31 17:04:29,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-31 17:04:29,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13193, Invalid=20113, Unknown=0, NotChecked=0, Total=33306 [2019-01-31 17:04:29,390 INFO L87 Difference]: Start difference. First operand 392 states and 392 transitions. Second operand 160 states. [2019-01-31 17:04:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:04:35,306 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2019-01-31 17:04:35,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-31 17:04:35,306 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 391 [2019-01-31 17:04:35,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:04:35,308 INFO L225 Difference]: With dead ends: 401 [2019-01-31 17:04:35,308 INFO L226 Difference]: Without dead ends: 400 [2019-01-31 17:04:35,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 938 GetRequests, 623 SyntacticMatches, 56 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30330 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=24464, Invalid=43396, Unknown=0, NotChecked=0, Total=67860 [2019-01-31 17:04:35,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-01-31 17:04:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 397. [2019-01-31 17:04:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-01-31 17:04:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-01-31 17:04:35,423 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 391 [2019-01-31 17:04:35,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:04:35,424 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-01-31 17:04:35,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-31 17:04:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-01-31 17:04:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-01-31 17:04:35,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:04:35,425 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1, 1] [2019-01-31 17:04:35,425 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:04:35,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:04:35,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1822160743, now seen corresponding path program 78 times [2019-01-31 17:04:35,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:04:35,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:35,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:04:35,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:35,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:04:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:38,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:38,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:38,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:38,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:04:38,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:38,806 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:04:38,815 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:04:38,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:04:39,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:04:39,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:04:39,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:39,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:04:39,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:04:39,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:04:39,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:04:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:43,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:04:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:47,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:04:47,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-01-31 17:04:47,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:04:47,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-31 17:04:47,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-31 17:04:47,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13296, Invalid=20376, Unknown=0, NotChecked=0, Total=33672 [2019-01-31 17:04:47,635 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 162 states. [2019-01-31 17:04:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:04:53,621 INFO L93 Difference]: Finished difference Result 406 states and 406 transitions. [2019-01-31 17:04:53,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-31 17:04:53,621 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 396 [2019-01-31 17:04:53,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:04:53,623 INFO L225 Difference]: With dead ends: 406 [2019-01-31 17:04:53,623 INFO L226 Difference]: Without dead ends: 405 [2019-01-31 17:04:53,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 631 SyntacticMatches, 58 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30987 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=24751, Invalid=44155, Unknown=0, NotChecked=0, Total=68906 [2019-01-31 17:04:53,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-01-31 17:04:53,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2019-01-31 17:04:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-01-31 17:04:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 402 transitions. [2019-01-31 17:04:53,742 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 402 transitions. Word has length 396 [2019-01-31 17:04:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:04:53,742 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 402 transitions. [2019-01-31 17:04:53,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-31 17:04:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 402 transitions. [2019-01-31 17:04:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-01-31 17:04:53,744 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:04:53,744 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1, 1] [2019-01-31 17:04:53,744 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:04:53,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:04:53,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1810445457, now seen corresponding path program 79 times [2019-01-31 17:04:53,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:04:53,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:53,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:04:53,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:04:53,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:04:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:57,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:04:57,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:57,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:04:57,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:04:57,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:04:57,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:04:57,043 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:04:57,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:04:57,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:04:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:04:57,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:04:57,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:04:57,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:04:57,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:04:57,316 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:05:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:01,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:05,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:05,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-01-31 17:05:05,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:05,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-31 17:05:05,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-31 17:05:05,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13399, Invalid=20641, Unknown=0, NotChecked=0, Total=34040 [2019-01-31 17:05:05,989 INFO L87 Difference]: Start difference. First operand 402 states and 402 transitions. Second operand 164 states. [2019-01-31 17:05:12,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:12,045 INFO L93 Difference]: Finished difference Result 411 states and 411 transitions. [2019-01-31 17:05:12,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-31 17:05:12,045 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 401 [2019-01-31 17:05:12,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:12,047 INFO L225 Difference]: With dead ends: 411 [2019-01-31 17:05:12,047 INFO L226 Difference]: Without dead ends: 410 [2019-01-31 17:05:12,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 639 SyntacticMatches, 60 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31646 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=25039, Invalid=44921, Unknown=0, NotChecked=0, Total=69960 [2019-01-31 17:05:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-31 17:05:12,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2019-01-31 17:05:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-01-31 17:05:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2019-01-31 17:05:12,169 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 401 [2019-01-31 17:05:12,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:12,169 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2019-01-31 17:05:12,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-31 17:05:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2019-01-31 17:05:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-01-31 17:05:12,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:12,171 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1, 1] [2019-01-31 17:05:12,171 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:05:12,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1409655207, now seen corresponding path program 80 times [2019-01-31 17:05:12,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:12,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:12,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:12,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:12,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:15,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:15,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:15,752 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:05:15,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:05:15,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:15,753 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:05:15,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:05:15,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:05:16,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-31 17:05:16,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:05:16,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:16,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:05:16,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:05:16,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:05:16,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:05:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:20,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:25,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:25,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-01-31 17:05:25,518 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:25,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-31 17:05:25,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-31 17:05:25,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13502, Invalid=20908, Unknown=0, NotChecked=0, Total=34410 [2019-01-31 17:05:25,521 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 166 states. [2019-01-31 17:05:31,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:31,962 INFO L93 Difference]: Finished difference Result 416 states and 416 transitions. [2019-01-31 17:05:31,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-31 17:05:31,962 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 406 [2019-01-31 17:05:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:31,964 INFO L225 Difference]: With dead ends: 416 [2019-01-31 17:05:31,964 INFO L226 Difference]: Without dead ends: 415 [2019-01-31 17:05:31,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 974 GetRequests, 647 SyntacticMatches, 62 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32307 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=25328, Invalid=45694, Unknown=0, NotChecked=0, Total=71022 [2019-01-31 17:05:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-01-31 17:05:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 412. [2019-01-31 17:05:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-01-31 17:05:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 412 transitions. [2019-01-31 17:05:32,125 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 412 transitions. Word has length 406 [2019-01-31 17:05:32,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:32,126 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 412 transitions. [2019-01-31 17:05:32,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-31 17:05:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 412 transitions. [2019-01-31 17:05:32,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-01-31 17:05:32,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:32,127 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1, 1] [2019-01-31 17:05:32,128 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:05:32,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:32,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1127215697, now seen corresponding path program 81 times [2019-01-31 17:05:32,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:32,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:32,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:05:32,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:32,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:35,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:35,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:35,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:05:35,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:05:35,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:35,735 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:05:35,742 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:05:35,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:05:36,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:05:36,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:05:36,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:36,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:05:36,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:05:36,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:05:36,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:05:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:40,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:05:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:44,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:05:44,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-01-31 17:05:44,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:05:44,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-31 17:05:44,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-31 17:05:44,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13605, Invalid=21177, Unknown=0, NotChecked=0, Total=34782 [2019-01-31 17:05:44,934 INFO L87 Difference]: Start difference. First operand 412 states and 412 transitions. Second operand 168 states. [2019-01-31 17:05:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:05:51,388 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2019-01-31 17:05:51,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-31 17:05:51,388 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 411 [2019-01-31 17:05:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:05:51,389 INFO L225 Difference]: With dead ends: 421 [2019-01-31 17:05:51,390 INFO L226 Difference]: Without dead ends: 420 [2019-01-31 17:05:51,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 986 GetRequests, 655 SyntacticMatches, 64 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32970 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=25618, Invalid=46474, Unknown=0, NotChecked=0, Total=72092 [2019-01-31 17:05:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-01-31 17:05:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 417. [2019-01-31 17:05:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-01-31 17:05:51,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2019-01-31 17:05:51,523 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 411 [2019-01-31 17:05:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:05:51,523 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 417 transitions. [2019-01-31 17:05:51,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-31 17:05:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 417 transitions. [2019-01-31 17:05:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-01-31 17:05:51,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:05:51,524 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1, 1] [2019-01-31 17:05:51,525 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:05:51,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:05:51,525 INFO L82 PathProgramCache]: Analyzing trace with hash -468747289, now seen corresponding path program 82 times [2019-01-31 17:05:51,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:05:51,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:51,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:05:51,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:05:51,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:05:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:55,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:55,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:05:55,360 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:05:55,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:05:55,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:05:55,361 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:05:55,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:05:55,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:05:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:05:55,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:05:55,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:05:55,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:05:55,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:05:55,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:05:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:05:59,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:04,656 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:04,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:04,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 187 [2019-01-31 17:06:04,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:04,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-31 17:06:04,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-31 17:06:04,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13708, Invalid=21448, Unknown=0, NotChecked=0, Total=35156 [2019-01-31 17:06:04,679 INFO L87 Difference]: Start difference. First operand 417 states and 417 transitions. Second operand 170 states. [2019-01-31 17:06:11,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:11,160 INFO L93 Difference]: Finished difference Result 426 states and 426 transitions. [2019-01-31 17:06:11,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-31 17:06:11,161 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 416 [2019-01-31 17:06:11,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:11,162 INFO L225 Difference]: With dead ends: 426 [2019-01-31 17:06:11,162 INFO L226 Difference]: Without dead ends: 425 [2019-01-31 17:06:11,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 998 GetRequests, 663 SyntacticMatches, 66 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33635 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=25909, Invalid=47261, Unknown=0, NotChecked=0, Total=73170 [2019-01-31 17:06:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-01-31 17:06:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2019-01-31 17:06:11,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-01-31 17:06:11,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 422 transitions. [2019-01-31 17:06:11,293 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 422 transitions. Word has length 416 [2019-01-31 17:06:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:11,294 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 422 transitions. [2019-01-31 17:06:11,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-31 17:06:11,294 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 422 transitions. [2019-01-31 17:06:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-01-31 17:06:11,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:11,296 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1, 1] [2019-01-31 17:06:11,296 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:06:11,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:11,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1099661295, now seen corresponding path program 83 times [2019-01-31 17:06:11,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:11,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:11,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:11,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:11,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:15,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:15,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:15,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:15,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:15,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:15,427 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:15,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:06:15,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:06:16,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-01-31 17:06:16,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:16,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:16,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:06:16,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:16,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:16,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:06:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:20,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:25,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:25,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 188 [2019-01-31 17:06:25,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:25,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-01-31 17:06:25,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-01-31 17:06:25,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13811, Invalid=21721, Unknown=0, NotChecked=0, Total=35532 [2019-01-31 17:06:25,627 INFO L87 Difference]: Start difference. First operand 422 states and 422 transitions. Second operand 172 states. [2019-01-31 17:06:32,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:32,223 INFO L93 Difference]: Finished difference Result 431 states and 431 transitions. [2019-01-31 17:06:32,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-31 17:06:32,223 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 421 [2019-01-31 17:06:32,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:32,225 INFO L225 Difference]: With dead ends: 431 [2019-01-31 17:06:32,225 INFO L226 Difference]: Without dead ends: 430 [2019-01-31 17:06:32,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 671 SyntacticMatches, 68 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34302 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=26201, Invalid=48055, Unknown=0, NotChecked=0, Total=74256 [2019-01-31 17:06:32,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-01-31 17:06:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 427. [2019-01-31 17:06:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-01-31 17:06:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 427 transitions. [2019-01-31 17:06:32,362 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 427 transitions. Word has length 421 [2019-01-31 17:06:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:32,363 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 427 transitions. [2019-01-31 17:06:32,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-01-31 17:06:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 427 transitions. [2019-01-31 17:06:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-01-31 17:06:32,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:32,365 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1, 1] [2019-01-31 17:06:32,365 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:06:32,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:32,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1237481945, now seen corresponding path program 84 times [2019-01-31 17:06:32,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:32,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:32,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:32,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:32,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:36,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:36,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:36,291 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:36,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:36,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:36,292 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:36,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:06:36,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:06:36,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:06:36,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:36,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:36,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:06:36,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:36,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:06:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:41,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:45,936 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:45,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:45,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 189 [2019-01-31 17:06:45,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:45,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-01-31 17:06:45,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-01-31 17:06:45,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13914, Invalid=21996, Unknown=0, NotChecked=0, Total=35910 [2019-01-31 17:06:45,961 INFO L87 Difference]: Start difference. First operand 427 states and 427 transitions. Second operand 174 states. [2019-01-31 17:06:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:52,837 INFO L93 Difference]: Finished difference Result 436 states and 436 transitions. [2019-01-31 17:06:52,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-31 17:06:52,838 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 426 [2019-01-31 17:06:52,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:52,839 INFO L225 Difference]: With dead ends: 436 [2019-01-31 17:06:52,839 INFO L226 Difference]: Without dead ends: 435 [2019-01-31 17:06:52,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1022 GetRequests, 679 SyntacticMatches, 70 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34971 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=26494, Invalid=48856, Unknown=0, NotChecked=0, Total=75350 [2019-01-31 17:06:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-01-31 17:06:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 432. [2019-01-31 17:06:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-01-31 17:06:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 432 transitions. [2019-01-31 17:06:52,978 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 432 transitions. Word has length 426 [2019-01-31 17:06:52,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:52,978 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 432 transitions. [2019-01-31 17:06:52,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-01-31 17:06:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 432 transitions. [2019-01-31 17:06:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-01-31 17:06:52,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:52,980 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 86, 85, 85, 1, 1, 1] [2019-01-31 17:06:52,980 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:06:52,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:52,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1766662703, now seen corresponding path program 85 times [2019-01-31 17:06:52,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:52,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:52,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:52,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:56,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:56,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:56,975 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:56,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:56,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:56,976 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:06:56,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:56,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:57,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:57,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:06:57,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-31 17:07:01,986 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:01,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:06,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:06,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 190 [2019-01-31 17:07:06,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:06,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-01-31 17:07:06,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-01-31 17:07:06,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14017, Invalid=22273, Unknown=0, NotChecked=0, Total=36290 [2019-01-31 17:07:06,710 INFO L87 Difference]: Start difference. First operand 432 states and 432 transitions. Second operand 176 states. [2019-01-31 17:07:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:13,572 INFO L93 Difference]: Finished difference Result 441 states and 441 transitions. [2019-01-31 17:07:13,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-31 17:07:13,573 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 431 [2019-01-31 17:07:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:13,574 INFO L225 Difference]: With dead ends: 441 [2019-01-31 17:07:13,574 INFO L226 Difference]: Without dead ends: 440 [2019-01-31 17:07:13,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 687 SyntacticMatches, 72 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35642 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=26788, Invalid=49664, Unknown=0, NotChecked=0, Total=76452 [2019-01-31 17:07:13,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-01-31 17:07:13,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 437. [2019-01-31 17:07:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-01-31 17:07:13,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 437 transitions. [2019-01-31 17:07:13,716 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 437 transitions. Word has length 431 [2019-01-31 17:07:13,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:13,716 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 437 transitions. [2019-01-31 17:07:13,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-01-31 17:07:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 437 transitions. [2019-01-31 17:07:13,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-01-31 17:07:13,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:13,718 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 86, 1, 1, 1] [2019-01-31 17:07:13,718 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-31 17:07:13,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:13,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1326694503, now seen corresponding path program 86 times [2019-01-31 17:07:13,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:13,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:13,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:13,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:13,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:17,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:17,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:17,862 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:17,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:17,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:17,863 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:07:17,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:17,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:18,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-01-31 17:07:18,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:18,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:18,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-31 17:07:18,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:18,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9